Ronald L. Rivest  Home/Search
Context
Related
Links: ACM | andercheran.aiind.up...Cryptology.ps.gz cwi.nl/~rdewolf/rivest_crypto.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: andercheran.aiind.upv.es/...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Cryptology has advanced tremendously since 1976; this chapter provides a brief overview of the current state-of-the-art in the field. Several major themes predominate in the development. One such theme is the careful elaboration of the definition of security for a cryptosystem. A second theme has been the search for provably secure cryptosystems, based on plausible assumptions about the difficulty of specific number-theoretic problems or on the existence of certain kinds of functions (such as... (Update)
Similar documents (at the sentence level):
68.4%: Cryptology - Rivest (Correct)
22.6%: Lecture Notes on Cryptography - Goldwasser, Bellare (1996) (Correct)
Active bibliography (related documents): More All
0.8: Uncertainty Principles and Ideal Atomic Decomposition - Donoho, Huo (1999) (Correct)
0.5: Complexity and Security of Distributed Protocols - Franklin (1993) (Correct)
0.5: Are `Strong' Primes Needed for RSA? - Rivest, Silverman (1999) (Correct)
Similar documents based on text: More All
0.2: Some Aspects of Cryptology Teaching - Olejar, Stanek (Correct)
0.2: Probabilistic Proof Systems - Part I - Vadhan (2000) (Correct)
0.2: Cryptanalysis: A survey of recent results - Brickel, Odlyzko (Correct)
BibTeX entry: (Update)
@misc{ rivest-cryptology,
author = "Ronald L. Rivest",
title = "Cryptology",
url = "citeseer.ist.psu.edu/article/rivest90cryptology.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978 ACM DBLP
645 How to share a secret (context) - Shamir - 1979 ACM DBLP
635 New directions in cryptography - Diffie, Hellman - 1976 ACM
531 The knowledge complexity of interactive proofsystems (context) - Goldwasser, Micali et al. - 1989
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988 ACM DBLP
450 Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978 ACM DBLP
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1984 ACM DBLP
411 How to prove yourself: practical solutions to identification.. - Fiat, Shamir - 1987 ACM DBLP
339 Theory and application of trapdoor functions (context) - Yao - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984 ACM DBLP
329 Untraceable electronic mail (context) - Chaum - 1981
287 Multi-party unconditionally secure protocols (context) - Chaum, Crepeau et al. - 1988
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984 ACM DBLP
244 Cryptography and Data Security (context) - Denning - 1982 ACM DBLP
241 Communication theory of secrecy systems (context) - Shannon - 1949
239 Blind signatures for untraceable payments (context) - Chaum - 1983 DBLP
227 Factoring polynomials with rational coefficients (context) - Lenstra, Lenstra et al. - 1982
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989 ACM DBLP
197 A randomized protocol for signing contracts (context) - Even, Goldreich et al. - 1983 ACM DBLP
185 How to generate and exchange secrets (context) - Yao - 1986
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
170 Shift Register Sequences (context) - Golomb - 1982 ACM
168 An improved algorithm for computing logarithms over GF (context) - Pohlig, Hellman - 1978
167 Protocols for secure computations (context) - Yao - 1982
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989 ACM DBLP
145 Computational complexity of probabilistic Turing machines (context) - Gill - 1977 ACM DBLP
133 A practical scheme for non-interactive verifiable secret sha.. (context) - Feldman - 1985 DBLP
128 A subexponential algorithm for the discrete logarithm proble.. (context) - Adleman - 1977
124 The Art of Computer Programming: Vol (context) - Knuth - 1969
120 Unbiased bits from sources of weak randomness and probabilis.. - Chor, Goldreich - 1988 ACM DBLP
110 Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
109 Verifiable secret sharing and achieving simultaneity in the .. (context) - Chor, Goldwasser et al. - 1985
103 A simple unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986 DBLP
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988 DBLP
98 Private coins versus public coins in interactive proof syste.. (context) - Goldwasser, Sipser - 1986 ACM DBLP
98 An Introduction to the Theory of Numbers (context) - Niven, Zuckerman - 1972
97 the security of public key protocols (context) - Dolev, Yao - 1981
94 Complexity measures for public-key cryptosystems (context) - Grollman, Selman - 1988 ACM DBLP
78 Probabilistic algorithms for testing primality (context) - Rabin - 1980
78 New York (context) - Kahn, Macmillian - 1967
72 Constructing Digital Signatures from a One-Way Function (context) - Lamport - 1979
70 Hiding information and signatures in trapdoor knapsacks (context) - Merkle, Hellman - 1978
69 Factoring polynomials over large finite fields (context) - Berlekamp - 1970
68 Prime Numbers and Computer Methods for Factorization (context) - Riesel - 1985 ACM
68 One-way functions and pseudorandom generators (context) - Levin - 1985 ACM DBLP
66 A fast Monte-Carlo test for primality (context) - Solovay, Strassen - 1977 DBLP
64 Secret sharing homomorphisms: keeping shares of a secret sha.. (context) - Benaloh - 1987 DBLP
63 An efficient probabilistic public-key encryption scheme whic.. (context) - Blum, Goldwasser - 1985 DBLP
62 RSA and Rabin functions: certain parts are as hard as the wh.. (context) - Alexi, Chor et al. - 1988 ACM DBLP
60 Solving low-density subset sum problems (context) - Lagarias, Odlyzko - 1983 ACM DBLP
55 The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988 ACM DBLP
54 A robust and verifiable cryptographically secure election sc.. (context) - Cohen, Fischer - 1985
52 The wire-tap channel (context) - Wyner - 1975
51 On distinguishing prime numbers from composite numbers (context) - Adleman, Pomerance et al. - 1983
51 Exhaustive cryptanalysis of the NBS data encryption standard (context) - Diffie, Hellman - 1977
47 Discrete logarithms in finite fields and their cryptographic.. - Odlyzko - 1985 ACM DBLP
45 Secure communications over insecure channels (context) - Merkle - 1978 ACM DBLP
45 the generation of cryptographically strong pseudo-random seq.. (context) - Shamir - 1981 DBLP
43 Cryptography: A New Dimension in Computer Data Security (context) - Meyer, Matyas - 1982
41 Nontransitive transfer of confidence: a perfect zero-knowled.. - Brassard, Crepeau - 1986
41 Generating quasi-random sequences from slightly-random sourc.. (context) - Santha, Vazirani - 1984
40 Probabilistic algorithms in finite fields - Rabin - 1980 DBLP
40 Codes which detect deception (context) - Gilbert, MacWilliams et al. - 1974
39 Algorithms in number theory (context) - Lenstra, Lenstra - 1989 ACM DBLP
38 A knapsack type public-key cryptosystem based on arithmetic .. - Chor, Rivest - 1988
38 Solving simultaneous modular equations of low degree (context) - Hastad - 1988 ACM DBLP
38 Cryptography: A Primer (context) - Konheim - 1981
38 Almost all primes can be quickly certified (context) - Goldwasser, Kilian - 1986 ACM DBLP
37 Analysis and comparison of some integer factoring algorithms (context) - Pomerance - 1982
37 the security of multi-party ping-pong protocols - Even, Goldreich - 1983
36 Recognizing primes in random polynomial time (context) - Adleman, Huang - 1987 ACM DBLP
36 Cryptographic protocols - DeMillo, Lynch et al. - 1982 ACM DBLP
34 the security of ping-pong protocols (context) - Dolev, Even et al. - 1983
34 Privacy and authentication: an introduction to cryptography (context) - Diffie, Hellman - 1979
33 A polynomial-time algorithm for breaking the basic Merkle-He.. (context) - Shamir - 1982
33 Quantum cryptography (context) - Bennett, Brassard et al. - 1983 ACM
32 Coin flipping by telephone (context) - Blum - 1982 DBLP
31 Digitalized signatures (context) - Rabin - 1978
31 How to sign given any trapdoor function (context) - Bellare, Micali - 1988 ACM DBLP
29 Independent unbiased coin flips from a correlated biased sou.. (context) - Blum - 1984 DBLP
29 How to generate factored random numbers (context) - Bach - 1988 ACM DBLP
26 Two remarks concerning the Goldwasser-Micali-Rivest signatur.. - Goldreich - 1986 ACM DBLP
25 Probabilistic encryption and how to play mental poker keepin.. (context) - Goldwasser, Micali - 1982 DBLP
24 A cryptanalytic time-memory trade off (context) - Hellman - 1980
23 How to construct pseudorandom permutations and pseudorandom .. (context) - Luby, Rackoff - 1988
23 Efficient and secure pseudo-random number generation (context) - Vazirani, Vazirani - 1984 ACM DBLP
22 Digitalized Signatures as Intractable as Factorization (context) - Rabin - 1979
22 Mental poker (context) - Shamir, Rivest et al. - 1981
22 Towards a strong communication complexity theory (context) - Vazirani - 1985
22 Demonstrating that a public predicate can be satisfied witho.. (context) - Chaum - 1987 ACM DBLP
21 Reconstructing truncated integer variables satisfying linear.. (context) - Frieze, Hastad et al. - 1988 ACM DBLP
21 A private interactive test of a boolean predicate and minimu.. (context) - Galil, Haber et al. - 1985
21 How to expose an eavesdropper (context) - Rivest, Shamir - 1984 ACM DBLP
21 Why and how to establish a private code on a public network (context) - Goldwasser, Micali et al. - 1982
19 Provable Security of Cryptosystems: A Survey (context) - Angluin, Lichtenstein - 1983
19 A pipeline architecture for factoring large integers with th.. (context) - Pomerance, Smith et al. - 1988 ACM DBLP
19 How to simultaneously exchange a secret bit by flipping a sy.. (context) - Luby, Micali et al. - 1983
19 On taking roots in finite fields (context) - Adleman, Manders et al. - 1977 DBLP
18 Limits on the security of coin flips when half the processor.. (context) - Cleve - 1986 ACM
17 Cipher Systems: The Protection of Communications (context) - Beker, Piper - 1982
16 Multiuser cryptographic techniques (context) - Diffie, Hellman - 1976
16 Breaking iterated knapsacks (context) - Brickell - 1985 ACM DBLP
15 Polynomial factorization and non-randomness of bits of algeb.. (context) - Kannan, Lenstra et al. - 1984
14 Cryptanalytic attacks on the multiplicative knapsack scheme .. - Odlyzko - 1984
14 Strong signature schemes (context) - Goldwasser, Micali et al. - 1983 ACM DBLP
14 A pseudo-random bit generator based on elliptic logarithms (context) - Kaliski - 1987 ACM DBLP
14 Inferring a sequence generated by a linear congruence (context) - Plumstead - 1982 DBLP
14 A provably secure oblivious transfer protocol (context) - Berger, Peralta et al. - 1985 ACM DBLP
13 How to exchange (context) - Blum - 1983
13 How to swindle Rabin (context) - Yuval - 1979
13 A user authentication scheme not requiring secrecy in the co.. (context) - Evans, Kantrowitz et al. - 1974 ACM DBLP
12 Elliptic Curves and Cryptography: A Pseudorandom Bit Generat.. (context) - Kaliski - 1988
12 On breaking generalized knapsack public key cryptosystems (context) - Adleman - 1983 ACM
12 How to cheat at mental poker (context) - Lipton - 1981
12 Pseudo-random permutation generators and cryptographic compo.. (context) - Luby, Rackoff - 1986 ACM DBLP
12 A Public-Key System Based on Algebraic Coding Theory (context) - McEliece - 1978
11 Foundations of Secure Computation (context) - DeMillo, Dobkin et al. - 1978 ACM
11 Fundamentals of Number Theory (context) - LeVeque - 1977
10 A fair protocol for signing contracts (context) - Ben-Or, Goldreich et al. - 1985
10 Completeness theorems for fault-tolerant distributed computi.. (context) - Ben-Or, Goldwasser et al. - 1988
9 Lecture notes on the complexity of some problems in number t.. (context) - Angluin - 1982
9 The efficient construction of an unbiased random sequence (context) - Elias - 1972
8 An extension of the Shannon theory approach to cryptography (context) - Hellman - 1977
8 Evaluating logarithms in GF (context) - Coppersmith - 1984
8 the power of cascade ciphers (context) - Even, Goldreich - 1985
7 The mathematics of public key cryptography (context) - Hellman - 1979
7 Relativized cryptography (context) - Brassard - 1979 ACM DBLP
6 keyless cryptography (context) - Alpern, Schneider et al. - 1983
6 Cheating at mental poker (context) - Coppersmith - 1987 ACM DBLP
5 the cryptographic security of single RSA bits (context) - Ben-Or, Chor et al. - 1983
5 An analog scrambling scheme which does not expand bandwidth (context) - Wyner - 1979
5 An analog scrambling scheme which does not expand bandwidth (context) - Wyner - 1979
4 space tradeoff for certain NP-complete problems (context) - Schroeppel, Shamir et al. - 1979
4 Announcing the Data Encryption Standard (context) - of - 1977
4 and Public Key Systems (context) - Merkle, Authentication - 1979
4 Trapdoor pseudo-random number generators (context) - Vazirani, Vazirani - 1983
3 results of more cycling experiments on DES (context) - Kaliski, Rivest et al. - 1986
3 The discrete logarithm problem hides O (context) - Long, Wigderson - 1988
3 Cryptanalysis: A Study of Ciphers and Their Solutions (context) - Gaines - 1956
3 The American Mathematical Monthly (context) - Dixon, primality - 1984
2 Spread Spectrum Communications (context) - Gerhardt, Dixon - 1977
2 Intercept: The Enigma War (context) - Garli'nski - 1979
2 Tutorial: The Security of Data in Networks (context) - Davies - 1981
2 Various techniques for use in connection with random digits (context) - von Neumann - 1963
2 Dicrete logarithms in GF (context) - Coppersmith, Odlyzko et al. - 1986
2 The Ultra Secret (context) - Winterbotham - 1975
2 America's Most Secret Agency (context) - Bamford, Palace et al. - 1982
2 Published as National Physical Laboratories technical report.. (context) - Price, of - 1978
2 An Annotated Bibliography of Cryptography (context) - Bell, Olding - 1978
2 Data privacy: what Washington doesn't want you to know (context) - Sanders - 1981
2 An efficient algorithm for constructing a cryptosystem which.. (context) - Asmuth, Blakley - 1981
2 An introduction to cryptography (context) - Diffie, Hellman - 1984 ACM
2 Cryptography: Proceedings of the Workshop on Cryptography (context) - Goos, Hartmanis - 1983
2 average' instance (context) - Levin, complete - 1984
2 Cryptology in transition: a survey (context) - Lempel - 1979
1 Symmetric and asymmetric encryption (context) - Simmons - 1979 ACM DBLP
1 Published as MIT Laboratory for Computer Science Technical R.. (context) - Sherman, VLSI et al. - 1986
1 D'epartment d'informatique et de recherche op'erationelle (context) - Brassard, Modern et al. - 1987
1 the cryptocomplexity of knapsack schemes (context) - Shamir - 1979
1 Error-correcting codes and cryptography (context) - Sloane - 1981
1 Volume 69 of Selected Symposia (context) - Simmons, Communications et al. - 1982
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC