Welcome to the resource topic for 2016/155
Title:
Cryptanalysis of Multi-Prime \Phi-Hiding Assumption
Authors: Jun Xu, Lei Hu, Santanu Sarkar, Xiaona Zhang, Zhangjie Huang, Liqiang Peng
Abstract:In Crypto 2010, Kiltz, O’Neill and Smith used m-prime RSA modulus N with m\geq 3 for constructing lossy RSA. The security of the proposal is based on the Multi-Prime \Phi-Hiding Assumption. In this paper, we propose a heuristic algorithm based on the Herrmann-May lattice method (Asiacrypt 2008) to solve the Multi-Prime \Phi-Hiding Problem when prime e>N^{\frac{2}{3m}}. Further, by combining with mixed lattice techniques, we give an improved heuristic algorithm to solve this problem when prime e>N^{\frac{2}{3m}-\frac{1}{4m^2}}. These two results are verified by our experiments. Our bounds are better than the existing works.
ePrint: https://eprint.iacr.org/2016/155
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .