Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption
verfasst von : Mathias Herrmann
Erschienen in: Progress in Cryptology – AFRICACRYPT 2011
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.