On the Hardness of the Mersenne Low Hamming Ratio Assumption

@article{Beunardeau2017OnTH,
  title={On the Hardness of the Mersenne Low Hamming Ratio Assumption},
  author={Marc Beunardeau and Aisling Connolly and R{\'e}mi G{\'e}raud and David Naccache},
  journal={IACR Cryptology ePrint Archive},
  year={2017},
  volume={2017},
  pages={522}
}
In a recent paper [AJPS17], Aggarwal, Joux, Prakash, and Santha (AJPS) describe an ingenious public-key cryptosystem mimicking NTRU over the integers. This algorithm relies on the properties of Mersenne primes instead of polynomial rings. The security of the AJPS cryptosystem relies on the conjectured hardness of the Mersenne Low Hamming Ratio Assumption, defined in [AJPS17]. This work shows that AJPS’ security estimates are too optimistic and describes an algorithm allowing to recover the… CONTINUE READING
6 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Constructive combinatorics

  • SW12. Dennis Stanton, Dennis White
  • Springer Science & Business Media,
  • 2012

Algorithmic cryptanalysis

  • Jou09. Antoine Joux
  • CRC Press,
  • 2009

Similar Papers

Loading similar papers…