Hash-functions using modulo-N operations

DOI10.1007/3-540-39118-5_20zbMATH Open1464.94035OpenAlexW1522255819MaRDI QIDQ5000242FDOQ5000242

Authors: Marc Girault 

Publication date: 10 July 2021

Published in: Advances in cryptology -- EUROCRYPT '87. Workshop on the theory and application of cryptographic techniques, Amsterdam, Netherlands, April 13--15, 1987. Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39118-5_20

Recommendations

• Producing a one-way hash function from DES
• scientific article; zbMATH DE number 4057439
• A fast software one-way hash function
• Find me a hash.
• scientific article; zbMATH DE number 177045

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Prime numbers and computer methods for factorization
• Producing a one-way hash function from DES
• On the security of compressed encodings

Cited In (6)

• Parameterized hash functions
• Find me a hash.
• The Grindahl Hash Functions
• The hash function \texttt{BLAKE}
• Title not available (Why is that?)
• Producing a one-way hash function from DES

This page was built for publication: Hash-functions using modulo-\(N\) operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000242)