Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Androidâ„¢ device!
Install
Faster access than browser!
 

Elliptic-curve cryptography and Supersingular isogeny key exchange

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Elliptic-curve cryptography and Supersingular isogeny key exchange

Elliptic-curve cryptography vs. Supersingular isogeny key exchange

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. 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.

Similarities between Elliptic-curve cryptography and Supersingular isogeny key exchange

Elliptic-curve cryptography and Supersingular isogeny key exchange have 12 things in common (in Unionpedia): Curve25519, Diffie–Hellman key exchange, Discrete logarithm, EdDSA, Elliptic Curve Digital Signature Algorithm, Elliptic-curve Diffie–Hellman, Integer factorization, Public-key cryptography, Quantum computing, RSA (cryptosystem), Security level, Shor's algorithm.

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.

Curve25519 and Elliptic-curve cryptography · Curve25519 and Supersingular isogeny key exchange · See more »

Diffie–Hellman key exchange

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

Diffie–Hellman key exchange and Elliptic-curve cryptography · Diffie–Hellman key exchange and Supersingular isogeny key exchange · 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.

Discrete logarithm and Elliptic-curve cryptography · Discrete logarithm and Supersingular isogeny key exchange · 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.

EdDSA and Elliptic-curve cryptography · EdDSA and Supersingular isogeny key exchange · 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.

Elliptic Curve Digital Signature Algorithm and Elliptic-curve cryptography · Elliptic Curve Digital Signature Algorithm and Supersingular isogeny key exchange · 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.

Elliptic-curve Diffie–Hellman and Elliptic-curve cryptography · Elliptic-curve Diffie–Hellman and Supersingular isogeny key exchange · See more »

Integer factorization

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

Elliptic-curve cryptography and Integer factorization · Integer factorization and Supersingular isogeny key exchange · 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.

Elliptic-curve cryptography and Public-key cryptography · Public-key cryptography and Supersingular isogeny key exchange · See more »

Quantum computing

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

Elliptic-curve cryptography and Quantum computing · Quantum computing and Supersingular isogeny key exchange · See more »

RSA (cryptosystem)

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

Elliptic-curve cryptography and RSA (cryptosystem) · RSA (cryptosystem) and Supersingular isogeny key exchange · 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.

Elliptic-curve cryptography and Security level · Security level and Supersingular isogeny key exchange · 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.

Elliptic-curve cryptography and Shor's algorithm · Shor's algorithm and Supersingular isogeny key exchange · See more »

The list above answers the following questions

Elliptic-curve cryptography and Supersingular isogeny key exchange Comparison

Elliptic-curve cryptography has 95 relations, while Supersingular isogeny key exchange has 34. As they have in common 12, the Jaccard index is 9.30% = 12 / (95 + 34).

References

This article shows the relationship between Elliptic-curve cryptography and Supersingular isogeny key exchange. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »