A provably secure non-iterative hash function resisting birthday attack
From MaRDI portal
Recommendations
- A new non-Merkle-Damgård structural hash function with provable security
- A new hash function based on block cipher
- Security of iterated hash functions based on block ciphers
- scientific article; zbMATH DE number 503327
- Construction of secure and fast hash functions using nonbinary error-correcting codes
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A public key cryptosystem based on three new provable problems
- Advances in Cryptology - EUROCRYPT 2004
- Asymptotic granularity reduction and its application
- Collisions of SHA-0 and Reduced SHA-1
- Cryptanalysis of short RSA secret exponents
- Cryptographically strong undeniable signatures, unconditionally secure for the signer
- Finding Collisions in the Full SHA-1
- Foundations of Cryptography
- Hiding information and signatures in trapdoor knapsacks
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 4072862 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- scientific article; zbMATH DE number 1418967 (Why is no real title available?)
- Improved low-density subset sum algorithms
- Number theory for computing. Foreword by Martin E. Hellman.
- One Way Hash Functions and DES
- Ordered sets. An introduction
- Solving low density knapsacks
- SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags
This page was built for publication: A provably secure non-iterative hash function resisting birthday attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344781)