Non-commutative cryptography is the area of cryptology where the cryptographic primitives, methods and systems are based on algebraic structures like semigroups...

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC...

Hyperelliptic curve cryptography is similar to elliptic curve cryptography (ECC) insofar as the Jacobian of a hyperelliptic curve is an abelian group in...

"Introduction to Cryptography with Open-Source Software". p. 12. Surender R. Chiluka. "Public key Cryptography". Neal Koblitz. "Cryptography As a Teaching...

employ asymmetric cryptography. In many instances, they provide a layer of validation and security to messages sent through a non-secure channel: Properly...

Post-Quantum Cryptography Standardization is a program and competition by NIST to update their standards to include post-quantum cryptography. It was announced...

paper by Michael Purser which outlined a new public-key cryptographic scheme using non-commutative multiplication. She was asked to write an implementation...

In cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography which is based on the Diffie–Hellman...

Signal Protocol (formerly known as the TextSecure Protocol) is a non-federated cryptographic protocol that provides end-to-end encryption for voice and instant...

In cryptography, GMR is a digital signature algorithm named after its inventors Shafi Goldwasser, Silvio Micali and Ron Rivest. As with RSA the security...

Identity-based cryptography is a type of public-key cryptography in which a publicly known string representing an individual or organization is used as...

Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms...

key exchange protocol Non-commutative cryptography Myasnikov, A.G.; Shpilrain, V.; Ushakov, A. (2008). Group-based Cryptography. Advanced Courses in Mathematics...

{\displaystyle m=E^{-1}(k_{E};c)} SECG, Standards for efficient cryptography, SEC 1: Elliptic Curve Cryptography, Version 2.0, May 21, 2009. Gayoso Martínez, Hernández...

exchange is a mathematical method of securely generating a symmetric cryptographic key over a public channel and was one of the first public-key protocols...

integrity, authentication, and non-repudiation) are also central to cryptography. Practical applications of cryptography include electronic commerce, chip-based...

uncertain as of 2004 if this variant is secure. The Handbook of Applied Cryptography by Menezes, Oorschot and Vanstone considers this equivalence probable...

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

A threshold cryptosystem, the basis for the field of threshold cryptography, is a cryptosystem that protects information by encrypting it and distributing...

Paillier in 1999, is a probabilistic asymmetric algorithm for public key cryptography. The problem of computing n-th residue classes is believed to be computationally...

property is called quasi-commutative.) (With the first two properties, one recovers the normal definition of a cryptographic hash function.) From such...

second phase computes a single key pair for one user. Choose an approved cryptographic hash function H {\displaystyle H} with output length | H | {\displaystyle...

In public-key cryptography, a public key fingerprint is a short sequence of bytes used to identify a longer public key. Fingerprints are created by applying...

SPEKE (Simple Password Exponential Key Exchange) is a cryptographic method for password-authenticated key agreement. The protocol consists of little more...

In cryptography, a web of trust is a concept used in PGP, GnuPG, and other OpenPGP-compatible systems to establish the authenticity of the binding between...

is that F satisfies the Baum–Connes conjecture. Higman group Non-commutative cryptography Shavgulidze, E. (2009), "The Thompson group F is amenable", Infinite...

It is a variant of the Diffie–Hellman protocol using elliptic-curve cryptography. The following example illustrates how a shared key is established. Suppose...

In cryptography, a Schnorr signature is a digital signature produced by the Schnorr signature algorithm that was described by Claus Schnorr. It is a digital...

BLS digital signature, also known as Boneh–Lynn–Shacham (BLS), is a cryptographic signature scheme which allows a user to verify that a signer is authentic...

In public-key cryptography, the Station-to-Station (STS) protocol is a cryptographic key agreement scheme. The protocol is based on classic Diffie–Hellman...