Security Analysis of SIMD

DOI10.1007/978-3-642-19574-7_24zbMath1293.94057OpenAlexW1836401064MaRDI QIDQ3084266

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

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_24

zbMATH Keywords

hash functiondistinguisherSHA-3SIMDsecurity proof with distinguishers

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Another Look at Complementation Properties
• Inside the Hypercube
• Related-Key Cryptanalysis of the Full AES-192 and AES-256
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• Provably Good Codes for Hash Function Design
• Finding Collisions in the Full SHA-1
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Theory of Cryptography
• Fast Software Encryption

This page was built for publication: Security Analysis of SIMD