|
gptkb:elliptic_curve_cryptography
|
elliptic curve discrete logarithm problem
|
|
gptkb:Boneh-Franklin_IBE_scheme
|
gptkb:Bilinear_Diffie-Hellman_problem
|
|
gptkb:Learning_With_Errors_(LWE)
|
hardness of lattice problems
|
|
gptkb:NTRU_lattice
|
hardness of lattice problems
|
|
gptkb:BFV_scheme
|
hardness of RLWE problem
|
|
gptkb:Learning_With_Errors_problem
|
worst-case hardness of lattice problems
|
|
gptkb:BB84_protocol
|
No-cloning theorem
|
|
gptkb:Bennett–Brassard_1984_protocol
|
gptkb:no-cloning_theorem
|
|
gptkb:XMSS_(eXtended_Merkle_Signature_Scheme)
|
one-time signature schemes
|
|
gptkb:XMSS
|
collision resistance of hash functions
|
|
gptkb:BB84
|
gptkb:Heisenberg_uncertainty_principle
|
|
gptkb:BB84
|
No-cloning theorem
|
|
gptkb:BB84_protocol
|
gptkb:Heisenberg_uncertainty_principle
|
|
gptkb:Learning_With_Errors_assumption
|
hardness of solving noisy linear equations
|
|
gptkb:McEliece_cryptosystem
|
hardness of decoding random linear codes
|
|
gptkb:Ring_Learning_With_Errors_(RLWE)
|
ideal lattice problems
|
|
gptkb:XMSS_(eXtended_Merkle_Signature_Scheme)
|
gptkb:Merkle_tree
|
|
gptkb:Classic_McEliece
|
hardness of decoding random linear codes
|
|
gptkb:Bennett–Brassard_1984_protocol
|
gptkb:Heisenberg_uncertainty_principle
|
|
gptkb:NTRU
|
hardness of certain lattice problems
|