Low Exponent Attacks against the Schwenk-Eisfeld Cryptoscheme and Signature

Tsuyoshi TAKAGI  Shozo NAITO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E81-A   No.3   pp.483-488
Publication Date: 1998/03/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Information Security
Schwenk-Eisfeld cryptosystem,  RSA cryptosystem,  polynomial,  factoring,  low exponent attack,  

Full Text: PDF(557.6KB)>>
Buy this Article

We show that under some conditions an attacker can break the public-key cryptosystem proposed by J. Schwenk and J. Eisfeld at Eurocrypt '96 which is based on the difficulty of factoring over the ring Z/nZ [x], even though its security is as intractable as the difficulty of factoring a rational integer. We apply attacks previously reported against RSA-type cryptosystems with a low exponent to the Schwenk-Eisfeld cryptosystem and show a method of breaking the Schwenk-Eisfeld signature with a low exponent.