On Symmetric Encryption with Distinguishable Decryption Failures* Alexandra Boldyreva1 , Jean Paul Degabriele2 , Kenneth G. Paterson2 , and Martijn Stam3 2 1 Georgia Institute of Technology

Source URL: eprint.iacr.org

• Cryptography
• Ciphertext indistinguishability
• Semantic security
• Chosen-ciphertext attack
• Block cipher
• Encryption
• Feistel cipher
• RSA
• Ciphertext
• Chosen-plaintext attack
• Cipher
• Advantage

On Fault Injections in Generalized Feistel Networks

Source URL: conferenze.dei.polimi.it

Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers Peter Gaˇzi ETH Zurich, Switzerland Department of Computer Science

Source URL: pub.ist.ac.at

• Cryptography
• Block cipher
• Advantage
• Pseudorandom permutation
• Data Encryption Standard
• Feistel cipher
• Stream ciphers
• Distinguishing attack
• Exclusive or
• Advanced Encryption Standard
• Running key cipher
• One-way compression function

Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading? Peter Gaˇzi1,2 and Stefano Tessaro3,4 1 Department of Computer Science, Comenius University, Bratislava, Slovakia

Source URL: pub.ist.ac.at

• Cryptography
• Advantage
• Block cipher
• Pseudorandom permutation
• Feistel cipher
• Cardinal number
• One-way compression function
• Index of cryptography articles

Easy Verifiable Primitives and Practical Public Key Cryptosystems David Galindo, Sebasti`a Mart´ın, Paz Morillo and Jorge L. Villar Dep. Matem` atica Aplicada IV. Universitat Polit`ecnica de Catalunya Campus Nord, c/Jo

Source URL: www.dgalindo.es

• Cryptography
• Ciphertext indistinguishability
• Paillier cryptosystem
• Probabilistic encryption
• CramerShoup cryptosystem
• ElGamal encryption
• Chosen-ciphertext attack
• Cryptosystem
• Advantage
• Trapdoor function
• Feistel cipher
• RSA

Differential Attacks on Generalized Feistel Schemes Val´erie Nachef1 , Emmanuel Volte1 , and Jacques Patarin2 1 Department of Mathematics, University of Cergy-Pontoise, CNRS UMR 8088

Source URL: www.prism.uvsq.fr

Luby-Rackoff: 7 Rounds are Enough for 2n(1−ε) Security Jacques Patarin, University of Versailles, France Abstract In [3] M. Luby and C. Rackoff have proved that 3-round random Feistel schemes are secure against all ad

Source URL: www.prism.uvsq.fr

Analysis of Impossible, Integral and Zero-Correlation Attacks on Type-II Generalized Feistel Networks using the Matrix Method C´eline Blondeau1 and Marine Minier2 1

Source URL: users.ics.aalto.fi

Bitslice Ciphers and Power Analysis Attacks Joan Daemen, Michael Peeters and Gilles Van Assche Proton World Intl. Rue Du Planeur 10, B-1130 Brussel, Belgium Email: {daemen.j, peeters.m, vanassche.g}@protonworld.com http:

Source URL: jda.noekeon.org

• Cryptography
• Block cipher
• BaseKing
• 3-Way
• Key schedule
• Linear cryptanalysis
• Cryptanalysis
• Data Encryption Standard
• VEST
• Advanced Encryption Standard
• Weak key
• Feistel cipher

Analysis of Impossible, Integral and Zero-Correlation Attacks on Type-II Generalized Feistel Networks using the Matrix Method ´ Celine

Source URL: users.ics.aalto.fi