An attack on a signature scheme proposed by Okamoto and Shiraishi
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
On using RSA with low exponent in a public key network
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A course in number theory and cryptography
A course in number theory and cryptography
A pseudo-random bit generator based on elliptic logarithms
Proceedings on Advances in cryptology---CRYPTO '86
How to break Okamoto's cryptosystem by reducing lattice bases
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Which new RSA signatures can be computed from some given RSA signatures? (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Constructing Elliptic Curve Cryptosystems in Characteristic 2
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
ESIGN: an efficient digital signature implementation for smart cards
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Counting the number of points on elliptic curves over finite fields: strategies and performances
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Fair blind signatures revisited
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
We propose a practical digital signature scheme based on the elliptic curve modulo n, where n = p2g such that p and q are large secret primes. The signature generation speed of our scheme is more than 10 times faster than that of the RSA scheme. Moreover, a pre-processing technique can significantly increase the signature generation speed.