Online citations, reference lists, and bibliographies.
← Back to Search

Elliptic Curve Cryptosystems

N. Koblitz
Published 1987 · Mathematics

Cite This
Download PDF
Analyze on Scholarcy
Share
We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over GF(2'). We discuss the question of primitive points on an elliptic curve modulo p, and give a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point.
This paper references
J
S. Lan (1965)
10.1109/TIT.1985.1057074
A public key cryptosystem and a signature scheme based on discrete logarithms
Taher El Gamal (1985)
10.1016/0022-314X(83)90039-2
On Artin's conjecture
M. R. Murty (1983)
Zur Theorie der abstrakten elliptischen Funktionenkörper Journal für reine u. angewandte Math
H Hasse (1936)
10.1007/3-540-39757-4_20
Discrete Logarithms in Finite Fields and Their Cryptographic Significance
A. Odlyzko (1984)
10.2307/3615455
An introduction to algebraic structures
F. Budden (1976)
10.1109/TIT.1976.1055638
New directions in cryptography
W. Diffie (1976)
Beweis des Analogons der Riemannschen Vermutung für die Artinschen u. F. K. Schmidtschen Kongruenzzetafunktionen in gewissen elliptischen Fällen
H Hasse (1933)
10.1016/0166-218x(90)90038-e
A Course in Number Theory and Cryptography
N. Koblitz (1987)
10.2307/2312370
Solved and Unsolved Problems in Number Theory
D. Shanks (1962)
M
R. Gupt (1986)
Zur Theorie der abstrakten elliptischen Funktionenkörper
H. Hasse (1936)
personal correspondence and unpublished tables, October 29,1985
H. Trotter (1985)
Discrete logarithms and their cryptographic significance Advances in Cryptology
A M Odlyzko (1985)
10.1007/3-540-39799-X_31
Use of Elliptic Curves in Cryptography
V. S. Miller (1985)
10.1109/TIT.1985.1057074
A public key cryptosystem and a signature scheme based on discrete logarithms
T. Elgamal (1985)
10.1515/9783111548050-024
M
M. Sankar (1824)
10.1090/S0025-5718-1987-0866113-7
Speeding the Pollard and elliptic curve methods of factorization
P. Montgomery (1987)
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
Beweis des Analogons der Riemannschen Vermutung für die Artinschen und F. K. Schmidtschen Kongruenzzetafunktionen in gewissen elliptischen Fällen. Vorläufie Mitteilung
H. Hasse (1933)
Elliptic Curves: Diophantine Analysis
S. Lang (1978)
10.2307/2314675
The collected papers of Emil Artin
F. Linton (1966)
10.1016/0166-218X(88)90090-X
Optimal normal bases in GF(pn)
R. Mullin (1989)
10.1515/9783111576855-015
J
Seguin Hen (1824)
Primitive points on elliptic curves
R. Gupta (1986)
10.2307/1971363
Factoring integers with elliptic curves
H. W. Lenstra (1986)
Internat. Zurich Seminar
(1984)
10.1090/S0025-5718-1985-0777280-6
Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
R. Schoof (1985)
10.2307/3620096
Introduction to Elliptic Curves and Modular Forms
N. Koblitz (1984)
10.1007/3-540-39568-7_2
A public key cryptosystem and a signature scheme based on discrete logarithms
T. Elgamal (1984)
Realization and Application of the Massey-Omura Lock
P.K.S. Wah (1984)
10.1017/CBO9781139172769
Introduction to finite fields and their applications: List of Symbols
R. Lidl (1986)



This paper is referenced by
A Small and Fast Software Implementation of Elliptic Curve Cryptosystems over GF(p) on a 16-Bit Microcomputer (Special Section on Cryptography and Information Security)
T. Hasegawa (1999)
10.1109/ISCAS.2009.5118024
Modular reduction without precomputational phase
M. Knezevic (2009)
10.1109/ISWPC.2008.4556244
Reed-Solomon codes and multi-path strategies to improve privacy performance over ad hoc networks
Hervé Aïache (2008)
10.1109/ICETET.2008.126
A Novel Protocol for Smart Card Using ECDLP
D. Jena (2008)
10.1007/978-3-540-79966-5_10
On the BRIP Algorithms Security for RSA
F. Amiel (2008)
10.1109/CCCM.2009.5267791
A security framework for wireless network based on public key infrastructure
Wuzheng Tan (2009)
10.1007/3-540-36555-9_23
A WTLS Handshake Protocol with User Anonymity and Forward Secrecy
Dong Jin Kwak (2002)
10.1007/978-3-540-45203-4_28
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Sangwon Lee (2003)
10.1007/3-540-36492-7_2
Integer Decomposition for Fast Scalar Multiplication on Elliptic Curves
Dongryeol Kim (2002)
10.1007/s102070100002
The Elliptic Curve Digital Signature Algorithm (ECDSA)
D. Johnson (2001)
10.1007/3-540-45439-X_16
Elliptic Curve Arithmetic Using SIMD
K. Aoki (2001)
Courbes Elliptiques et cryptographie
R. Lercier (2004)
10.1007/978-3-540-30117-2_60
Reconfigurable Instruction Set Extension for Enabling ECC on an 8-Bit Processor
S. Kumar (2004)
10.1007/3-540-36400-5_26
An End-to-End Systems Approach to Elliptic Curve Cryptography
N. Gura (2002)
10.1145/1059524.1059542
Elliptic curve cryptography: Java implementation
K. Edoh (2004)
10.1016/j.pmcj.2019.101105
Energy-aware dynamic Internet of Things security system based on Elliptic Curve Cryptography and Message Queue Telemetry Transport protocol for mitigating Replay attacks
F. Rango (2020)
10.1016/j.eswa.2011.02.039
An agent-based English auction protocol using Elliptic Curve Cryptosystem for mobile commerce
Yu-Fang Chung (2011)
10.1016/j.ffa.2003.12.001
Complete weight enumerators of generalized doubly-even self-dual codes
G. Nebe (2004)
Performance Evaluation of ECC in Single and Multi Processor Architectures on FPGA Based Embedded System
Sruti Agarwal (2014)
10.1109/ITSC.2013.6728531
Securing number plates based on digital signatures and RFID
A. J. Hoffman (2013)
SCA-Resistant and High-Performance Embedded Cryptography Using Instruction Set Extensions and Multi-Core Processors
Zhimin Chen (2011)
10.3844/JCSSP.2010.1237.1246
A Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields
H. Modares (2010)
Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials
Duggirala Meher Krishna (2016)
APPLICATIONS OF PROBABILITY: BENFORD’S LAW AND HYPOTHESIS TESTING FROM AN INVITATION TO MODERN NUMBER THEORY
S. J. Miller (2008)
Eliptičke krivulje u kriptografiji
D. Sejdinovic (2007)
Secure Convertible Authenticated Encryption Scheme Based on RSA
Tzong-Sun Wu (2009)
10.7508/IJMSI.2009.02.006
Generalized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Hassan Daghigh (2009)
Biometric DNA and ECDLP-based Personal Authentication System: A Superior Posse of Security
Ranbir Soram (2010)
10.4028/www.scientific.net/AMM.20-23.277
On Inversion Algorithms over Optimal Extension Fields Using Lagrange Representation
Ming Long Qi (2010)
10.1007/978-3-642-22540-6_31
Novel Methods for Montgomery Modular Multiplication for Public Key Cryptosystems
V. R. Venkatasubramani (2011)
A New Efficient Asymmetric Cryptosystem Based on the Square Root Problem
Muhammad Rezal Kamel Ariffin (2012)
10.14569/IJACSA.2012.031023
Secured Wireless Communication using Fuzzy Logic based High Speed Public-Key Cryptography (FLHSPKC)
Arindam Sarkar (2012)
See more
Semantic Scholar Logo Some data provided by SemanticScholar