Pages that link to "Item:Q5428110"
From MaRDI portal
The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428110):
Displaying 50 items.
- Polly cracker, revisited (Q285245) (← links)
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra (Q328226) (← links)
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
- First fall degree and Weil descent (Q405966) (← links)
- Characteristic set algorithms for equation solving in finite fields (Q413410) (← links)
- On the relation between the MXL family of algorithms and Gröbner basis algorithms (Q414624) (← links)
- Espresso: a stream cipher for 5G wireless communication systems (Q505077) (← links)
- An improvement over the GVW algorithm for inhomogeneous polynomial systems (Q530403) (← links)
- Obtaining and solving systems of equations in key variables only for the small variants of AES (Q626949) (← links)
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689) (← links)
- Lattice polly cracker cryptosystems (Q633081) (← links)
- Boolean Gröbner bases (Q633095) (← links)
- On enumeration of polynomial equivalence classes and their application to MPKC (Q765801) (← links)
- Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures (Q780363) (← links)
- Stronger bounds on the cost of computing Gröbner bases for HFE systems (Q820971) (← links)
- Boolean ring cryptographic equation solving (Q832346) (← links)
- Involutive method for computing Gröbner bases over \(\mathbb F_2\) (Q840027) (← links)
- Role of involutive criteria in computing Boolean Gröbner bases (Q840090) (← links)
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
- On the last fall degree of zero-dimensional Weil descent systems (Q1690789) (← links)
- A survey on signature-based algorithms for computing Gröbner bases (Q1711995) (← links)
- Total break of the SRP encryption scheme (Q1746981) (← links)
- Complexity of Gröbner basis detection and border basis detection (Q1758159) (← links)
- BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases (Q1758701) (← links)
- The degree of regularity of a quadratic polynomial (Q1946161) (← links)
- Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals (Q1956953) (← links)
- On computation of Boolean involutive bases (Q1956959) (← links)
- On extended algebraic immunity (Q1960218) (← links)
- On the first fall degree of summation polynomials (Q2009417) (← links)
- A comparison of unrestricted dynamic Gröbner basis algorithms (Q2025445) (← links)
- A dynamic F4 algorithm to compute Gröbner bases (Q2025446) (← links)
- On the last fall degree of Weil descent polynomial systems (Q2031632) (← links)
- Cryptanalysis of the extension field cancellation cryptosystem (Q2034996) (← links)
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\) (Q2056692) (← links)
- A public key cryptosystem using a group of permutation polynomials (Q2057316) (← links)
- Analysis of multivariate encryption schemes: application to Dob (Q2061916) (← links)
- Security analysis via algebraic attack against ``a new encryption scheme for multivariate quadratic system'' (Q2079887) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- An improvement for GVW (Q2121217) (← links)
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem (Q2191201) (← links)
- Chordal graphs in triangular decomposition in top-down style (Q2200301) (← links)
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases (Q2204858) (← links)
- On the efficiency of solving Boolean polynomial systems with the characteristic set method (Q2211189) (← links)
- Computation of involutive and Gröbner bases using the tableau representation of polynomials (Q2217202) (← links)
- A new signature-based algorithms for computing Gröbner bases (Q2341616) (← links)
- On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
- Key-recovery attacks on \(\mathsf{ASASA}\) (Q2413617) (← links)
- Enhanced matrix power function for cryptographic primitive construction (Q2415047) (← links)
- Efficient public-key operation in multivariate schemes (Q2415397) (← links)
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases (Q2629402) (← links)
