Improvement of Algebraic Attacks for Solving Superdetermined MinRank Instances
- 21 September 2022
- book chapter
- Published by Springer Nature
- p. 107-123
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- An Efficient Structural Attack on NIST Submission DAGS2018
- Design Principles for HFEv- Based Multivariate Signature Schemes2015
- ZHFE, a New Multivariate Public Key Encryption Scheme2014
- On the complexity of the generalized MinRank problemJournal of Symbolic Computation, 2013
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree : Algorithms and complexityJournal of Symbolic Computation, 2011
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology2010
- Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization1999
- The Computational Complexity of Some Problems of Linear AlgebraJournal of Computer and System Sciences, 1999
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms1996
- Determinantal Rings1988