Robust and secured hash algorithm using DLP over finite fields

DOI10.14317/JAMI.2025.1067MaRDI QIDQ6912657zbMATH OpenFDO

Authors L. Dathan, G. S. G. N. Anjaneyulu, S. G. S. Hemanth

Publication date 22 October 2025

Published in Journal of Applied Mathematics \& Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14317/JAMI.2025.1067

zbMATH Keywords

\(2^{nd}\) pre-image resistancebirthday paradoxcollision resistancecompression functionhash digestpaddingpre-image resistance

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites work

• Analysis of SHA-512/224 and SHA-512/256
• Fast Software Encryption
• Merkle-Damgård Revisited: How to Construct a Hash Function
• The conjugacy search problem in public key cryptography: unnecessary and insufficient

This page was built for publication: Robust and secured hash algorithm using DLP over finite fields

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