Quantum safe Flashcards
CRYSTALS-Kyber public-key encryption
Kyber is a key encapsulation mechanism (KEM) whose security is based on the hardness of solving the learning-with-errors problem over module lattices, and is part of the CRYSTALS (Cryptographic Suite for Algebraic Lattices) suite of algorithms.”
CRYSTALS-Dilithium digital signature algorithms
Dilithium, also a CRYSTALS algorithm, “is a digital signature scheme that has its security similarly based on the hardness of lattice problems over module lattices.”2
RSA algorithm (Rivest-Shamir-Adleman)
The RSA algorithm (Rivest-Shamir-Adleman) is the basis of a cryptosystem – a suite of cryptographic algorithms that are used for specific security services or purposes – which enables public key encryption and is widely used to secure sensitive data, particularly when it is being sent over an insecure network such as the internet.
RSA was first publicly described in 1977 by Ron Rivest, Adi Shamir and Leonard Adleman of the Massachusetts Institute of Technology, though the 1973 creation of a public key algorithm by British mathematician Clifford Cocks was kept classified by the U.K.’s GCHQ until 1997.
Public key cryptography, also known as asymmetric cryptography, uses two different but mathematically linked keys – one public and one private. The public key can be shared with everyone, whereas the private key must be kept secret.
TLS
Transport Layer Security
Cryptographic primitives
Cryptographic primitives are well-established, low-level cryptographic algorithms that are frequently used to build cryptographic protocols for computer security systems.[1] These routines include, but are not limited to, one-way hash functions and encryption functions.
Lattice Based Cryptography
is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or in the security proof. Lattice-based constructions are currently important candidates for post-quantum cryptography. Unlike more widely used and known public-key schemes such as the RSA, Diffie-Hellman or elliptic-curve cryptosystems—which could, theoretically, be defeated using Shor’s algorithm on a quantum computer—some lattice-based constructions appear to be resistant to attack by bo
FHE
fully homomorphic encryption (FHE)
Fully homomorphic encryption (FHE) is an encryption scheme that enables
Cyber Presidential Mandate 2022
Memorandum on Improving the Cybersecurity of National Security, Department of Defense, and Intelligence Community Systems
CIRCL
Cloudflare Interoperable, Reusable Cryptographic Library;
tape drive
data storage device that reads and writes data on a magnetic tape. Magnetic tape data storage is typically used for offline, archival data storage. Tape media generally has a favorable unit cost and a long archival stability.
Caesar’s cypher
Caesar’s cipher, the shift cipher, Caesar’s code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on. The method is named after Julius Caesar, who used it in his private correspondence.[1]
Public-key cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key.[1][2] Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security.[3]
Diffie–Hellman key exchange
is a mathematical method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman.[1][2] DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography. Published in 1976 by Diffie and Hellman, this is the earliest publicly known work that proposed the idea of a private key and a corresponding public key.
SHA-3
SHA-3 (Secure Hash Algorithm 3) is the latest member of the Secure Hash Algorithm family of standards, released by NIST on August 5, 2015.[4][5][6] Although part of the same series of standards, SHA-3 is internally different from the MD5-like structure of SHA-1 and SHA-2.
Advanced Encryption Standard (AES)
The Advanced Encryption Standard (AES), also known by its original name Rijndael (Dutch pronunciation: [ˈrɛindaːl]),[5] is a specification for the encryption of electronic data established by the U.S. National Institute of Standards and Technology (NIST) in 2001.[6]
