Table of Contents
12 relations: Adi Shamir, Cryptosystem, Discrete logarithm, Elliptic Curve Digital Signature Algorithm, Integer factorization, Knapsack problem, Merkle–Hellman knapsack cryptosystem, Post-quantum cryptography, Public-key cryptography, RSA (cryptosystem), Shor's algorithm, Time complexity.
Adi Shamir
Adi Shamir (עדי שמיר; born July 6, 1952) is an Israeli cryptographer and inventor.
See Knapsack cryptosystems and Adi Shamir
Cryptosystem
In cryptography, a cryptosystem is a suite of cryptographic algorithms needed to implement a particular security service, such as confidentiality (encryption). Knapsack cryptosystems and cryptosystem are cryptography and cryptography stubs.
See Knapsack cryptosystems and Cryptosystem
Discrete logarithm
In mathematics, for given real numbers a and b, the logarithm logb a is a number x such that. Knapsack cryptosystems and Discrete logarithm are cryptography.
See Knapsack cryptosystems and Discrete logarithm
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.
See Knapsack cryptosystems and Elliptic Curve Digital Signature Algorithm
Integer factorization
In number theory, integer factorization is the decomposition of a positive integer into a product of integers.
See Knapsack cryptosystems and Integer factorization
Knapsack problem
The knapsack problem is the following problem in combinatorial optimization: It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items. Knapsack cryptosystems and knapsack problem are cryptography.
See Knapsack cryptosystems and Knapsack problem
Merkle–Hellman knapsack cryptosystem
The Merkle–Hellman knapsack cryptosystem was one of the earliest public key cryptosystems.
See Knapsack cryptosystems and Merkle–Hellman knapsack cryptosystem
Post-quantum cryptography
Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms (usually public-key algorithms) that are thought to be secure against a cryptanalytic attack by a quantum computer.
See Knapsack cryptosystems and Post-quantum cryptography
Public-key cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Knapsack cryptosystems and Public-key cryptography are cryptography.
See Knapsack cryptosystems and Public-key cryptography
RSA (cryptosystem)
RSA (Rivest–Shamir–Adleman) is a public-key cryptosystem, one of the oldest widely used for secure data transmission.
See Knapsack cryptosystems and RSA (cryptosystem)
Shor's algorithm
Shor's algorithm is a quantum algorithm for finding the prime factors of an integer.
See Knapsack cryptosystems and Shor's algorithm
Time complexity
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm.
See Knapsack cryptosystems and Time complexity
References
Also known as Knapsack cryptosystem.