A simple noncommutative UOV scheme
From MaRDI portal
Cites work
- A new algorithm for the unbalanced meet-in-the-middle problem
- A new efficient algorithm for computing Gröbner bases (F₄)
- An algorithm for solving over-determined multivariate quadratic systems over finite fields
- An improvement of algorithms to solve under-defined systems of multivariate quadratic equations
- Cryptanalysis of the SNOVA signature scheme
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Hybrid approach for solving multivariate systems over finite fields
- Improved attacks for SNOVA by exploiting stability under a group action
- Improved cryptanalysis of SNOVA
- Improved cryptanalysis of UOV and Rainbow
- Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
- Multivariate Public Key Cryptography
- On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public Key Cryptography - PKC 2005
- Rainbow, a New Multivariable Polynomial Signature Scheme
- Small public keys and fast verification for Multivariate Quadratic public key systems
- Solving quadratic equations with XL on parallel architectures
- Solving underdetermined systems of multivariate quadratic equations revisited
- Unbalanced Oil and Vinegar Signature Schemes
This page was built for publication: A simple noncommutative UOV scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262903)
