Discover published sets by community

A lattice-based cryptosystem that remains secure under the assumption that certain lattice problems are hard for quantum computers.

Utilizes the computational hardness of lattice problems that are believed to be difficult for both classical and quantum computers.

Employs the principles of quantum mechanics, ensuring security through the detection of eavesdropping, as eavesdropping alters quantum states.

While not itself a cryptographic algorithm, Boson Sampling could demonstrate quantum advantage; post-quantum cryptography aims to resist such potential advancements.

A variant of LWE that uses ring structures, providing efficiency while maintaining hardness against quantum attacks.

These functions are used in hash-based cryptography and, due to their one-way property, are not directly broken by quantum computers.

A key exchange protocol based on the difficulty of computing isogenies between supersingular elliptic curves, resisting quantum computer attacks.

A form of code-based cryptography that uses binary Goppa codes to achieve quantum resistance.

A lattice-based cryptosystem designed to be secure against both classical and quantum computing threats.

A problem in lattice-based cryptography that involves solving linear equations with noisy solutions, resistant to known quantum attacks.

Relies on the security of hash functions, which quantum computers can't efficiently reverse due to the one-way property.

A code-based cryptosystem that resists quantum attacks due to the difficulty of the syndrome decoding problem for classical and quantum computers alike.

A blockchain designed with post-quantum cryptography algorithms to be secure against an adversary using quantum computers.

An extension of Ring-LWE that further increases efficiency and aims to retain resistance against quantum computers.

A deterministic variant of LWE offering resistance to quantum attacks and often enjoys performance improvements.

Rests on the challenge of finding isogenies between elliptic curves, which is a problem not yet solved by quantum algorithms.

Builds on the hardness of the decoding problem for general linear codes, which hasn't been efficiently solved by quantum algorithms.

Based on the difficulty of solving systems of multivariate quadratic equations, a problem which remains hard for quantum computers.

A cryptosystem based on the difficulty of solving systems of multivariate polynomial equations, considered to be secure against quantum adversaries.

A key encapsulation mechanism that is part of the NIST post-quantum cryptography standardization process, designed to resist quantum cryptanalysis.

A multivariate public key cryptosystem (MPKC) designed to be secure against quantum attacks based on the hardness of the MQP problem.

A key encapsulation mechanism based on the Learning with Errors (LWE) problem that aims to offer quantum resistance.

Centered around the trapdoor one-way function nature of Goppa codes which resist quantum attacks due to the intractability of decoding an arbitrary linear code.

A lattice-based digital signature scheme that is considered to be resilient to quantum computer-based attacks.

While no symmetric algorithm is specifically quantum-proof, increasing key sizes can offer resistance to brute-force attacks from quantum computers.

While not inherently quantum-resistant, some lattice-based homomorphic encryption schemes are designed to be secure against quantum computers.

A post-quantum digital signature scheme that is secure under the assumption that certain symmetric key primitives are quantum-resistant.

A lattice-based key encapsulation mechanism aiming for quantum resistance, predicated on the Module Learning with Rounding (Module-LWR) problem.

A key exchange protocol based on the Ring-LWE problem, designed to withstand threats posed by quantum computers.