QUAD: A multivariate stream cipher with provable security

DOI10.1016/J.JSC.2008.10.004MaRDI QIDQ733512zbMATH OpenOpenAlexWikidataFDO

Authors Côme Berbain, Henri Gilbert, Jacques Patarin

Publication date 16 October 2009

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

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

zbMATH Keywords

provable securitystream cipherMQ problemGröbner basis computation

Mathematics Subject Classification ID

Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• QUAD: A Practical Stream Cipher with Provable Security
• Analysis of QUAD
• Revisiting the security proof of QUAD stream cipher: some corrections and tighter bounds
• Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
• Efficient Implementations of Multivariate Quadratic Systems

Cites work

• scientific article; zbMATH DE number 2085432 (Why is no real title available?)
• scientific article; zbMATH DE number 2089137 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 3724342 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1306862 (Why is no real title available?)
• scientific article; zbMATH DE number 1107704 (Why is no real title available?)
• scientific article; zbMATH DE number 1951604 (Why is no real title available?)
• scientific article; zbMATH DE number 1962148 (Why is no real title available?)
• scientific article; zbMATH DE number 2081057 (Why is no real title available?)
• scientific article; zbMATH DE number 4186980 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A Simple Unpredictable Pseudo-Random Number Generator
• A new efficient algorithm for computing Gröbner bases (F₄)
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• An efficient pseudo-random generator provably as secure as syndrome decoding
• Comparison Between XL and Gröbner Basis Algorithms
• Complexity of solving algebraic equations
• Efficient Implementations of Multivariate Quadratic Systems
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Efficient cryptographic schemes provably as secure as subset sum
• Foundations of Cryptography
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• 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
• Unbalanced Oil and Vinegar Signature Schemes

Cited in

(10)

• Polly cracker, revisited
• Efficient Implementations of Multivariate Quadratic Systems
• Revisiting the security proof of QUAD stream cipher: some corrections and tighter bounds
• scientific article; zbMATH DE number 1588467 (Why is no real title available?)
• Low-complexity cryptographic hash functions
• Analysis of QUAD
• A pseudorandom number generator based on worst-case lattice problems
• Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
• Fuzzy matching template attacks on multivariate cryptography: a case study
• On the Security of IV Dependent Stream Ciphers

Describes a project that uses

Uses Software

• SNOW
• QUAD
• Grain
• eSTREAM
• Trivium
• Scream
• FGb

This page was built for publication: QUAD: A multivariate stream cipher with provable security

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