Abstract
Recently, Geraud-Stewart and Naccache proposed two trapdoors based on matrix products. In this paper, we answer the call for cryptanalysis. We explore how using the trace and determinant of a matrix can be used to attack their constructions. We fully break their first construction in a polynomial-time attack. We show an information leak in the second construction using characteristic polynomials, and provide two attacks that decrease the bit security by about half.
Funding Information
  • Fund for Scientific Research
  • Engineering and Physical Sciences Research Council (EP/V011324/1)

This publication has 6 references indexed in Scilit: