Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
30
click to vote
ASIACRYPT
2001
Springer
favorite
Email
discuss
report
102
views
Cryptology
»
more
ASIACRYPT 2001
»
Generic Attacks on Feistel Schemes
14 years 3 months ago
Download
www.iacr.org
Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A:
Jacques Patarin
Real-time Traffic
ASIACRYPT 2001
|
Cryptology
|
Feistel Scheme
|
Present Paper
|
claim paper
Related Content
»
Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
»
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
»
Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
»
Security of Random Feistel Schemes with 5 or More Rounds
»
On Generalized Feistel Networks
»
Slide Attacks
»
Generic Attacks on Feistel Networks with Internal Permutations
»
Improving the Time Complexity of Matsuis Linear Cryptanalysis
»
Feistel Schemes and Bilinear Cryptanalysis
more »
Post Info
More Details (n/a)
Added
28 Jul 2010
Updated
28 Jul 2010
Type
Conference
Year
2001
Where
ASIACRYPT
Authors
Jacques Patarin
Comments
(0)
Researcher Info
Cryptology Study Group
Computer Vision