Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 483-488 |
Number of pages | 6 |
Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
Volume | E81-A |
Issue number | 3 |
Publication status | Published - 1998 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Signal Processing
- Applied Mathematics
- Electrical and Electronic Engineering
- Computer Graphics and Computer-Aided Design