A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
read more
Abstract: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret primer numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d ≡ 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Quantum Circuits for Isometries
TL;DR: A theoretical lower bound on the number of cnot gates required to decompose an arbitrary isometry from $m$ to $n$ qubits is derived and three explicit gate decompositions are given that achieve this bound up to a factor of about 2 in the leading order.
Measurement-device-independent quantum secure direct communication
TL;DR: This Letter reports the first measurement-device-independent(MDI) QSDC protocol with sequences of entangled photon pairs and single photons, which eliminates security loopholes associated with the measurement device.
From Pre-Quantum to Post-Quantum IoT Security: A Survey on Quantum-Resistant Cryptosystems for the Internet of Things
TL;DR: A survey on what can be called post-quantum IoT systems (IoT systems protected from the currently known quantum computing attacks): the main post-Quantum cryptosystems and initiatives are reviewed, the most relevant IoT architectures and challenges are analyzed, and the expected future trends are indicated.
228
•Proceedings Article
Batch RSA
Amos Fiat
- 01 Jul 1989
TL;DR: A variant of the RSA algorithm called Batch RSA with two important properties: the cost per private operation is exponentially smaller than other number-theoretic schemes and the possibility of using a distributed BATCH RSA process that isolates the private key from the system, irrespective of the size of the System, the number of sites, or thenumber of private operations that need to be performed.
228
References
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
•Book
The Art of Computer Programming, Volume 2: Seminumerical Algorithms
Donald E. Knuth
- 01 Jan 1981
4.4K
•Book
An introduction to the theory of numbers
Ivan Niven,H. S. Zuckerman +1 more
- 01 Jan 1960
TL;DR: Divisibility congruence quadratic reciprocity and Quadratic forms some functions of number theory some diophantine equations Farey fractions and irrational numbers simple continued fractions primes and multiplicative number theory algebraic numbers the partition function the density of sequences of integers.
2.1K
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)
TL;DR: An improved algorithm is derived which requires O =(\log^{2} p) complexity if p - 1 has only small prime factors and such values of p must be avoided in the cryptosystem.
1.3K
Riemann's hypothesis and tests for primality
TL;DR: It is shown that a class of functions which includes the Euler phi function are computationally equivalent to factoring integers.
869