Elliptic curve cryptosystems

1987/01/01 by Neal Koblitz · 59 citations
Computer Science · #Cryptography and Residue Arithmetic #Cryptography and Data Security #Coding theory and cryptography

paper · pdf · doi:10.1090/s0025-5718-1987-0866109-5

Abstract

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 <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="GF left-parenthesis 2 Superscript n Baseline right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mtext>GF</mml:mtext> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\text GF(2ⁿ)</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. We discuss the question of primitive points on an elliptic curve modulo <italic>p</italic>, and give a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point.

Citations

• New directions in cryptography

Cited by

• CLAACS‐IOD: Certificate‐embedded lightweight authentication and access control scheme for Internet of Drones
• Eccfrog512ck2: An Enhanced 512-bit Weierstrass Elliptic Curve
• Multivariate Public Key Cryptography and Digital Signature
• McEliece Cryptosystem Based On Extended Golay Code
• Sharing in a Trustless World: Privacy-Preserving Data Analytics with\n Potentially Cheating Participants
• An Optimized Signature Verification System for Vehicle Ad hoc NETwork
• Performance Evaluation of ECC in Single and Multi Processor\n Architectures on FPGA Based Embedded System
• Quantum Encrypted Control of Networked Systems
• GeoGuard: UWB Timing-Encoded Key Reconstruction for Location-Dependent, Geographically Bounded Decryption
• Public Key Cryptography based on Semigroup Actions
• LSEG: A Lightweight and Secure Key Exchange Protocol for Smart Grid Communication
• LaMoS: Enabling Efficient Large Number Modular Multiplication through SRAM-based CiM Acceleration
• zkay v0.2: Practical Data Privacy for Smart Contracts
• Cryptanalysis of the CFVZ cryptosystem
• On rationality of the intersection points of a line with a plane quartic
• An Elementary Linear-Algebraic Proof without Computer-Aided Arguments for the Group Law on Elliptic Curves
• Faster Dual-Key Stealth Address for Blockchain-Based Internet of Things Systems
• Quantum-Resistant Networks Using Post-Quantum Cryptography
• Design and analysis of authenticated key agreement scheme in cloud-assisted cyber–physical systems
• Simultaneously Simple Universal and Indifferentiable Hashing to Elliptic Curves
• Group Operation on Nodal Curves
• Topic In Elliptic Curves Over Finite Fields: The Groups of Points
• Comprehensive Efficient Implementations of ECC on C54xx Family of\n Low-cost Digital Signal Processors
• A New Efficient Asymmetric Cryptosystem Based on the Square Root Problem
• Multi-channel secure communication framework for wireless IoT (MCSC-WoT): enhancing security in Internet of Things
• A Hybrid Encryption Framework Combining Classical, Post-Quantum, and QKD Methods
• Cryptographic Application of Elliptic Curve with High Rank
• Efficient QKD in Non-Ideal Scenarios with User-Defined Output Length Requirements
• ECCFROG522PP: An Enhanced 522-bit Weierstrass Elliptic Curve
• Point counting in families of hyperelliptic curves
• Optimizing Scalar Selection in Elliptic Curve Cryptography Using Differential Evolution for Enhanced Security
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• Memory efficient hyperelliptic curve point counting
• New Authentication Scheme for Wireless Body Area Networks Using the Bilinear Pairing
• TinyAKE: A More Practicable and Trustable Scheme for Authenticated Key Establishment in WSNs
• A Comparative Performance Evaluation of Kyber, sntrup761, and FrodoKEM for Post-Quantum Cryptography
• Performance and Storage Analysis of CRYSTALS Kyber as a Post Quantum Replacement for RSA and ECC
• Criptografia com Curvas Elípticas
• A Secure Multiple Elliptic Curves Digital Signature Algorithm for Blockchain
• Hidden shift problem for complex functions
• Edwards curve point counting method and supersingular Edwards and Montgomery curves
• The average exponent of elliptic curves modulo p
• Information Measure as Time Complexity
• On the average exponent of elliptic curves modulo p
• A Survey on Security and Privacy Protocols for Cognitive Wireless Sensor Networks
• Multivariate Cryptography with Mappings of Discrete Logarithms and Polynomials
• Halt Properties and Complexity Evaluations for Optimal DeepLLL Algorithm Families
• On the Number of Distinct Legendre, Jacobi and Hessian Curves
• Threshold Multi Secret Sharing Using Elliptic Curve and Pairing
• Pairing for Greenhorn: Survey and Future Perspective
• A p-adic Height Function Of Cryptanalytic Significance
• Integer Factorization: Another perspective
• Secure Quantum Relay Networks Using Distributed Entanglement without Classical Authentication
• Some Mathematical Problems Behind Lattice-Based Cryptography
• Point-groups over singular cubics
• Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem
• Security Features of an Asymmetric Cryptosystem based on the Diophantine Equation Hard Problem
• Speeding Up Elliptic Curve Multiplication with Mixed-base Representation for Applications to SIDH Ciphers
• An Efficient Hardware Implementation of Elliptic Curve Point Multiplication over GF(2^m) on FPGA

Related

• Topic In Elliptic Curves Over Finite Fields: The Groups of Points
• On the Discrete Logarithm Problem for elliptic curves over local fields
• Predicting the elliptic curve congruential generator
• Constructing elliptic curves in almost polynomial time
• Constructing elliptic curves of prime order