Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3 512

DOI10.1007/978-3-642-19574-7_2zbMath1290.94047OpenAlexW1154108706MaRDI QIDQ3084241

Charles Bouillaguet, Gaëtan Leurent, Pierre-Alain Fouque, Orr Dunkelman

Publication date: 15 March 2011

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19574-7_2

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

Generalized Feistel networks revisited ⋮ Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes ⋮ Analysis of \(3\)-line generalized Feistel networks with double SD-functions ⋮ Analysis of Reduced-SHAvite-3-256 v2 ⋮ Known-Key Distinguishers on 11-Round Feistel and Collision Attacks on Its Hashing Modes ⋮ Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3 512

Cites Work

• Unnamed Item
• Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3 512
• Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512
• Another Look at Complementation Properties
• Speeding up Collision Search for Byte-Oriented Hash Functions
• Advanced Encryption Standard – AES

This page was built for publication: Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3 512