Advances in Cryptology - CRYPTO 2003

DOI10.1007/b11817zbMath1122.94371OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428110

Publication date: 28 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11817

Mathematics Subject Classification ID

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

Related Items (76)

An improvement for GVW ⋮ Stronger bounds on the cost of computing Gröbner bases for HFE systems ⋮ Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme ⋮ Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption ⋮ Practical Cryptanalysis of k-ary $$C^*$$ ⋮ A Rank Attack Against Extension Field Cancellation ⋮ Polly cracker, revisited ⋮ Public key cryptography based on ergodic matrices over finite field ⋮ Boolean ring cryptographic equation solving ⋮ A new framework for computing Gröbner bases ⋮ Compact representation of polynomials for algorithms for computing Gröbner and involutive bases ⋮ Involutive method for computing Gröbner bases over $\mathbb F_2$ ⋮ Role of involutive criteria in computing Boolean Gröbner bases ⋮ On the security of biquadratic $C^\ast$ public-key cryptosystems and its generalizations ⋮ Inverting square systems algebraically is exponential ⋮ MI-T-HFE, A New Multivariate Signature Scheme ⋮ On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra ⋮ The Hunt for Weighing Matrices of Small Orders ⋮ Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic ⋮ Key-recovery attacks on $\mathsf{ASASA}$ ⋮ Enhanced matrix power function for cryptographic primitive construction ⋮ Efficient public-key operation in multivariate schemes ⋮ An algorithm for solving over-determined multivariate quadratic systems over finite fields ⋮ First fall degree and Weil descent ⋮ Quasi-subfield polynomials and the elliptic curve discrete logarithm problem ⋮ On the last fall degree of zero-dimensional Weil descent systems ⋮ Cryptanalysis of the TRMS Signature Scheme of PKC’05 ⋮ Characteristic set algorithms for equation solving in finite fields ⋮ On the relation between the MXL family of algorithms and Gröbner basis algorithms ⋮ Obtaining and solving systems of equations in key variables only for the small variants of AES ⋮ Axioms for a theory of signature bases ⋮ Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case ⋮ Chordal graphs in triangular decomposition in top-down style ⋮ The degree of regularity of a quadratic polynomial ⋮ Lattice polly cracker cryptosystems ⋮ Boolean Gröbner bases ⋮ Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ A survey on signature-based algorithms for computing Gröbner bases ⋮ Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals ⋮ On computation of Boolean involutive bases ⋮ On extended algebraic immunity ⋮ Computation of involutive and Gröbner bases using the tableau representation of polynomials ⋮ Square-Vinegar Signature Scheme ⋮ Nonlinear Piece In Hand Perturbation Vector Method for Enhancing Security of Multivariate Public Key Cryptosystems ⋮ Analysis of Multivariate Hash Functions ⋮ Espresso: a stream cipher for 5G wireless communication systems ⋮ Total break of the SRP encryption scheme ⋮ An improvement over the GVW algorithm for inhomogeneous polynomial systems ⋮ Complexity of Gröbner basis detection and border basis detection ⋮ BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases ⋮ On the first fall degree of summation polynomials ⋮ Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects ⋮ Kipnis-Shamir Attack on HFE Revisited ⋮ A comparison of unrestricted dynamic Gröbner basis algorithms ⋮ A dynamic F4 algorithm to compute Gröbner bases ⋮ Algebraic Cryptanalysis of the Data Encryption Standard ⋮ On the last fall degree of Weil descent polynomial systems ⋮ Cryptanalysis of the extension field cancellation cryptosystem ⋮ A Variant of the F4 Algorithm ⋮ Square, a New Multivariate Encryption Scheme ⋮ Recent Developments in Multivariate Public Key Cryptosystems ⋮ Cryptanalytic applications of the polynomial method for solving multivariate equation systems over $\mathrm{GF}(2)$ ⋮ A public key cryptosystem using a group of permutation polynomials ⋮ Analysis of multivariate encryption schemes: application to Dob ⋮ Polybori: A framework for Gröbner-basis computations with Boolean polynomials ⋮ On enumeration of polynomial equivalence classes and their application to MPKC ⋮ General Fault Attacks on Multivariate Public Key Cryptosystems ⋮ On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack ⋮ Security analysis via algebraic attack against ``a new encryption scheme for multivariate quadratic system ⋮ Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures ⋮ Chosen ciphertext attack on ZHFE ⋮ A new signature-based algorithms for computing Gröbner bases ⋮ On the complexity of the $F_5$ Gröbner basis algorithm ⋮ A new post-quantum multivariate polynomial public key encapsulation algorithm ⋮ On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography

Uses Software

FGb

This page was built for publication: Advances in Cryptology - CRYPTO 2003