Rank Analysis of Cubic Multivariate Cryptosystems

@inproceedings{Baena2018RankAO,
  title={Rank Analysis of Cubic Multivariate Cryptosystems},
  author={John Baena and Daniel Cabarcas and Daniel E. Escudero and Karan Khathuria and Javier A. Verbel},
  booktitle={IACR Cryptology ePrint Archive},
  year={2018}
}
In this work we analyze the security of cubic cryptographic constructions with respect to rank weakness. We detail how to extend the big field idea from quadratic to cubic, and show that the same rank defect occurs. We extend the min-rank problem and propose an algorithm to solve it in this setting. We show that for fixed small rank, the complexity is even lower than for the quadratic case. However, the rank of a cubic polynomial in n variables can be larger than n, and in this case the… CONTINUE READING
BETA

Citations

Publications citing this paper.

On the security of biquadratic C ∗ public-key cryptosystems and its generalizations

  • Cryptography and Communications
  • 2018
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES

First fall degree and Weil descent

  • Finite Fields and Their Applications
  • 2014
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Hillar and Lek - Heng Lim . Most Tensor Problems are NP - Hard

J Christopher
  • Multivariate Public Key Cryptosystems , pages 17 – 42
  • 2018

Similar Papers

Loading similar papers…