Common composites of triangular polynomial systems and hash functions

DOI10.1016/j.jsc.2015.02.005zbMath1331.94054OpenAlexW1990918462MaRDI QIDQ492031

Jaime Gutierrez, Alina Ostafe, Domingo Gómez-Pérez

Publication date: 19 August 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2015.02.005

zbMATH Keywords

polynomial systemscompositioncollision

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials in general fields (irreducibility, etc.) (12E05)

Cites Work

• Unnamed Item
• On the power generator and its multivariate analogue
• On multivariate rational function decomposition
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Cryptographic hash functions from expander graphs
• Multivariate polynomial decomposition
• Pseudorandom numbers and hash functions from iterations of multivariate polynomials
• On Ritt's decomposition theorem in the case of finite fields
• High order derivatives and decomposition of multivariate polynomials
• Composition collisions and projective polynomials
• Decomposition of generic multivariate polynomials
• On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators
• On the statistical properties of Diffie-Hellman distributions

This page was built for publication: Common composites of triangular polynomial systems and hash functions