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
Cyber-security enhancement of networked control systems using homomorphic encryption
Kiminao Kogiso,Takahiro Fujita +1 more
- 01 Dec 2015
TL;DR: This paper presents how to encrypt a linear controller using modified homomorphic encryption schemes based on public-key RSA and ElGamal encryption systems and confirms that only the scrambled parameters and signals can be seen in the controller device of the security-enhanced networked control system.
287
Secure communications over insecure channels based on short authenticated strings
Serge Vaudenay
- 14 Aug 2005
TL;DR: A way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g. 15 bits, which offers an alternative (or complement) to public-key infrastructures, since it no longer need any central authority, and to password-based authenticated key exchange, since one no longer needs to establish a confidential password.
Shared and searchable encrypted data for untrusted servers
TL;DR: This paper proposes an encryption scheme where each authorised user in the system has his own keys to encrypt and decrypt data and supports keyword search which enables the server to return only the encrypted data that satisfies an encrypted query without decrypting it.
CS proofs
Silvio Micali
- 20 Nov 1994
TL;DR: It is shown that every computation possesses a short certificate vouching its correctness, and that, under a cryptographic assumption, any program for a /spl Nscr//spl Pscr/-complete problem is checkable in polynomial time.
284
Unconventional cryptographic keying variable management
TL;DR: Three unconventional approaches to keying variable management are presented and the characteristics of an urban UHF radio channel, determined by mutual sounding, as the cryptovariable are proposed.
282
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