Improved Attacks for Characteristic-2 Parameters of the Cubic ABC Simple Matrix Encryption Scheme

  title={Improved Attacks for Characteristic-2 Parameters of the Cubic ABC Simple Matrix Encryption Scheme},
  author={Dustin Moody and Ray A. Perlner and Daniel Smith-Tone},
  journal={IACR Cryptol. ePrint Arch.},
In the last few years multivariate public key cryptography has experienced an infusion of new ideas for encryption. Among these new strategies is the ABC Simple Matrix family of encryption schemes which utilize the structure of a large matrix algebra to construct effectively invertible systems of nonlinear equations hidden by an isomorphism of polynomials. One promising approach to cryptanalyzing these schemes has been structural cryptanalysis, based on applying a strategy similar to MinRank… 
A multivariate cryptosystem inspired by random linear codes
Recent Developments in Multivariate Public Key Cryptosystems
  • Yasufumi Hashimoto
  • Computer Science, Mathematics
    International Symposium on Mathematics, Quantum Theory, and Cryptography
  • 2020
This paper summarizes multivariate schemes UOV, Rainbow, and (variants of) HFE generating the second round candidates and study the practicalities of several multivariate encryption schemes proposed recently.
Rank Analysis of Cubic Multivariate Cryptosystems
This work details how to extend the big field idea from quadratic to cubic, and shows that the same rank defect occurs, and extends the min-rank problem and proposes an algorithm to solve it in this setting.
HFERP - A New Multivariate Encryption Scheme
In 2016, Yasuda et al. presented a new multivariate encryption technique based on the Square and Rainbow primitives and utilizing the plus modifier that they called SRP, but it proved to be too aggressive and was completely broken by Perlner etal.
All in the C* family
This work revisits the roots of multivariate cryptography, investigating the viability of schemes, in general, under the entire multidimensional array of the principal modifiers and reveals that there is a nontrivial space of combinations of modifiers that produce viable schemes resistant to all known attacks.
A Rank Attack Against Extension Field Cancellation
A rigorous security analysis is developed and it is shown that none of the proposed variants of Extension Field Cancellation archive the claimed security levels.
EFLASH: A New Multivariate Encryption Scheme
This paper proposes a new encryption scheme, EFLASH, and analyzes its efficiency and security.
The complexity of MinRank
In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined
Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme
The designers later published updated parameters, replacing the square matrices with rectangular matrices and altering other parameters to avoid the cryptanalysis of the original scheme presented in 2014 by Moody et al.


Key Recovery Attack on the Cubic ABC Simple Matrix Multivariate Encryption Scheme
The cubic version of the ABC Simple Matrix Encryption was developed with provable security in mind and was published including a heuristic security argument claiming that an attack on the scheme should be at least as difficult as solving a random system of quadratic equations over a finite field.
Simple Matrix Scheme for Encryption
A new simple and efficient multivariate pubic key encryption scheme based on matrix multiplication, which does not have such a low rank property and will be called Simple Matrix Scheme or ABC in short.
An Asymptotically Optimal Structural Attack on the ABC Multivariate Encryption Scheme
This work presents an attack based on subspace differential invariants inherent to this methodology, a structural key recovery attack which is asymptotically optimal among all known attacks on the original scheme and its generalizations.
The Cubic Simple Matrix Encryption Scheme
An improved version of the Simple Matrix encryption scheme of PQCrypto2013, using square matrices with random quadratic polynomials to build a system with even stronger security claims, which can claim that breaking the system using algebraic attacks is at least as hard as solving a set of random Quadratic equations.
ZHFE, a New Multivariate Public Key Encryption Scheme
It is shown that ZHFE is relatively efficient and that it is secure against the main attacks that have threatened the security of HFE.
Extension Field Cancellation: A New Central Trapdoor for Multivariate Quadratic Systems
This paper introduces a new central trapdoor for multivariate quadratic MQ public-key cryptosystems that allows for encryption, in contrast to time-tested MQ primitives such as Unbalanced Oil and
Cryptanalysis of the TTM Cryptosystem
This paper studies a more general family of TPM schemes: a triangular construction mixed with some u random polynomials and with some r of the beginning equations removed, and introduces a new attack for MinRank called 'Kernel Attack' that works for qr small.
Security Analysis and Key Modification for ZHFE
This article proves security against differential adversaries, complementing a more accurate and robust discussion of resistance to rank and algebraic attacks, and suggests a modification of ZHFE, a multivariate encryption scheme which retains the security and performance properties of ZhFE while optimizing key size in this theoretical framework.
Post-Quantum Cryptography
  • M. Mosca
  • Computer Science, Mathematics
    Lecture Notes in Computer Science
  • 2014
A set of strong NTRUSign parameters are obtained by taking into account latest known attacks against the scheme, a statistical way to hide the leaky NTRU signature so that this particular instantiation of CVP-based signature scheme becomes zero-knowledge and secure against forgeries, based on the worst-case hardness of the Õ(N)-Shortest Independent Vector Problem over NTR U lattices.
C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai
This paper studies some very simple variations of C• - such as C• +• - where the attack of [8] is avoided, and where the very simple secret key computations are kept, and designs some new cryptanalysis that are efficient against some of - but not all - these variations.