Evaluation of Solving Time for Multivariate Quadratic Equation System Using XL Algorithm Over Small Finite Fields on GPU
From MaRDI portal
Publication:3449432
DOI10.1007/978-81-322-2452-5_24zbMath1327.94076OpenAlexW2462578448MaRDI QIDQ3449432
Kouichi Sakurai, Chen-Mou Cheng, Satoshi Tanaka
Publication date: 4 November 2015
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-81-322-2452-5_24
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)
Uses Software
Cites Work
- Unnamed Item
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Analysis of QUAD
- Algebraic Cryptanalysis
- MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
- QUAD: A Practical Stream Cipher with Provable Security
- On the Number of Linearly Independent Equations Generated by XL
- Solving sparse linear equations over finite fields
- Unbalanced Oil and Vinegar Signature Schemes
- Solving Quadratic Equations with XL on Parallel Architectures
- Comparison Between XL and Gröbner Basis Algorithms
This page was built for publication: Evaluation of Solving Time for Multivariate Quadratic Equation System Using XL Algorithm Over Small Finite Fields on GPU
