Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$

DOI10.1007/978-3-540-88403-3_13zbMath1177.94160OpenAlexW52779832MaRDI QIDQ3535361

Feng-Hao Liu, Bo-Yin Yang, Chi-Jen Lu

Publication date: 11 November 2008

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88403-3_13

zbMATH Keywords

provable securityhash functionPRNGsparse multivariate polynomial map

Mathematics Subject Classification ID

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

Related Items

Revisiting the Security Proof of QUAD Stream Cipher: Some Corrections and Tighter Bounds

Uses Software

• QUAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved pseudo-random generator based on the discrete logarithm problem
• Fast software encryption. 14th international workshop, FSE 2007, Luxembourg, Luxembourg, March 26--28, 2007. Revised selected papers
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Learning Polynomials with Queries: The Highly Noisy Case
• On the Security of IV Dependent Stream Ciphers
• Analysis of QUAD
• QUAD: A Practical Stream Cipher with Provable Security
• On Building Hash Functions from Multivariate Quadratic Equations
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Information Security and Privacy
• Analysis of Multivariate Hash Functions
• Efficient Implementations of Multivariate Quadratic Systems
• All in the XL Family: Theory and Practice
• Another Look at “Provable Security”. II
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
• The XL-Algorithm and a Conjecture from Commutative Algebra
• Efficient Pseudorandom Generators Based on the DDH Assumption
• Efficient Primitives from Exponentiation in ℤ p