Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Use of elliptic curves in cryptography
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
Optimal normal bases in GF(pn)
Discrete Applied Mathematics
Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Parallel algorithms for integer factorisation
Number theory and cryptography
Computation of discrete logarithms in prime fields
Designs, Codes and Cryptography
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Constructing Elliptic Curve Cryptosystems in Characteristic 2
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Elliptic Curve Public-Key Cryptosystems - An Introduction
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Fast Key Exchange with Elliptic Curve Systems
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Efficient software implementations of large finite fields GF(2n) for secure storage applications
ACM Transactions on Storage (TOS)
HSEP design using f2m HECC and threeb symmetric key under e-commerce environment
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
HSEP design using f2m HECC and threeb symmetric key under e-commerce environment
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
HSEP design using f2m HECC and threeb symmetric key under e-commerce environment
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
A MEP (mobile electronic payment) and IntCA protocol design
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Rings of Low Multiplicative Complexity
Finite Fields and Their Applications
| Hi-index | 0.00 |
In some applications of public-key cryptography it is desirable, and perhaps even necessary, that the key size be as small as possible. Moreover, the cryptosystem just needs to be secure enough so that breaking it is not cost-effective. The purpose of this paper is to hivestigate the security and practicality of elliptic curve cryptosystems with small key sizes of about 100 bits.