Notes on a preimage-resistant hash function

DOI10.2478/V10127-012-0041-9zbMATH Open1308.94071OpenAlexW1487846698WikidataQ129894240 ScholiaQ129894240MaRDI QIDQ4906255FDOQ4906255

Authors: János Folláth 

Publication date: 11 February 2013

Published in: Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10127-012-0041-9

Recommendations

• On a family of preimage-resistant functions
• Some observations on the theory of cryptographic hash functions
• On Building Hash Functions from Multivariate Quadratic Equations
• Brute force attacks on hash functions
• Analysis of Multivariate Hash Functions

zbMATH Keywords

Dickson polynomialhash functionsDembowski-Ostrom polynomialstrict avalanche criterionplanar polynomial

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (4)

• On a family of preimage-resistant functions
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• An application of index forms in cryptography
• Expedient Non-malleability Notions for Hash Functions

This page was built for publication: Notes on a preimage-resistant hash function

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