Solving polynomial systems over finite fields
From MaRDI portal
Publication:5244518
DOI10.1145/2442829.2442843zbMath1323.68583OpenAlexW1974527567MaRDI QIDQ5244518
Ludovic Perret, Luk Bettale, Jean-Charles Faugère
Publication date: 27 March 2015
Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2442829.2442843
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (11)
Solving polynomial systems in integers ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ Key recovery attack on Hufu-UOV ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Efficient public-key operation in multivariate schemes ⋮ From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ An improvement of algorithms to solve under-defined systems of multivariate quadratic equations ⋮ On the complexity of solving generic overdetermined bilinear systems ⋮ Recent Developments in Multivariate Public Key Cryptosystems ⋮ High-rank attack on HMFEv ⋮ Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
Uses Software
This page was built for publication: Solving polynomial systems over finite fields
