95 relations: Abelian group, Algebraic structure, Algebraic variety, Algorithm, Andreas Antonopoulos, Baby-step giant-step, Barrett reduction, Bitwise operation, Bruce Schneier, Classified information in the United States, Computational hardness assumption, Counting points on elliptic curves, Cryptocurrency, Cryptographically secure pseudorandom number generator, Curve25519, Daniel J. Bernstein, Differential fault analysis, Diffie–Hellman key exchange, Digital signature, Digital Signature Algorithm, Discrete logarithm, Divisor (algebraic geometry), DNSCurve, Doubling-oriented Doche–Icart–Kohel curve, Dual EC DRBG, ECC patents, EdDSA, Edward Snowden, Edwards curve, Elliptic curve, Elliptic Curve Digital Signature Algorithm, Elliptic curve point multiplication, Elliptic-curve Diffie–Hellman, Encryption, Federal government of the United States, Finite field, Hessian form of an elliptic curve, Homomorphic signatures for network coding, ID-based encryption, Identity element, IEEE P1363, Implicit certificate, Integer factorization, Integrated Encryption Scheme, Jacobian curve, Key size, Key-agreement protocol, Kleptography, Lagrange's theorem (group theory), Lecture Notes in Computer Science, ..., Lenstra elliptic-curve factorization, Localization of a category, Mersenne prime, Montgomery curve, MQV, National Institute of Standards and Technology, National Security Agency, Neal Koblitz, NSA Suite B Cryptography, Object identifier, Order (group theory), Pairing-based cryptography, Plane curve, PlayStation 3, Point at infinity, Pollard's rho algorithm for logarithms, Power analysis, Proxy re-encryption, Public-key cryptography, Quantum computing, Quantum cryptography, RSA (cryptosystem), RSA Security, Schnorr signature, Schoof's algorithm, Schoof–Elkies–Atkin algorithm, SECG, Security level, Shor's algorithm, Side-channel attack, Signcryption, Slashdot, Smart card, Supersingular isogeny key exchange, Tate pairing, The New York Times, Toffoli gate, Tripling-oriented Doche–Icart–Kohel curve, Twisted Edwards curve, Twisted Hessian curves, Twists of curves, Victor S. Miller, Weil pairing, Weil restriction, Wired (magazine). Expand index (45 more) »

## Abelian group

In abstract algebra, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written.

New!!: Elliptic-curve cryptography and Abelian group · See more »

## Algebraic structure

In mathematics, and more specifically in abstract algebra, an algebraic structure on a set A (called carrier set or underlying set) is a collection of finitary operations on A; the set A with this structure is also called an algebra.

New!!: Elliptic-curve cryptography and Algebraic structure · See more »

## Algebraic variety

Algebraic varieties are the central objects of study in algebraic geometry.

New!!: Elliptic-curve cryptography and Algebraic variety · See more »

## Algorithm

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.

New!!: Elliptic-curve cryptography and Algorithm · See more »

## Andreas Antonopoulos

Andreas M. Antonopoulos (born 1972) is a Greek-British bitcoin advocate.

New!!: Elliptic-curve cryptography and Andreas Antonopoulos · See more »

## Baby-step giant-step

In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm.

New!!: Elliptic-curve cryptography and Baby-step giant-step · See more »

## Barrett reduction

In modular arithmetic, Barrett reduction is a reduction algorithm introduced in 1986 by P.D. Barrett.

New!!: Elliptic-curve cryptography and Barrett reduction · See more »

## Bitwise operation

In digital computer programming, a bitwise operation operates on one or more bit patterns or binary numerals at the level of their individual bits.

New!!: Elliptic-curve cryptography and Bitwise operation · See more »

## Bruce Schneier

Bruce Schneier (born January 15, 1963, is an American cryptographer, computer security professional, privacy specialist and writer. He is the author of several books on general security topics, computer security and cryptography. Schneier is a fellow at the Berkman Center for Internet & Society at Harvard Law School, a program fellow at the New America Foundation's Open Technology Institute. He has been working for IBM since they acquired Resilient Systems where Schneier was CTO. He is also a contributing writer for The Guardian news organization.

New!!: Elliptic-curve cryptography and Bruce Schneier · See more »

## Classified information in the United States

The United States government classification system is established under Executive Order 13526, the latest in a long series of executive orders on the topic.

New!!: Elliptic-curve cryptography and Classified information in the United States · See more »

## Computational hardness assumption

In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where efficiently typically means "in polynomial time").

New!!: Elliptic-curve cryptography and Computational hardness assumption · See more »

## Counting points on elliptic curves

An important aspect in the study of elliptic curves is devising effective ways of counting points on the curve.

New!!: Elliptic-curve cryptography and Counting points on elliptic curves · See more »

## Cryptocurrency

A cryptocurrency (or crypto currency) is digital asset designed to work as a medium of exchange that uses strong cryptography to secure financial transactions, control the creation of additional units, and verify the transfer of assets.

New!!: Elliptic-curve cryptography and Cryptocurrency · See more »

## Cryptographically secure pseudorandom number generator

A cryptographically secure pseudo-random number generator (CSPRNG) or cryptographic pseudo-random number generator (CPRNG) is a pseudo-random number generator (PRNG) with properties that make it suitable for use in cryptography.

New!!: Elliptic-curve cryptography and Cryptographically secure pseudorandom number generator · See more »

## Curve25519

In cryptography, Curve25519 is an elliptic curve offering 128 bits of security and designed for use with the elliptic curve Diffie–Hellman (ECDH) key agreement scheme.

New!!: Elliptic-curve cryptography and Curve25519 · See more »

## Daniel J. Bernstein

Daniel Julius Bernstein (sometimes known simply as djb; born October 29, 1971) is a German-American mathematician, cryptologist, and programmer.

New!!: Elliptic-curve cryptography and Daniel J. Bernstein · See more »

## Differential fault analysis

Differential fault analysis (DFA) is a type of side channel attack in the field of cryptography, specifically cryptanalysis.

New!!: Elliptic-curve cryptography and Differential fault analysis · See more »

## Diffie–Hellman key exchange

Diffie–Hellman key exchange (DH)Synonyms of Diffie–Hellman key exchange include.

New!!: Elliptic-curve cryptography and Diffie–Hellman key exchange · See more »

## Digital signature

A digital signature is a mathematical scheme for presenting the authenticity of digital messages or documents.

New!!: Elliptic-curve cryptography and Digital signature · See more »

## Digital Signature Algorithm

The Digital Signature Algorithm (DSA) is a Federal Information Processing Standard for digital signatures.

New!!: Elliptic-curve cryptography and Digital Signature Algorithm · See more »

## Discrete logarithm

In the mathematics of the real numbers, the logarithm logb a is a number x such that, for given numbers a and b. Analogously, in any group G, powers bk can be defined for all integers k, and the discrete logarithm logb a is an integer k such that.

New!!: Elliptic-curve cryptography and Discrete logarithm · See more »

## Divisor (algebraic geometry)

In algebraic geometry, divisors are a generalization of codimension-1 subvarieties of algebraic varieties.

New!!: Elliptic-curve cryptography and Divisor (algebraic geometry) · See more »

## DNSCurve

DNSCurve is a proposed new secure protocol for the Domain Name System (DNS), designed by Daniel J. Bernstein.

New!!: Elliptic-curve cryptography and DNSCurve · See more »

## Doubling-oriented Doche–Icart–Kohel curve

In mathematics, the doubling-oriented Doche–Icart–Kohel curve is a form in which an elliptic curve can be written.

New!!: Elliptic-curve cryptography and Doubling-oriented Doche–Icart–Kohel curve · See more »

## Dual EC DRBG

Dual_EC_DRBG (Dual Elliptic Curve Deterministic Random Bit Generator) is an algorithm that was presented as a cryptographically secure pseudorandom number generator (CSPRNG) using methods in elliptic curve cryptography.

New!!: Elliptic-curve cryptography and Dual EC DRBG · See more »

## ECC patents

Patent-related uncertainty around elliptic curve cryptography (ECC), or ECC patents, is one of the main factors limiting its wide acceptance.

New!!: Elliptic-curve cryptography and ECC patents · See more »

## EdDSA

In public-key cryptography, Edwards-curve Digital Signature Algorithm (EdDSA) is a digital signature scheme using a variant of Schnorr signature based on Twisted Edwards curves.

New!!: Elliptic-curve cryptography and EdDSA · See more »

## Edward Snowden

Edward Joseph Snowden (born June 21, 1983) is an American computer professional, former Central Intelligence Agency (CIA) employee, and former contractor for the United States government who copied and leaked classified information from the National Security Agency (NSA) in 2013 without authorization.

New!!: Elliptic-curve cryptography and Edward Snowden · See more »

## Edwards curve

x^2+y^2.

New!!: Elliptic-curve cryptography and Edwards curve · See more »

## Elliptic curve

In mathematics, an elliptic curve is a plane algebraic curve defined by an equation of the form which is non-singular; that is, the curve has no cusps or self-intersections.

New!!: Elliptic-curve cryptography and Elliptic curve · See more »

## Elliptic Curve Digital Signature Algorithm

In cryptography, the Elliptic Curve Digital Signature Algorithm (ECDSA) offers a variant of the Digital Signature Algorithm (DSA) which uses elliptic curve cryptography.

New!!: Elliptic-curve cryptography and Elliptic Curve Digital Signature Algorithm · See more »

## Elliptic curve point multiplication

Elliptic curve point multiplication is the operation of successively adding a point along an elliptic curve to itself repeatedly.

New!!: Elliptic-curve cryptography and Elliptic curve point multiplication · See more »

## Elliptic-curve Diffie–Hellman

Elliptic-curve Diffie–Hellman (ECDH) is an anonymous key agreement protocol that allows two parties, each having an elliptic-curve public–private key pair, to establish a shared secret over an insecure channel.

New!!: Elliptic-curve cryptography and Elliptic-curve Diffie–Hellman · See more »

## Encryption

In cryptography, encryption is the process of encoding a message or information in such a way that only authorized parties can access it and those who are not authorized cannot.

New!!: Elliptic-curve cryptography and Encryption · See more »

## Federal government of the United States

The federal government of the United States (U.S. federal government) is the national government of the United States, a constitutional republic in North America, composed of 50 states, one district, Washington, D.C. (the nation's capital), and several territories.

New!!: Elliptic-curve cryptography and Federal government of the United States · See more »

## Finite field

In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements.

New!!: Elliptic-curve cryptography and Finite field · See more »

## Hessian form of an elliptic curve

In geometry, the Hessian curve is a plane curve similar to folium of Descartes.

New!!: Elliptic-curve cryptography and Hessian form of an elliptic curve · See more »

## Homomorphic signatures for network coding

Network coding has been shown to optimally use bandwidth in a network, maximizing information flow but the scheme is very inherently vulnerable to pollution attacks by malicious nodes in the network.

New!!: Elliptic-curve cryptography and Homomorphic signatures for network coding · See more »

## ID-based encryption

ID-based encryption, or identity-based encryption (IBE), is an important primitive of ID-based cryptography.

New!!: Elliptic-curve cryptography and ID-based encryption · See more »

## Identity element

In mathematics, an identity element or neutral element is a special type of element of a set with respect to a binary operation on that set, which leaves other elements unchanged when combined with them.

New!!: Elliptic-curve cryptography and Identity element · See more »

## IEEE P1363

IEEE P1363 is an Institute of Electrical and Electronics Engineers (IEEE) standardization project for public-key cryptography.

New!!: Elliptic-curve cryptography and IEEE P1363 · See more »

## Implicit certificate

In cryptography, implicit certificates are a variant of public key certificate, such that a public key can be reconstructed from any implicit certificate, and is said then to be implicitly verified, in the sense that the only party who can know the associated private key is the party identified in the implicit certificate.

New!!: Elliptic-curve cryptography and Implicit certificate · See more »

## Integer factorization

In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers.

New!!: Elliptic-curve cryptography and Integer factorization · See more »

## Integrated Encryption Scheme

Integrated Encryption Scheme (IES) is a hybrid encryption scheme which provides semantic security against an adversary who is allowed to use chosen-plaintext and chosen-ciphertext attacks.

New!!: Elliptic-curve cryptography and Integrated Encryption Scheme · See more »

## Jacobian curve

In mathematics, the Jacobi curve is a representation of an elliptic curve different from the usual one (Weierstrass equation).

New!!: Elliptic-curve cryptography and Jacobian curve · See more »

## Key size

In cryptography, key size or key length is the number of bits in a key used by a cryptographic algorithm (such as a cipher).

New!!: Elliptic-curve cryptography and Key size · See more »

## Key-agreement protocol

In cryptography, a key-agreement protocol is a protocol whereby two or more parties can agree on a key in such a way that both influence the outcome.

New!!: Elliptic-curve cryptography and Key-agreement protocol · See more »

## Kleptography

Kleptography is the study of stealing information securely and subliminally and it was introduced by Adam Young and Moti Yung in the Proceedings of Advances in Cryptology—Crypto '96.

New!!: Elliptic-curve cryptography and Kleptography · See more »

## Lagrange's theorem (group theory)

Lagrange's theorem, in the mathematics of group theory, states that for any finite group G, the order (number of elements) of every subgroup H of G divides the order of G. The theorem is named after Joseph-Louis Lagrange.

New!!: Elliptic-curve cryptography and Lagrange's theorem (group theory) · See more »

## Lecture Notes in Computer Science

Springer Lecture Notes in Computer Science (LNCS) is a series of computer science books published by Springer Science+Business Media (formerly Springer-Verlag) since 1973.

New!!: Elliptic-curve cryptography and Lecture Notes in Computer Science · See more »

## Lenstra elliptic-curve factorization

The Lenstra elliptic-curve factorization or the elliptic-curve factorization method (ECM) is a fast, sub-exponential running time, algorithm for integer factorization, which employs elliptic curves.

New!!: Elliptic-curve cryptography and Lenstra elliptic-curve factorization · See more »

## Localization of a category

In mathematics, localization of a category consists of adding to a category inverse morphisms for some collection of morphisms, constraining them to become isomorphisms.

New!!: Elliptic-curve cryptography and Localization of a category · See more »

## Mersenne prime

In mathematics, a Mersenne prime is a prime number that is one less than a power of two.

New!!: Elliptic-curve cryptography and Mersenne prime · See more »

## Montgomery curve

In mathematics the Montgomery curve is a form of elliptic curve, different from the usual Weierstrass form, introduced by Peter L. Montgomery in 1987.

New!!: Elliptic-curve cryptography and Montgomery curve · See more »

## MQV

MQV (Menezes–Qu–Vanstone) is an authenticated protocol for key agreement based on the Diffie–Hellman scheme.

New!!: Elliptic-curve cryptography and MQV · See more »

## National Institute of Standards and Technology

The National Institute of Standards and Technology (NIST) is one of the oldest physical science laboratories in the United States.

New!!: Elliptic-curve cryptography and National Institute of Standards and Technology · See more »

## National Security Agency

The National Security Agency (NSA) is a national-level intelligence agency of the United States Department of Defense, under the authority of the Director of National Intelligence.

New!!: Elliptic-curve cryptography and National Security Agency · See more »

## Neal Koblitz

Neal I. Koblitz (born December 24, 1948) is a Professor of Mathematics at the University of Washington.

New!!: Elliptic-curve cryptography and Neal Koblitz · See more »

## NSA Suite B Cryptography

NSA Suite B Cryptography is a set of cryptographic algorithms promulgated by the National Security Agency as part of its Cryptographic Modernization Program.

New!!: Elliptic-curve cryptography and NSA Suite B Cryptography · See more »

## Object identifier

In computing, object identifiers or OIDs are an identifier mechanism standardized by the International Telecommunications Union (ITU) and ISO/IEC for naming any object, concept, or "thing" with a globally unambiguous persistent name.

New!!: Elliptic-curve cryptography and Object identifier · See more »

## Order (group theory)

In group theory, a branch of mathematics, the term order is used in two unrelated senses.

New!!: Elliptic-curve cryptography and Order (group theory) · See more »

## Pairing-based cryptography

Pairing-based cryptography is the use of a pairing between elements of two cryptographic groups to a third group with a mapping e:G_1 \times G_2 \to G_T to construct or analyze cryptographic systems.

New!!: Elliptic-curve cryptography and Pairing-based cryptography · See more »

## Plane curve

In mathematics, a plane curve is a curve in a plane that may be either a Euclidean plane, an affine plane or a projective plane.

New!!: Elliptic-curve cryptography and Plane curve · See more »

## PlayStation 3

The PlayStation 3 (PS3) is a home video game console developed by Sony Computer Entertainment.

New!!: Elliptic-curve cryptography and PlayStation 3 · See more »

## Point at infinity

In geometry, a point at infinity or ideal point is an idealized limiting point at the "end" of each line.

New!!: Elliptic-curve cryptography and Point at infinity · See more »

## Pollard's rho algorithm for logarithms

Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, analogous to Pollard's rho algorithm to solve the integer factorization problem.

New!!: Elliptic-curve cryptography and Pollard's rho algorithm for logarithms · See more »

## Power analysis

In cryptography, power analysis is a form of side channel attack in which the attacker studies the power consumption of a cryptographic hardware device (such as a smart card, tamper-resistant "black box", or integrated circuit).

New!!: Elliptic-curve cryptography and Power analysis · See more »

## Proxy re-encryption

Proxy re-encryption schemes are cryptosystems which allow third parties (proxies) to alter a ciphertext which has been encrypted for one party, so that it may be decrypted by another.

New!!: Elliptic-curve cryptography and Proxy re-encryption · See more »

## Public-key cryptography

Public-key cryptography, or asymmetric cryptography, is any cryptographic system that uses pairs of keys: public keys which may be disseminated widely, and private keys which are known only to the owner.

New!!: Elliptic-curve cryptography and Public-key cryptography · See more »

## Quantum computing

Quantum computing is computing using quantum-mechanical phenomena, such as superposition and entanglement.

New!!: Elliptic-curve cryptography and Quantum computing · See more »

## Quantum cryptography

Quantum cryptography is the science of exploiting quantum mechanical properties to perform cryptographic tasks.

New!!: Elliptic-curve cryptography and Quantum cryptography · See more »

## RSA (cryptosystem)

RSA (Rivest–Shamir–Adleman) is one of the first public-key cryptosystems and is widely used for secure data transmission.

New!!: Elliptic-curve cryptography and RSA (cryptosystem) · See more »

## RSA Security

RSA Security LLC, formerly RSA Security, Inc. and doing business as RSA, is an American computer and network security company.

New!!: Elliptic-curve cryptography and RSA Security · See more »

## Schnorr signature

In cryptography, a Schnorr signature is a digital signature produced by the Schnorr signature algorithm.

New!!: Elliptic-curve cryptography and Schnorr signature · See more »

## Schoof's algorithm

Schoof's algorithm is an efficient algorithm to count points on elliptic curves over finite fields.

New!!: Elliptic-curve cryptography and Schoof's algorithm · See more »

## Schoof–Elkies–Atkin algorithm

The Schoof–Elkies–Atkin algorithm (SEA) is an algorithm used for finding the order of or calculating the number of points on an elliptic curve over a finite field.

New!!: Elliptic-curve cryptography and Schoof–Elkies–Atkin algorithm · See more »

## SECG

In cryptography, the Standards for Efficient Cryptography Group (SECG) is an international consortium founded by Certicom in 1998.

New!!: Elliptic-curve cryptography and SECG · See more »

## Security level

In cryptography, security level is a measure of the strength that a cryptographic primitive — such as a cipher or hash function — achieves.

New!!: Elliptic-curve cryptography and Security level · See more »

## Shor's algorithm

Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer factorization formulated in 1994.

New!!: Elliptic-curve cryptography and Shor's algorithm · See more »

## Side-channel attack

In computer security, a side-channel attack is any attack based on information gained from the implementation of a computer system, rather than weaknesses in the implemented algorithm itself (e.g. cryptanalysis and software bugs).

New!!: Elliptic-curve cryptography and Side-channel attack · See more »

## Signcryption

In cryptography, signcryption is a public-key primitive that simultaneously performs the functions of both digital signature and encryption.

New!!: Elliptic-curve cryptography and Signcryption · See more »

## Slashdot

Slashdot (sometimes abbreviated as /.) is a social news website that originally billed itself as "News for Nerds.

New!!: Elliptic-curve cryptography and Slashdot · See more »

## Smart card

A smart card, chip card, or integrated circuit card (ICC), is any pocket-sized card that has embedded integrated circuits.

New!!: Elliptic-curve cryptography and Smart card · See more »

## Supersingular isogeny key exchange

Supersingular isogeny Diffie–Hellman key exchange (SIDH) is a post-quantum cryptographic algorithm used to establish a secret key between two parties over an otherwise insecure communications channel.

New!!: Elliptic-curve cryptography and Supersingular isogeny key exchange · See more »

## Tate pairing

In mathematics, Tate pairing is any of several closely related bilinear pairings involving elliptic curves or abelian varieties, usually over local or finite fields, based on the Tate duality pairings introduced by and extended by.

New!!: Elliptic-curve cryptography and Tate pairing · See more »

## The New York Times

The New York Times (sometimes abbreviated as The NYT or The Times) is an American newspaper based in New York City with worldwide influence and readership.

New!!: Elliptic-curve cryptography and The New York Times · See more »

## Toffoli gate

In logic circuits, the Toffoli gate (also CCNOT gate), invented by Tommaso Toffoli, is a universal reversible logic gate, which means that any reversible circuit can be constructed from Toffoli gates.

New!!: Elliptic-curve cryptography and Toffoli gate · See more »

## Tripling-oriented Doche–Icart–Kohel curve

The tripling-oriented Doche–Icart–Kohel curve is a form of an elliptic curve that has been used lately in cryptography; it is a particular type of Weierstrass curve.

New!!: Elliptic-curve cryptography and Tripling-oriented Doche–Icart–Kohel curve · See more »

## Twisted Edwards curve

In algebraic geometry, the twisted Edwards curves are plane models of elliptic curves, a generalisation of Edwards curves introduced by Bernstein, Birkner, Joye, Lange and Peters in 2008.

New!!: Elliptic-curve cryptography and Twisted Edwards curve · See more »

## Twisted Hessian curves

In mathematics, the Twisted Hessian curve represents a generalization of Hessian curves; it was introduced in elliptic curve cryptography to speed up the addition and doubling formulas and to have strongly unified arithmetic.

New!!: Elliptic-curve cryptography and Twisted Hessian curves · See more »

## Twists of curves

In the mathematical field of algebraic geometry, an elliptic curve E over a field K has an associated quadratic twist, that is another elliptic curve which is isomorphic to E over an algebraic closure of K. In particular, an isomorphism between elliptic curves is an isogeny of degree 1, that is an invertible isogeny.

New!!: Elliptic-curve cryptography and Twists of curves · See more »

## Victor S. Miller

Victor Saul Miller (born 3 March 1947 in Brooklyn, New York) is an American mathematician at the Center for Communications Research (CCR) of the Institute for Defense Analyses in Princeton, New Jersey, U.S. He received his A.B. in mathematics from Columbia University in 1968, and his Ph.D. in mathematics from Harvard University in 1975.

New!!: Elliptic-curve cryptography and Victor S. Miller · See more »

## Weil pairing

In mathematics, the Weil pairing is a pairing (bilinear form, though with multiplicative notation) on the points of order dividing n of an elliptic curve E, taking values in nth roots of unity.

New!!: Elliptic-curve cryptography and Weil pairing · See more »

## Weil restriction

In mathematics, restriction of scalars (also known as "Weil restriction") is a functor which, for any finite extension of fields L/k and any algebraic variety X over L, produces another variety ResL/kX, defined over k. It is useful for reducing questions about varieties over large fields to questions about more complicated varieties over smaller fields.

New!!: Elliptic-curve cryptography and Weil restriction · See more »

## Wired (magazine)

Wired is a monthly American magazine, published in print and online editions, that focuses on how emerging technologies affect culture, the economy, and politics.

New!!: Elliptic-curve cryptography and Wired (magazine) · See more »

## Redirects here:

ECC Brainpool, ECDLP, Elliptic Curve Cryptography, Elliptic Curve Discrete Logarithm Problem, Elliptic curve cryptography, Elliptic curve cryptography (ECC), Elliptic curve discrete logarithm problem, Elliptic-curve discrete logarithm problem, Elliptical Curve Cryptography, Elliptical curve cryptography, Parabolic cryptography, Parabolic encryption.

## References

[1] https://en.wikipedia.org/wiki/Elliptic-curve_cryptography