On a family of preimage-resistant functions

DOI10.2478/v10127-010-0028-3zbMath1287.94052MaRDI QIDQ3075868

János Folláth, Attila Pethoe, Attila Bérczes

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

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

11T06: Polynomials over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A one-way function based on norm form equations
• A fast software one-way hash function
• An application of index forms in cryptography
• A lower bound for the number of solutions of equations over finite fields
• Number theoretic methods in cryptography. Complexity lower bounds
• Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
• On reducible trinomials. III
• An implementation for a fast public-key cryptosystem
• Improved explicit estimates on the number of solutions of equations over a finite field
• On Constructing 1-1 One-Way Functions
• An efficient optimal normal basis type II multiplier
• A modified Massey-Omura parallel multiplier for a class of finite fields
• Type-II Optimal Polynomial Bases
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• Cryptanalysis of a Hash Function Based on Norm Form Equations
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Errata to "On reducible trinomials" (Dissertationes Mathematicae 329 (1993))
• On the complexity of factoring bivariate supersparse (Lacunary) polynomials
• Factoring Polynomials Over Large Finite Fields
• Fast Software Encryption
• Number of Points of Varieties in Finite Fields