94views more  JOC 2000»
13 years 5 months ago
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
We present a new cryptosystem based on ideal arithmetic in quadratic orders. The method of our trapdoor is different from the Diffie
Sachar Paulus, Tsuyoshi Takagi
125views more  JOC 2007»
13 years 5 months ago
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
Jean-Sébastien Coron, Alexander May
134views more  INFORMATICALT 2006»
13 years 5 months ago
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Je...
106views more  IJNSEC 2008»
13 years 5 months ago
Comments on the Security Flaw of Hwang et al.'s Blind Signature Scheme
In 2003, Hwang et al. proposed a new blind signature based on the RSA cryptosystem by employing Extended Euclidean algorithm. They claimed that the proposed scheme was untraceable...
Fang-Ping Chiang, Yi-Mien Lin, Ya-Fen Chang
13 years 9 months ago
Moduli for Testing Implementations of the RSA Cryptosystem
Comprehensive testing of any implementation of the RSA cryptosystem requires the use of a number of moduli with specific properties. It is shown how to generate a sufficient varie...
Colin D. Walter
142views Algorithms» more  SYNASC 2007»
13 years 11 months ago
An Extension of the RSA Trapdoor in a KEM/DEM Framework
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
Bogdan Groza