Secure PRNGs from Specialized Polynomial Maps over Any \mathbb{F}_{q}
From MaRDI portal
Publication:3535361
Recommendations
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- All in the XL Family: Theory and Practice
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An improved pseudo-random generator based on the discrete logarithm problem
- Analysis of Multivariate Hash Functions
- Analysis of QUAD
- Another Look at “Provable Security”. II
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Efficient Implementations of Multivariate Quadratic Systems
- Efficient Primitives from Exponentiation in ℤ p
- Efficient Pseudorandom Generators Based on the DDH Assumption
- Fast software encryption. 14th international workshop, FSE 2007, Luxembourg, Luxembourg, March 26--28, 2007. Revised selected papers
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 3864496 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Information Security and Privacy
- Learning polynomials with queries: The highly noisy case
- On Building Hash Functions from Multivariate Quadratic Equations
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
- On the Security of IV Dependent Stream Ciphers
- QUAD: A Practical Stream Cipher with Provable Security
- The XL-Algorithm and a Conjecture from Commutative Algebra
Cited in
(3)
This page was built for publication: Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535361)