Hybrid approach for solving multivariate systems over finite fields
From MaRDI portal
Publication:3400062
DOI10.1515/JMC.2009.009zbMath1183.94021MaRDI QIDQ3400062
Jean-Charles Faugère, Ludovic Perret, Luk Bettale
Publication date: 5 February 2010
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc.2009.009
68W30: Symbolic computation and algebraic computation
94A60: Cryptography
13F20: Polynomial rings and ideals; rings of integer-valued polynomials
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
A Structural Attack on Block-Anti-Circulant UOV at SAC 2019, Multivariate Encryption Schemes Based on Polynomial Equations over Real Numbers, Polynomial selection for computing Gröbner bases, Semi-Regular Sequences and Other Random Systems of Equations, A SAT-Based Approach for Index Calculus on Binary Elliptic Curves, Superspecial Trigonal Curves of Genus 5, Polynomial selection of <i>F</i><sub>4</sub> for solving the MQ problem, A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV, A multivariate identity-based broadcast encryption with applications to the Internet of Things, Efficient search for superspecial hyperelliptic curves of genus four with automorphism group containing \(\mathbf{C}_6\), An algorithm for solving over-determined multivariate quadratic systems over finite fields, A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions, Development of hybrid approach for solving MQ problem: Intermediate hybrid approach, A technique to reduce memory usage of M4GB algorithm, Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation, On the complexity of solving generic overdetermined bilinear systems, A new fault attack on UOV multivariate signature scheme, Efficient IBS from a new assumption in the multivariate-quadratic setting, Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic, A multivariate based threshold ring signature scheme, Using symmetries in the index calculus for elliptic curves discrete logarithm, Stream/block ciphers, difference equations and algebraic attacks, Elliptic curve discrete logarithm problem over small degree extension fields, Cryptanalysis of the extension field cancellation cryptosystem, Sigma protocols for MQ, PKP and SIS, and fishy signature schemes, The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes, Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2, Analysis of multivariate encryption schemes: application to Dob, Practical complexities of probabilistic algorithms for solving Boolean polynomial systems, A study on randomness used in signature generation of UOV, An algebraic attack to the Bluetooth stream cipher \textsc{E0}, Cryptanalysis of the lifted unbalanced oil vinegar signature scheme, Logical cryptanalysis with WDSat, Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem, An algebraic approach to the rank support learning problem, On a generalization of substitution-permutation networks: the HADES design strategy, \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption, On the efficiency of solving Boolean polynomial systems with the characteristic set method, A new encryption scheme for multivariate quadratic systems, Superspecial curves of genus 4 in small characteristic, Cryptanalysis of RGB, a mixed multivariate signature scheme, Efficient public-key operation in multivariate schemes, Consensus networks over finite fields, New complexity estimation on the rainbow-band-separation attack, On the computation of rational solutions of underdetermined systems over a finite field, Improvements of algebraic attacks for solving the rank decoding and MinRank problems, Cryptanalysis of \textsf{LRainbow}: the lifted rainbow signature scheme, A Multivariate Encryption Scheme with Rainbow, Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two, From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures, A Variant of the F4 Algorithm
Uses Software
Cites Work
