On a family of preimage-resistant functions

DOI10.2478/V10127-010-0028-3MaRDI QIDQ3075868zbMATH OpenOpenAlexFDO

Authors János Folláth, Attila Bérczes, Attila Pethő

Publication date 17 February 2011

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

Full work available at URL http://tatra.mat.savba.sk/Full/47/01bfp.pdf

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Polynomials over finite fields (11T06)

Recommendations

• Notes on a preimage-resistant hash function
• Cryptanalysis of the HaF family of hash functions
• On Building Hash Functions from Multivariate Quadratic Equations
• Preimages for the Tillich-Zémor hash function
• Multivariates Polynomials for Hashing

Cites work

• scientific article; zbMATH DE number 3965965 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 709841 (Why is no real title available?)
• scientific article; zbMATH DE number 1006115 (Why is no real title available?)
• scientific article; zbMATH DE number 1088248 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• scientific article; zbMATH DE number 2085208 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• A fast software one-way hash function
• A lower bound for the number of solutions of equations over finite fields
• A modified Massey-Omura parallel multiplier for a class of finite fields
• A one-way function based on norm form equations
• An application of index forms in cryptography
• An efficient optimal normal basis type II multiplier
• An implementation for a fast public-key cryptosystem
• Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
• Cryptanalysis of a Hash Function Based on Norm Form Equations
• Errata to "On reducible trinomials" (Dissertationes Mathematicae 329 (1993))
• Factoring Polynomials Over Large Finite Fields
• Fast Software Encryption
• Improved explicit estimates on the number of solutions of equations over a finite field
• Number of Points of Varieties in Finite Fields
• Number theoretic methods in cryptography. Complexity lower bounds
• On constructing 1-1 one-way functions
• On reducible trinomials. II
• On reducible trinomials. III
• On the complexity of factoring bivariate supersparse (lacunary) polynomials
• Type-II optimal polynomial bases
• VSH, an Efficient and Provable Collision-Resistant Hash Function

Cited in

(1)

• Notes on a preimage-resistant hash function

This page was built for publication: On a family of preimage-resistant functions

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