A subexponential algorithm for the discrete logarithm problem with applications to cryptography
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
On the implementation of elliptic curve cryptosystems
CRYPTO '89 Proceedings on Advances in cryptology
Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Crossroads
The Xedni Calculus and the Elliptic Curve Discrete LogarithmProblem
Designs, Codes and Cryptography
Analysis of the Xedni Calculus Attack
Designs, Codes and Cryptography
Constructing Elliptic Curve Cryptosystems in Characteristic 2
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure hybrid robust watermarking resistant against tampering and copy attack
Signal Processing - Special section: Security of data hiding technologies
An FPGA implementation of an elliptic curve processor GF(2m)
Proceedings of the 14th ACM Great Lakes symposium on VLSI
FPGA based hardware acceleration for elliptic curve public key cryptosystems
Journal of Systems and Software - Special issue: Rapid system prototyping
The generalized Weil pairing and the discrete logarithm problem on elliptic curves
Theoretical Computer Science - Latin American theorotical informatics
Elliptic curve cryptography: Java implementation
Proceedings of the 1st annual conference on Information security curriculum development
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Designs, Codes and Cryptography
A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods
IEEE Transactions on Computers
Design of a scalable RSA and ECC crypto-processor
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Secure distributed constraint satisfaction: reaching agreement without revealing private information
Artificial Intelligence - Special issue: Distributed constraint satisfaction
A-Codes from Rational Functions over Galois Rings
Designs, Codes and Cryptography
Refinements of Miller's algorithm for computing the Weil/Tate pairing
Journal of Algorithms
A distributed multi-party key agreement protocol for dynamic collaborative groups using ECC
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Journal of Systems and Software
FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field
Journal of Systems Architecture: the EUROMICRO Journal
On parallelization of high-speed processors for elliptic curve cryptography
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Finding good random elliptic curves for cryptosystems defined over IF2n
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Building cyclic elliptic curves modulo large primes
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
On the development of a fast elliptic curve cryptosystem
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
NanoECC: testing the limits of elliptic curve cryptography in sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Toward development of high secure sensor network nodes using an FPGA-based architecture
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Novel approach design of elliptic curve cryptography implementation in VLSI
ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
Certificateless authenticated group key agreement protocol for unbalanced wireless mobile networks
WSEAS TRANSACTIONS on COMMUNICATIONS
FPGA based implementation of parallel ECC processor
Proceedings of the 2011 International Conference on Communication, Computing & Security
A novel simple secure internet voting protocol
Proceedings of the 2011 International Conference on Communication, Computing & Security
Designs, Codes and Cryptography
A novel and efficient cryptosystem for large message encryption
International Journal of Information and Communication Technology
On batch verification with group testing for vehicular communications
Wireless Networks
Efficient software implementations of large finite fields GF(2n) for secure storage applications
ACM Transactions on Storage (TOS)
A general methodology for pipelining the point multiplication operation in curve based cryptography
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Efficient HMAC-based secure communication for VANETs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Differential properties of elliptic curves and blind signatures
ISC'07 Proceedings of the 10th international conference on Information Security
GHAP: An Efficient Group-based Handover Authentication Mechanism for IEEE 802.16m Networks
Wireless Personal Communications: An International Journal
International Journal of Information and Communication Technology
| Hi-index | 0.00 |
We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% faster than the Diffie-Hellmann scheme over GF(p). As computational power grows, this disparity should get rapidly bigger.