Abstract
In this paper we investigate the Multi-Prime φ-Hiding Problem as introduced in a recent construction by Kiltz et al. from Crypto 2010. We are able to improve upon previous cryptanalytic results by making use of the special structure of the polynomial that is derived from the problem instance. Our attack is based on the method of Coppersmith for finding small solutions of modular equations. In particular, we make use of a recent result from Herrmann and May to solve linear equations modulo divisors. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Herrmann, M. (2011). Improved cryptanalysis of the multi-prime φ-hiding assumption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6737 LNCS, pp. 92–99). https://doi.org/10.1007/978-3-642-21969-6_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
