Handbook of Applied Cryptography

From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Proceedings of the Cambridge Philosophical Society , 2022 .

[3]  F. N. Cole.  On the factoring of large numbers , 1903 .

[4]  Lester S. Hill.  Cryptography in An Algebraic Alphabet , 1929 .

[5]  D. H. Lehmer.  Euclid's Algorithm for Large Numbers , 1938 .

[6]  A. Mood.  The Distribution Theory of Runs , 1940 .

[7]  F. S.,et al.  A Mathematician's Apology , 1941, Nature.

[8]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[9]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[10]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[11]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[12]  N. Ankeny.  The least quadratic non residue , 1952 .

[13]  I. Good.  The serial test for sampling numbers and other tests for randomness , 1953, Mathematical Proceedings of the Cambridge Philosophical Society.

[14]  M. Kendall.  Probability and Statistical Inference , 1956, Nature.

[15]  H. F. Gaines,et al.  Cryptanalysis: A Study of Ciphers and Their Solution , 1956 .

[16]  H. Garner.  The residue number system , 1959, IRE-AIEE-ACM '59 (Western).

[17]  George W. Reitwiesner,et al.  Binary Arithmetic , 1960, Adv. Comput..

[18]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[19]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[20]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[21]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[22]  E. Edwards..  Communication theory. , 1967, Ergonomics.

[23]  E. Berlekamp.  Factoring polynomials over finite fields , 1967 .

[24]  J. Stein.  Computational problems associated with Racah algebra , 1967 .

[25]  A. E. Western,et al.  Tables of indices and primitive roots , 1968 .

[26]  H. Davenport.  Bases for Finite Fields , 1968 .

[27]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[28]  Abraham Sinkov,et al.  Elementary Cryptanalysis: A Mathematical Approach , 1970 .

[29]  Neal Zierler,et al.  On Primitive Trinomials (Mod 2) , 1968, Inf. Control..

[30]  Neal Zierler,et al.  Primitive Trinomials Whose Degree is a Mersenne Exponent , 1969, Inf. Control..

[31]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[32]  P. Elias.  The Efficient Construction of an Unbiased Random Sequence , 1972 .

[33]  Wayne Stahnke.  Primitive binary polynomials , 1973 .

[34]  Lance J. Hoffman,et al.  Modern methods for computer security and privacy , 1973 .

[35]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[36]  Edwin Weiss,et al.  A user authentication scheme not requiring secrecy in the computer , 1974, Commun. ACM.

[37]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[38]  J. M. Pollard,et al.  Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.

[39]  George B. Purdy,et al.  A high security log-in procedure , 1974, Commun. ACM.

[40]  Wayne G. Barker.  Cryptanalysis of the Hagelin cryptograph , 1975 .

[41]  Arnold Schönhage,et al.  A Lower Bound for the Length of Addition Chains , 1975, Theor. Comput. Sci..

[42]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[43]  D. Branstad.  Encryption Protection in Computer Data Communications , 1975 .

[44]  D. H. Lehmer,et al.  New primality criteria and factorizations of 2^{}±1 , 1975 .

[45]  J. Brillhart,et al.  A method of factoring and the factorization of , 1975 .

[46]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[47]  J.L. Smith,et al.  Some cryptographic techniques for machine-to-machine data communications , 1975, Proceedings of the IEEE.

[48]  Whitfield Diffie,et al.  Multiuser cryptographic techniques , 1976, AFIPS '76.

[49]  Gary L. Miller.  Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[50]  J. Gordon.  Very simple method to find the minimum polynomial of an arbitrary nonzero element of a finite field , 1976 .

[51]  S. Kent.  ENCRYPTION-BASED PROTECTION PROTOCOLS FOR INTERACTIVE USER-COMPUTER COMMUNICATION , 1976 .

[52]  Donald E. Knuth,et al.  Analysis of a Simple Factorization Algorithm , 1976, Theor. Comput. Sci..

[53]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[54]  Andrew Chi-Chih Yao,et al.  On the Evaluation of Powers , 1976, SIAM J. Comput..

[55]  Edwin L. Key,et al.  An analysis of the structure and complexity of nonlinear binary sequence generators , 1976, IEEE Trans. Inf. Theory.

[56]  Vera Pless,et al.  Encryption Schemes for Computer Confidentiality , 1977, IEEE Transactions on Computers.

[57]  Martin E. Hellman,et al.  An extension of the Shannon theory approach to cryptography , 1977, IEEE Trans. Inf. Theory.

[58]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[59]  David Y. Y. Yun.  Fast Algorithm for Rational Function Integration , 1977, IFIP Congress.

[60]  Jason Gait,et al.  A New Nonlinear Pseudorandom Number Generator , 1977, IEEE Transactions on Software Engineering.

[61]  Chung-Kwong Yuen.  Testing Random Number Generators by Walsh Transform , 1977, IEEE Transactions on Computers.

[62]  Stephen M. Matyas,et al.  A Cryptographic Key Management Scheme for Implementing the Data Encryption Standard , 1978, IBM Syst. J..

[63]  Thomas M. Cover,et al.  A convergent gambling estimate of the entropy of English , 1978, IEEE Trans. Inf. Theory.

[64]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[65]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[66]  P. J. Green,et al.  Probability and Statistical Inference , 1978 .

[67]  M. Newman,et al.  Topics in Algebra , 1978 .

[68]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[69]  Adi Shamir.  A Fast Signature Scheme , 1978 .

[70]  C. Campbell.  Design and specification of cryptographic capabilities , 1978, IEEE Communications Society Magazine.

[71]  A. Shimizu,et al.  Fast data encipherment algorithm FEAL-8 , 1978 .

[72]  Roger M. Needham,et al.  Using encryption for authentication in large networks of computers , 1978, CACM.

[73]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[74]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[75]  G. Blakley,et al.  Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages , 1979 .

[76]  Ken Thompson,et al.  Password security: a case history , 1979, CACM.

[77]  Frank Rubin,et al.  Decrypting a Stream Cipher Based on J-K Flop-Flops , 1979, IEEE Trans. Computers.

[78]  John B. Kam,et al.  Structured Design of Substitution-Permutation Encryption Networks , 1979, IEEE Transactions on Computers.

[79]  Stephen M. Matyas.  Digital Signatures - An Overview , 1979, Comput. Networks.

[80]  Gideon Yuval,et al.  How to Swindle Rabin , 1979, Cryptologia.

[81]  Gerald J. Popek,et al.  Encryption and Secure Computer Networks , 1979, CSUR.

[82]  Donald R. Smith,et al.  Universal fixed messages and the Rivest-Shamir-Adleman cryptosystem , 1979 .

[83]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[84]  Leonard M. Adleman,et al.  A subexponential algorithm for the discrete logarithm problem with applications to cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[85]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[86]  Hugh C. Williams,et al.  A modification of the RSA public-key encryption procedure (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[87]  Richard P. Brent,et al.  An improved Monte Carlo factorization algorithm , 1980 .

[88]  Yacov Yacobi,et al.  Cryptocomplexity and NP-Completeness , 1980, ICALP.

[89]  Earl E. Swartzlander,et al.  Computer Arithmetic , 1980 .

[90]  Louis Monier,et al.  Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms , 1980, Theor. Comput. Sci..

[91]  J. D. Lipson.  Elements of algebra and algebraic computing , 1981 .

[92]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[93]  Danny Dolev,et al.  On the Security of Public Key Protocols (Extended Abstract) , 1981, FOCS.

[94]  J. Dixon.  Asymptotically fast factorization of integers , 1981 .

[95]  Frank Rubin,et al.  Decrypting a Stream Cipher Based on j-k Flip-Flops , 1981, Cryptologia.

[96]  Michael Ben-Or,et al.  Probabilistic algorithms in finite fields , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[97]  Jorge Olivos.  On Vectorial Addition Chains , 1981, J. Algorithms.

[98]  M. Smid.  Integrating the Data Encryption Standard into Computer Networks , 1981, IEEE Trans. Commun..

[99]  R. Brent,et al.  Factorization of the eighth Fermat number , 1981 .

[100]  D. Cantor,et al.  A new algorithm for factoring polynomials over finite fields , 1981 .

[101]  Peter J. Downey,et al.  Computing Sequences with Addition Chains , 1981, SIAM J. Comput..

[102]  Giovanni Maria Sacco,et al.  Timestamps in key distribution protocols , 1981, CACM.

[103]  Justin M. Reyneri,et al.  Fast Computation of Discrete Logarithms in GF(q) , 1982, CRYPTO.

[104]  Manuel Blum,et al.  How to Generate Cryptographically Strong Sequences of Pseudo Random Bits , 1982, FOCS.

[105]  S. M. Jennings,et al.  Multiplexed Sequences: Some Properties of the Minimum Polynomial , 1982, EUROCRYPT.

[106]  Ronald L. Rivest,et al.  Randomized Encryption Techniques , 1982, CRYPTO.

[107]  Silvio Micali,et al.  Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.

[108]  Richard G. Larson,et al.  On a Primality Test of Solovay and Strassen , 1982, SIAM J. Comput..

[109]  J. Boyar.  Inferring a Sequence Generated by a Linear Congruence , 1982, FOCS.

[110]  Henry Beker,et al.  Cipher Systems: The Protection of Communications , 1982 .

[111]  Rolf Blom,et al.  Non-Public Key Distribution , 1982, CRYPTO.

[112]  Donald W. Davies,et al.  The average Cycle size of the Key-Stream in Output Feedback Encipherment , 1982, EUROCRYPT.

[113]  Andrew Chi-Chih Yao,et al.  The Complexity of Finding Cycles in Periodic Functions , 1982, SIAM J. Comput..

[114]  Dorothy E. Denning,et al.  Cryptography and Data Security , 1982 .

[115]  R. R. Jueneman,et al.  Analysis of Certain Aspects of Output Feedback Mode , 1982, CRYPTO.

[116]  Manuel Blum,et al.  Comparison of Two Pseudo-Random Number Generators , 1982, CRYPTO.

[117]  Donald W. Davies.  Some Regular Properties of the 'Data Encryption Standard' Algorithm , 1982, CRYPTO.

[118]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[119]  Chak-Kuen Wong,et al.  A conference key distribution system , 1982, IEEE Trans. Inf. Theory.

[120]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[121]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[122]  P. Erdös,et al.  On a problem of Oppenheim concerning “factorisatio numerorum” , 1983 .

[123]  Jack B. Dennis,et al.  Programming semantics for multiprogrammed computations , 1966, CACM.

[124]  Rudolf Lidl,et al.  Permutation Polynomials in RSA-Cryptosystems , 1983, CRYPTO.

[125]  Thomas A. Berson,et al.  A key distribution protocol using event markers , 1983, TOCS.

[126]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[127]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[128]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1983, J. Algorithms.

[129]  L. Adleman,et al.  On distinguishing prime numbers from composite numbers , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[130]  Gustavus J. Simmons,et al.  A "Weak" Privacy Protocol using the RSA Crypto Algorithm , 1983, Cryptologia.

[131]  Rudolf Lide,et al.  Finite fields , 1983 .

[132]  Richard A. Games,et al.  A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.

[133]  Stephen M. Matyas,et al.  Message Authentication with Manipulation Detection Code , 1983, 1983 IEEE Symposium on Security and Privacy.

[134]  Stephen T. Kent,et al.  Security Mechanisms in High-Level Network Protocols , 1983, CSUR.

[135]  J. Gerver.  Factoring large numbers with a quadratic sieve , 1983 .

[136]  Selim G. Akl,et al.  On the Security of Compressed Encodings , 1983, CRYPTO.

[137]  Jeffrey C. Lagarias,et al.  Knapsack Public Key Cryptosystems and Diophantine Approximation , 1983, CRYPTO.

[138]  S. Vanstone,et al.  Computing Logarithms in Finite Fields of Characteristic Two , 1984 .

[139]  Vijay V. Vazirani,et al.  Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) , 1984, FOCS.

[140]  Adi Shamir,et al.  An efficient signature scheme based on quadratic equations , 1984, STOC '84.

[141]  Ronald L. Rivest,et al.  A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields , 1984, CRYPTO.

[142]  R. C. Fairfield,et al.  An LSI Random Number Generator (RNG) , 1985, CRYPTO.

[143]  Don Coppersmith,et al.  Fast evaluation of logarithms in fields of characteristic two , 1984, IEEE Trans. Inf. Theory.

[144]  John M. DeLaurentis,et al.  A Further Weakness in the Common Modulus Protocol for the RSA Cryptoalgorithm , 1984, Cryptologia.

[145]  Robert S. Winternitz.  A Secure One-Way Hash Function Built from DES , 1984, 1984 IEEE Symposium on Security and Privacy.

[146]  Manuel Blum,et al.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..

[147]  Catherine A. Meadows,et al.  Security of Ramp Schemes , 1985, CRYPTO.

[148]  Adi Shamir,et al.  How to expose an eavesdropper , 1984, CACM.

[149]  W E Madryga,et al.  A high performance encryption algorithm , 1984 .

[150]  Thomas Siegenthaler,et al.  Correlation-immunity of nonlinear combining functions for cryptographic applications , 1984, IEEE Trans. Inf. Theory.

[151]  Andrew M. Odlyzko,et al.  Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme , 1984, IEEE Trans. Inf. Theory.

[152]  Rainer A. Rueppel,et al.  Linear Ciphers and Random Sequence Generators with Multiple Clocks , 1985, EUROCRYPT.

[153]  E. Bach.  Discrete Logarithms and Factoring , 1984 .

[154]  A. Taher.  Cryptography and logarithms over finite fields , 1984 .

[155]  Michael Walker,et al.  Key Management for Secure Electronic Funds Transfer in a Retail Environment , 1985, CRYPTO.

[156]  Manuel Blum,et al.  An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information , 1985, CRYPTO.

[157]  Silvio Micali,et al.  A "Paradoxical" Solution to the Signature Problem (Extended Abstract) , 1984, FOCS.

[158]  Herbert S. Wilf,et al.  Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem , 1984, Inf. Process. Lett..

[159]  Jack Levine.  Corrections for Published Copy of United States Cryptographic patents: 1861-1981 , 1984, Cryptologia.

[160]  Norman Proctor,et al.  A Self-Synchronizing Cascaded Cipher System With Dynamic Control of Error-Propagation , 1985, CRYPTO.

[161]  Stafford E. Tavares,et al.  On the Design of S-Boxes , 1985, CRYPTO.

[162]  Gustavus J. Simmons,et al.  Status report on factoring (at the Sandia National Labs) , 1985 .

[163]  René Peralta,et al.  Simultaneous Security of Bits in the Discrete Log , 1985, EUROCRYPT.

[164]  Abraham Bookstein,et al.  Cryptography: A new dimension in computer data security ? and ?. Wiley-Interscience, New York (1982). xxi + 775 pp., $43.95. ISBN 0471-04892-5. , 1985 .

[165]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[166]  Charles Cresson Wood,et al.  Security for computer networks : D.W. Davies and W.L. Price New York: John Wiley and Sons, 1984. 386 + xix pages, $19.50 , 1985, Computers & security.

[167]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[168]  B. S. Adiga,et al.  Fast algorithms for implementing RSA public key cryptosystem , 1985 .

[169]  Yvo Desmedt,et al.  A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes , 1986, CRYPTO.

[170]  A. K. Lenstra,et al.  Implementation of a New Primality Test , 1985 .

[171]  D. Gollman.  Pseudo random properties of cascade connections of clock controlled shift registers , 1985 .

[172]  Ernest F. Brickell,et al.  An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi , 1985, CRYPTO.

[173]  Stephen Wolfram.  Cryptography with Cellular Automata , 1985, CRYPTO.

[174]  Oded Goldreich,et al.  On the power of cascade ciphers , 1985, TOCS.

[175]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[176]  Winfried B. Müller,et al.  Cryptanalysis of the Dickson Scheme , 1985, EUROCRYPT.

[177]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[178]  Jeffrey Shallit,et al.  Factoring with cyclotomic polynomials , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[179]  Gary L. Miller,et al.  Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields , 1986, CRYPTO.

[180]  Friedrich Otto,et al.  The Verifiability of Two-Party Protocols , 1985, EUROCRYPT.

[181]  Graham H. Norton.  Extending the Binary GCD Algorithm , 1985, AAECC.

[182]  David Chaum,et al.  Attacks on Some RSA Signatures , 1985, CRYPTO.

[183]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[184]  Tatsuski Okamoto,et al.  A Fast Signature Scheme Based on Quadratic Inequalities , 1985, 1985 IEEE Symposium on Security and Privacy.

[185]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[186]  Yvo Desmedt,et al.  Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences , 1985, CRYPTO.

[187]  Paul Barrett,et al.  Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor , 1986, CRYPTO.

[188]  Zongduo Dai.  Proof of Rueppel's linear complexity conjecture , 1986, IEEE Trans. Inf. Theory.

[189]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[190]  Joe Kilian,et al.  Almost all primes can be quickly certified , 1986, STOC '86.

[191]  John Shawe-Taylor,et al.  Generating strong primes , 1986 .

[192]  P. Erdös,et al.  On the number of false witnesses for a composite number , 1986 .

[193]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[194]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[195]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[196]  Evangelos Kranakis.  Primality and cryptography , 1986, Wiley-Teubner series in computer science.

[197]  David Chaum,et al.  Demonstrating Possession of a Discrete Logarithm Without Revealing It , 1986, CRYPTO.

[198]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[199]  Michel Ugon,et al.  Smart Card, a Highly Reliable and Portable Security Device , 1986, CRYPTO.

[200]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[201]  Oded Goldreich,et al.  Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme , 1986, CRYPTO.

[202]  Gilles Brassard,et al.  Zero-Knowledge Simulation of Boolean Circuits , 1986, CRYPTO.

[203]  Michael Luby,et al.  Pseudo-random permutation generators and cryptographic composition , 1986, STOC '86.

[204]  Rainer A. Rueppel,et al.  Products of linear recurring sequences with maximum complexity , 1987, IEEE Trans. Inf. Theory.

[205]  Christoph Günther,et al.  Alternating Step Generators Controlled by De Bruijn Sequences , 1987, EUROCRYPT.

[206]  Ivan Damgård,et al.  Collision Free Hash Functions and Public Key Signature Schemes , 1987, EUROCRYPT.

[207]  H. Lenstra,et al.  Primitive normal bases for finite fields , 1987 .

[208]  Martin Tompa,et al.  Random self-reducibility and zero knowledge interactive proofs of possession of information , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[209]  Samy Bengio,et al.  Special Uses and Abuses of the Fiat-Shamir Passport Protocol , 1987, CRYPTO.

[210]  Tatsuaki Okamoto.  A single public-key authentication scheme for multiple users , 1987, Systems and Computers in Japan.

[211]  Robert D. Silverman.  The multiple polynomial quadratic sieve , 1987 .

[212]  Ernest F. Brickell,et al.  Secure Audio Teleconference , 1987, CRYPTO.

[213]  M. Kimberley.  Comparison of two statistical tests for keystream sequences , 1987 .

[214]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[215]  Hideki Imai,et al.  On the Key Predistribution System: A Practical Solution to the Key Distribution Problem , 1987, CRYPTO.

[216]  Claus-Peter Schnorr,et al.  An efficient solution of the congruence x2+ky2=mpmod{n} , 1987, IEEE Trans. Inf. Theory.

[217]  Silvio Micali,et al.  Non-Interactive Zero-Knowledge Proof Systems , 1987, CRYPTO.

[218]  David Chaum,et al.  An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations , 1987, EUROCRYPT.

[219]  Xuejia Lai,et al.  Condition for the nonsingularity of a feedback shift-register over a general finite field , 1987, IEEE Trans. Inf. Theory.

[220]  Leonard M. Adleman,et al.  Open Problems in Number Theoretic Complexity , 1987 .

[221]  Heather Woll,et al.  Reductions among Number Theoretic Problems , 1987, Inf. Comput..

[222]  조위덕.  Cryptography , 1987, The Official (ISC)2 SSCP CBK Reference.

[223]  Gustavus J. Simmons,et al.  Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys , 1987, IEEE Transactions on Software Engineering.

[224]  John Linn,et al.  Privacy enhancement for Internet electronic mail: Part I: Message encipherment and authentication procedures , 1989, RFC.

[225]  Owen Rees,et al.  Efficient and timely mutual authentication , 1987, OPSR.

[226]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[227]  Gordon B. Agnew,et al.  Random Sources for Cryptographic Systems , 1987, EUROCRYPT.

[228]  Frank A. Feldman.  Fast Spectral Tests for Measuring Nonrandomness and the DES , 1987, CRYPTO.

[229]  Marc Girault,et al.  Hash-Functions Using Modulo-N Operations , 1987, EUROCRYPT.

[230]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[231]  Jacques Stern,et al.  Secret linear congruential generators are not cryptographically secure , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[232]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[233]  Jeroen van de Graaf,et al.  A Simple and Secure Way to Show the Validity of Your Public Key , 1987, CRYPTO.

[234]  Ernest F. Brickell,et al.  An Observation on the Security of McEliece's Public-Key Cryptosystem , 1988, EUROCRYPT.

[235]  Harald Niederreiter,et al.  The Probabilistic Theory of Linear Complexity , 1988, EUROCRYPT.

[236]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[237]  W. G. Chambers.  Clock-controlled shift registers in binary sequence generators , 1988 .

[238]  Thomas Beth,et al.  Efficient Zero-Knowledge Identification Scheme for Smart Cards , 1988, EUROCRYPT.

[239]  J. H. Moore.  Protocol failures in cryptosystems , 1988, Proc. IEEE.

[240]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[241]  B. Clifford Neuman,et al.  Kerberos: An Authentication Service for Open Network Systems , 1988, USENIX Winter.

[242]  Marc Girault,et al.  A Generalized Birthday Attack , 1988, EUROCRYPT.

[243]  Hugo Krawczyk,et al.  On the existence of pseudorandom generators , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[244]  Johan Håstad,et al.  Solving Simultaneous Modular Equations of Low Degree , 1988, SIAM J. Comput..

[245]  Kaoru Kurosawa,et al.  Public Key Cryptosystem using a reciprocal number with the same Intractability as Factoring a Large number , 1983, Cryptologia.

[246]  Manuel Blum,et al.  Non-interactive zero-knowledge and its applications , 1988, STOC '88.

[247]  Amos Fiat,et al.  Untraceable Electronic Cash , 1990, CRYPTO.

[248]  Bert den Boer.  Cryptanalysis of F.E.A.L , 1988, EUROCRYPT.

[249]  Kencheng Zeng,et al.  On the Linear Syndrome Method in Cryptanalysis , 1988, CRYPTO.

[250]  Silvio Micali,et al.  How To Sign Given Any Trapdoor Function , 1988, CRYPTO.

[251]  Whitfield Diffie.  The first ten years of public-key cryptography , 1988 .

[252]  Alan M. Frieze,et al.  Reconstructing Truncated Integer Variables Satisfying Linear Congruences , 1988, SIAM J. Comput..

[253]  Dominic J. A. Welsh,et al.  Codes and cryptography , 1988 .

[254]  E. Brickell,et al.  Cryptanalysis: a survey of recent results , 1988, Proc. IEEE.

[255]  Silvio Micali,et al.  The Notion of Security for Probabilistic Cryptosystems , 1986, CRYPTO.

[256]  Whitfield Diffie,et al.  A Secure Audio Teleconference System , 1988, CRYPTO.

[257]  Avi Wigderson,et al.  The Discrete Logarithm Hides O(log n) Bits , 1988, SIAM J. Comput..

[258]  Adi Shamir,et al.  An Improvement of the Fiat-Shamir Identification and Signature Scheme , 1988, CRYPTO.

[259]  Victor Shoup,et al.  New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[260]  K. Ohta,et al.  Practical extension of Fiat-Shamir scheme , 1988 .

[261]  Hans-Joachim Knobloch,et al.  A Smart Card Implementation of the Fiat-Shamir Identification Scheme , 1988, EUROCRYPT.

[262]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[263]  Ueli Maurer,et al.  Perfect Local Randomness in Pseudo-Random Sequences , 1989, CRYPTO.

[264]  Frans M. J. Willems,et al.  Universal data compression and repetition times , 1989, IEEE Trans. Inf. Theory.

[265]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[266]  David C. Feldmeier,et al.  UNIX Password Security - Ten Years Later , 1989, CRYPTO.

[267]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..

[268]  Jean-Jacques Quisquater,et al.  How Easy is Collision Search? Application to DES (Extended Summary) , 1990, EUROCRYPT.

[269]  Réjane Forré,et al.  A Fats Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences , 1990, EUROCRYPT.

[270]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[271]  C. Mitchell,et al.  Minimum weight modified signed-digit representations and fast exponentiation , 1989 .

[272]  James Lee Hafner,et al.  On the Distribution of Running Times of Certain Integer Factoring Algorithms , 1989, J. Algorithms.

[273]  Jerome H. Saltzer,et al.  Reducing risks from poorly chosen keys , 1989, SOSP '89.

[274]  C. Pomerance,et al.  The probability that a random probable prime is composite , 1989 .

[275]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[276]  James L. Massey,et al.  An Information-Theoretic Treatment of Homophonic Substitution , 1990, EUROCRYPT.

[277]  Ueli Maurer,et al.  Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity , 1990, EUROCRYPT.

[278]  Eiji Okamoto,et al.  Key distribution system based on identification information , 1989, IEEE J. Sel. Areas Commun..

[279]  Philippe Flajolet,et al.  Random Mapping Statistics , 1990, EUROCRYPT.

[280]  Hans-Joachim Knobloch,et al.  How to Keep Authenticity Alive in a Computer Network , 1990, EUROCRYPT.

[281]  Thomas Beth,et al.  On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random , 1990, EUROCRYPT.

[282]  Chi-Sung Laih,et al.  Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space , 1989, CRYPTO.

[283]  Matthijs J. Coster,et al.  Addition Chain Heuristics , 1989, CRYPTO.

[284]  John T. Kohl.  The use of Encryption in Kerberos for Network Authentication , 1989, CRYPTO.

[285]  Martín Abadi,et al.  A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[286]  Arjen K. Lenstra,et al.  Factoring by Electronic Mail , 1990, EUROCRYPT.

[287]  L. Gong,et al.  Using one-way functions for authentication , 1989, CCRV.

[288]  Natsume Matsuzaki,et al.  Key Distribution Protocol for Digital Mobile Communication Systems , 1989, CRYPTO.

[289]  Moni Naor,et al.  Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.

[290]  Chung-Huang Yang,et al.  On the Linear Consistency Test (LCT) in Cryptanalysis with Applications , 1989, CRYPTO.

[291]  Y. Desmedt,et al.  Remarks on soundness of proofs (zero-knowledge schemes) , 1989 .

[292]  Jean-Jacques Quisquater,et al.  2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms , 1990, EUROCRYPT.

[293]  Silvio Micali,et al.  On-Line/Off-Line Digital Schemes , 1989, CRYPTO.

[294]  Michaël Quisquater,et al.  How to Explain Zero-Knowledge Protocols to Your Children , 1989, CRYPTO.

[295]  John Linn,et al.  Privacy enhancement for Internet electronic mail: Part III - algorithms, modes, and identifiers , 1989, RFC.

[296]  Yacov Yacobi,et al.  On Key Distribution Systems , 1989, CRYPTO.

[297]  Dieter Gollmann,et al.  Clock-controlled shift registers: a review , 1989, IEEE J. Sel. Areas Commun..

[298]  David M. Bressoud.  Factorization and Primality Testing , 1989 .

[299]  John Rompel,et al.  One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.

[300]  J. Olivos,et al.  Speeding up the computations on an elliptic curve using addition-subtraction chains , 1990, RAIRO Theor. Informatics Appl..

[301]  S. Vanstone,et al.  Improved digital signature scheme based on discrete exponentiation , 1990 .

[302]  S. Goldwasser.  The Search for Provably Secure Cryptosystems , 1990 .

[303]  Jean-Jacques Quisquater,et al.  Better Login Protocols for Computer Networks , 1990, ESORICS.

[304]  Gustavus J. Simmons,et al.  A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party , 1991, EUROCRYPT.

[305]  Arto Salomaa,et al.  Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.

[306]  Paul C. van Oorschot,et al.  A Known Plaintext Attack on Two-Key Triple Encryption , 1991, EUROCRYPT.

[307]  Xuejia Lai,et al.  A Proposal for a New Block Encryption Standard , 1991, EUROCRYPT.

[308]  Shoji Miyaguchi,et al.  The FEAL Cipher Family , 1990, CRYPTO.

[309]  Burton S. Kaliski,et al.  A Cryptographic Library for the Motorola DSP56000 , 1991, EUROCRYPT.

[310]  Jovan Dj. Golic,et al.  A Fast Iterative Algorithm For A Shift Register Initial State Reconstruction Given The Nosiy Output Sequence , 1990, AUSCRYPT.

[311]  Willi Meier,et al.  Cryptographic Significance of the Carry for Ciphers Based on Integer Addition , 1990, CRYPTO.

[312]  Claus-Peter Schnorr,et al.  Fast Signature Generation With a Fiat Shamir-Like Scheme , 1991, EUROCRYPT.

[313]  Hugo Krawczyk,et al.  On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.

[314]  Adi Shamir,et al.  Witness indistinguishable and witness hiding protocols , 1990, STOC '90.

[315]  Li Gong,et al.  Reasoning about belief in cryptographic protocols , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[316]  Paul C. van Oorschot.  A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms , 1990, CRYPTO.

[317]  Robert D. Silverman,et al.  AN FFT EXTENSION TO THE P - 1 FACTORING ALGORITHM , 1990 .

[318]  Yacov Yacobi.  A Key Distribution "Paradox" , 1990, CRYPTO.

[319]  Walter Fumy,et al.  A Modular Approach to Key Distribution , 1990, CRYPTO.

[320]  Jennifer Seberry,et al.  LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications , 1990, AUSCRYPT.

[321]  David Chaum,et al.  Convertible Undeniable Signatures , 1990, CRYPTO.

[322]  Henri Gilbert,et al.  A Statistical Attack of the FEAL-8 Cryptosystem , 1990, CRYPTO.

[323]  Moti Yung,et al.  On the Design of Provably Secure Cryptographic Hash Functions , 1991, EUROCRYPT.

[324]  Adi Shamir,et al.  On the Universality of the Next Bit Test , 1990, CRYPTO.

[325]  Michael J. Wiener,et al.  Cryptanalysis of Short RSA Secret Exponents (Abstract) , 1990, EUROCRYPT.

[326]  François Morain,et al.  Distributed Primality Proving and the Primality of (23539+1)/3 , 1991, EUROCRYPT.

[327]  Johannes A. Buchmann,et al.  On the Computation of Discrete Logarithms in Class Groups , 1990, CRYPTO.

[328]  Cees J. A. Jansen,et al.  On the Significance of the Directed Acyclic Word Graph in Cryptology , 1990, AUSCRYPT.

[329]  Chris Mitchell,et al.  Security defects in CCITT recommendation X.509: the directory authentication framework , 1990, CCRV.

[330]  Jeffrey Shallit,et al.  On the Worst Case of Three Algorithms for Computing the Jacobi Symbol , 1990, J. Symb. Comput..

[331]  J. K. Gibson.  Some comments on Damgard's hashing principle , 1990 .

[332]  Don Davis,et al.  Network security via private-key certificates , 1990, OPSR.

[333]  Eli Biham,et al.  Differential cryptanalysis of DES-like cryptosystems , 1990, Journal of Cryptology.

[334]  Chung-wu Ho,et al.  A Fast Algorithm of the Chinese Remainder Theorem and ITS Application to Fibonacci Numbers , 1991 .

[335]  Chung-Huang Yang,et al.  Pseudorandom bit generators in stream-cipher cryptography , 1991, Computer.

[336]  Moni Naor,et al.  Non-malleable cryptography , 1991, STOC '91.

[337]  David Chaum,et al.  Group Signatures , 1991, EUROCRYPT.

[338]  Daniel R. Simon,et al.  Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.

[339]  David Chaum,et al.  Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer , 1991, CRYPTO.

[340]  Valery I. Korzhik,et al.  Cryptanalysis of McEliece's Public-Key Cryptosystem , 1991, EUROCRYPT.

[341]  Amos Fiat,et al.  Rigorous time/space tradeoffs for inverting functions , 1991, STOC '91.

[342]  Bruce W. Char,et al.  Maple V Library Reference Manual , 1992, Springer New York.

[343]  Ernst M. Gabidulin,et al.  Ideals over a Non-Commutative Ring and thier Applications in Cryptology , 1991, EUROCRYPT.

[344]  Colin D. Walter.  Faster Modular Multiplication by Operand Scaling , 1991, CRYPTO.

[345]  Atsushi Fujioka,et al.  ESIGN: An Efficient Digital Signature Implementation for Smard Cards , 1991, EUROCRYPT.

[346]  Andrew M. Odlyzko,et al.  Computation of discrete logarithms in prime fields , 1991, Des. Codes Cryptogr..

[347]  Xuejia Lai,et al.  Markov Ciphers and Differential Cryptanalysis , 1991, EUROCRYPT.

[348]  Vladimir V. Chepyzhov,et al.  On A Fast Correlation Attack on Certain Stream Ciphers , 1991, EUROCRYPT.

[349]  Antoon Bosselaers,et al.  An Attack on the Last Two Rounds of MD4 , 1991, CRYPTO.

[350]  Peter de Rooij,et al.  On the Security of the Schnorr Scheme using Preprocessing , 1991, EUROCRYPT.

[351]  Joos Vandewalle,et al.  Cryptography Within Phase I of the EEC-RACE Programme , 1991, Computer Security and Industrial Cryptography.

[352]  Li-Fung Chang,et al.  Privacy and authentication on a portable communications system , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[353]  Sibylle Mund,et al.  Liv-Lempel Complexity for Periodic Sequences and its Cryptographic Application , 1991, EUROCRYPT.

[354]  J.J. Tardo,et al.  SPX: global authentication using public key certificates , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[355]  Mark R. Tuttle,et al.  A Semantics for a Logic of Authentication , 1991, PODC 1991.

[356]  Ivan Damgård,et al.  Speeding up Prime Number Generation , 1991, ASIACRYPT.

[357]  Tatsuaki Okamoto,et al.  New Public-Key Schemes Based on Elliptic Curves over the Ring Zn , 1991, CRYPTO.

[358]  Jinhui Chao,et al.  A New ID-Based Key Sharing System , 1991, CRYPTO.

[359]  Jennifer Seberry,et al.  Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI , 1991, ASIACRYPT.

[360]  Patrick Horster,et al.  Discrete Logarithm Based Protocols , 1991, EUROCRYPT.

[361]  Alain Guyot,et al.  OCAPI: architecture of a VLSI coprocessor for the GCD and the extended GCD of large numbers , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[362]  Shimshon Berkovits,et al.  How To Broadcast A Secret , 1991, EUROCRYPT.

[363]  Y. Kurita,et al.  Primitive t-Nomials(t=3,5)over GF(2) Whose Degree is a Mersenne Exponent≦44497 , 1991 .

[364]  Li Gong,et al.  Logics for cryptographic protocols-virtues and limitations , 1991, Proceedings Computer Security Foundations Workshop IV.

[365]  Lars R. Knudsen,et al.  Cryptanalysis of LOKI , 1991, ASIACRYPT.

[366]  Miodrag V. Zivkovic.  An algorithm for the initial state reconstruction of the clock-controlled shift register , 1991, IEEE Trans. Inf. Theory.

[367]  Bart Preneel,et al.  Standardization of Cryptographic Techniques , 1991, Computer Security and Industrial Cryptography.

[368]  Henri Gilbert,et al.  A Known Plaintext Attack of FEAL-4 and FEAL-6 , 1991, CRYPTO.

[369]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.

[370]  Klaus Vedder.  Security Aspects of Mobile Communications , 1991, Computer Security and Industrial Cryptography.

[371]  Zongduo Dai,et al.  Linear Complexity of Periodically Repeated Random Sequences , 1991, EUROCRYPT.

[372]  Jennifer Seberry,et al.  HAVAL - A One-Way Hashing Algorithm with Variable Length of Output , 1992, AUSCRYPT.

[373]  Yvo Desmedt,et al.  The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel) , 1992, EUROCRYPT.

[374]  Henri Gilbert,et al.  On the Security of the Permuted Kernel Identification Scheme , 1992, CRYPTO.

[375]  Moti Yung,et al.  Perfectly Secure Key Distribution for Dynamic Conferences , 1992, Inf. Comput..

[376]  Martín Abadi,et al.  Authentication in distributed systems: theory and practice , 1991, SOSP '91.

[377]  A. Menezes,et al.  Applications of Finite Fields , 1992 .

[378]  H. Lenstra,et al.  A rigorous time bound for factoring integers , 1992 .

[379]  David Chaum,et al.  Provably Unforgeable Signatures , 1992, CRYPTO.

[380]  Hugo Krawczyk.  How to Predict Congruential Generators , 1992, J. Algorithms.

[381]  Christian Waldvogel,et al.  The Probability Distribution of the Diffie-Hellman Key , 1992, AUSCRYPT.

[382]  Jovan Dj. Golic,et al.  Correlation via Linear Sequential Circuit Approximation of Combiners with memory , 1992, EUROCRYPT.

[383]  Christian Huitema,et al.  Associating Metrics to Certification Paths , 1992, ESORICS.

[384]  David Everett.  Identity verification and biometrics , 1992 .

[385]  Virgil D. Gligor,et al.  On message integrity in cryptographic protocols , 1992, Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy.

[386]  Andrew Klapper,et al.  The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic , 1992, AUSCRYPT.

[387]  Alexander Russell.  Necessary and Sufficient Conditions For Collision-Free Hashing , 1992, CRYPTO.

[388]  G. Mullen,et al.  Primitive polynomials over finite fields , 1992 .

[389]  Douglas R. Stinson,et al.  An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..

[390]  G. R. Blakley,et al.  Threshold Schemes with Disenrollment , 1992, CRYPTO.

[391]  Gustavus J. Simmons,et al.  The Smart Card: A Standardized Security Device Dedicated to Public Cryptology , 1992 .

[392]  Hans Eberle,et al.  A High-Speed DES Implementation for Network Applications , 1992, CRYPTO.

[393]  Ming-Deh A. Huang,et al.  Primality Testing and Abelian Varieties over Finite Fields , 1992 .

[394]  Michael J. Wiener,et al.  DES is not a Group , 1992, CRYPTO.

[395]  Kevin S. McCurley,et al.  Massively Parallel Computation of Discrete Logarithms , 1992, CRYPTO.

[396]  Eugène van Heyst,et al.  How to Make Efficient Fail-stop Signatures , 1992, EUROCRYPT.

[397]  Gene Tsudik,et al.  KryptoKnight Authentication and Key Distribution System , 1992, ESORICS.

[398]  Xuejia Lai,et al.  A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers , 1992, AUSCRYPT.

[399]  Gene Tsudik.  Message authentication with one-way hash functions , 1992, CCRV.

[400]  Gregory J. E. Rawlins.  Compared to what? - an introduction to the analysis of algorithms , 1992, Principles of computer science series.

[401]  Paul C. van Oorschot,et al.  Authentication and authenticated key exchanges , 1992, Des. Codes Cryptogr..

[402]  Ivan Damgård,et al.  On Generation of Probable Primes By Incremental Search , 1992, CRYPTO.

[403]  Daniel Klein,et al.  Foiling the cracker: A survey of, and improvements to, password security , 1992 .

[404]  Ed Dawson,et al.  Cryptanalysis of Summation Generator , 1992, AUSCRYPT.

[405]  Keith O. Geddes,et al.  Algorithms for computer algebra , 1992 .

[406]  Mitsuru Matsui,et al.  A New Method for Known Plaintext Attack of FEAL Cipher , 1992, EUROCRYPT.

[407]  Jürgen Schönwälder,et al.  A nonce-based protocol for multiple authentications , 1992, OPSR.

[408]  Mihir Bellare,et al.  On Defining Proofs of Knowledge , 1992, CRYPTO.

[409]  Peter C. Wayner,et al.  Content-Addressable Search Engines and DES-like Systems , 1992, CRYPTO.

[410]  P. Gács,et al.  Algorithms , 1992 .

[411]  Thomas Beth,et al.  Timely Authentication in Distributed Systems , 1992, ESORICS.

[412]  David Chaum,et al.  Wallet Databases with Observers , 1992, CRYPTO.

[413]  Daniel M. Gordon,et al.  Designing and Detecting Trapdoors for Discrete Log Cryptosystems , 1992, CRYPTO.

[414]  J. Couveignes.  Computing a square root for the number field sieve , 1993 .

[415]  Sung-Ming Yen,et al.  New digital signature scheme based on discrete logarithm , 1993 .

[416]  Walter Fumy,et al.  Placement of Cryptographic Key Distribution Within OSI: Design Alternatives and Assessment , 1993, Comput. Networks ISDN Syst..

[417]  Willi Meier,et al.  On the Security of the IDEA Block Cipher , 1994, EUROCRYPT.

[418]  Erich Kaltofen,et al.  Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems , 1993, AAECC.

[419]  Peter J. Smith,et al.  LUC: A New Public Key System , 1993, SEC.

[420]  Benjamin Arazi.  Integrating a key distribution procedure into the digital signature standard , 1993 .

[421]  Mark Shand,et al.  Fast implementations of RSA cryptography , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[422]  Alfredo De Santis,et al.  Fully Dynamic Secret Sharing Schemes , 1993, Theor. Comput. Sci..

[423]  B. Clifford Neuman,et al.  A note on the use of timestamps as nonces , 1993, OPSR.

[424]  Andreas Pfitzmann,et al.  More efficient software implementations of (generalized) DES , 1993, Comput. Secur..

[425]  Dj Daniel Bernstein,et al.  A general number field sieve implementation , 1993 .

[426]  David Naccache,et al.  Can O.S.S. be Repaired? Proposal for a New Practical Signature Scheme , 1994, EUROCRYPT.

[427]  Silvio Micali,et al.  Secret-Key Agreement without Public-Key Cryptography , 1993, CRYPTO.

[428]  D. Jungnickel.  Finite fields : structure and arithmetics , 1993 .

[429]  Richard G. E. Pinch.  The Carmichael Numbers up to 10 15 , 1993 .

[430]  Vincent Rijmen,et al.  Cryptanalysis of the CFB Mode of the DES with a Reduced Number of Rounds , 1993, CRYPTO.

[431]  G. Jaeschke.  On strong pseudoprimes to several bases , 1993 .

[432]  Walter Fumy,et al.  Principles of Key Management , 1993, IEEE J. Sel. Areas Commun..

[433]  Markus Dichtl,et al.  Fish: A Fast Software Stream Cipher , 1993, FSE.

[434]  Arjen K. Lenstra,et al.  On the Factorization of RSA-120 , 1993, CRYPTO.

[435]  Rainer A. Rueppel,et al.  A new signature scheme based on the DSA giving message recovery , 1993, CCS '93.

[436]  Joos Vandewalle,et al.  A New Approach to Block Cipher Design , 1993, FSE.

[437]  L. Adleman,et al.  A Subexponential Algorithm for Discrete Logarithms over All Finite Fields , 1993, Annual International Cryptology Conference.

[438]  Thomas Johansson,et al.  On the Relation between A-Codes and Codes Correcting Independent Errors , 1994, EUROCRYPT.

[439]  Peter Honeyman,et al.  Formal Methods for the Analysis of Authentication Protocols , 1993 .

[440]  David J. Wheeler.  A Bulk Data Encription Algorithm , 1993, FSE.

[441]  Cunsheng Ding,et al.  The Differential Cryptanalysis and Design of Natural Stream Ciphers , 1993, FSE.

[442]  Jerome H. Saltzer,et al.  Protecting Poorly Chosen Secrets from Guessing Attacks , 1993, IEEE J. Sel. Areas Commun..

[443]  Colin Boyd,et al.  On a Limitation of BAN Logic , 1994, EUROCRYPT.

[444]  N. Demytko,et al.  A New Elliptic Curve Based Analogue of RSA , 1994, EUROCRYPT.

[445]  Xuejia Lai,et al.  Security of Iterated Hash Functions Based on Block Ciphers , 1994, CRYPTO.

[446]  Yvo Desmedt,et al.  Towards practical “proven secure” authenticated key distribution , 1993, CCS '93.

[447]  Oliver Schirokauer.  Discrete logarithms and local units , 1993, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.

[448]  Adi Shamir,et al.  The Discrete Logarithm Modulo a Composite Hides O(n) Bits , 1993, J. Comput. Syst. Sci..

[449]  C. N. Zhang.  An improved binary algorithm for RSA , 1993 .

[450]  I. Damgård,et al.  Average case error estimates for the strong probable prime test , 1993 .

[451]  Johannes A. Buchmann,et al.  An Implementation of the General Number Field Sieve , 1994, CRYPTO.

[452]  Peter J. Giblin,et al.  Primes and programming - an introduction to number theory with computing , 1993 .

[453]  Amos Beimel,et al.  Interaction in Key Distribution Schemes (Extended Abstract) , 1993, CRYPTO.

[454]  Ross J. Anderson.  Practical RSA trapdoor , 1993 .

[455]  Jacques Patarin,et al.  Improved Algorithms for the Permuted Kernel Problem , 1993, CRYPTO.

[456]  C. Adams,et al.  DESIGNING S-BOXES FOR CIPHERS RESISTANT TO DIFFERENTIAL CRYPTANALYSIS ( Extended , 1993 .

[457]  J. Ly.  A serial version of the Pohlig-Hellman Algorithm for computing discrete logarithms , 1993 .

[458]  Lars R. Knudsen,et al.  Attacks on Double Block Length Hash Functions , 1993, FSE.

[459]  Eli Biham,et al.  New Types of Cryptanalytic Attacks Using related Keys (Extended Abstract) , 1994, EUROCRYPT.

[460]  H. Lenstra,et al.  Factoring integers with the number field sieve , 1993 .

[461]  Tudor Jebelean.  Comparing several GCD algorithms , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[462]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[463]  R. Tao.  On Finite Automaton One-Key Cryptosystems , 1993, FSE.

[464]  Chae Hoon Lim,et al.  Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks , 1993, CRYPTO.

[465]  Ian F. Blake,et al.  Constructive problems for irreducible polynominals over finite fields , 1993, Information Theory and Applications.

[466]  Bruce Schneier,et al.  Description of a New Variable-Length Key, 64-bit Block Cipher (Blowfish) , 1993, FSE.

[467]  A. K. Lenstra,et al.  The factorization of the ninth Fermat number , 1993 .

[468]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[469]  Jennifer Seberry,et al.  Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks , 1993, IEEE J. Sel. Areas Commun..

[470]  I. Koren.  Computer arithmetic algorithms , 2018 .

[471]  Armin Liebl,et al.  Authentication in distributed systems: a bibliography , 1993, OPSR.

[472]  Joos Vandewalle,et al.  Differential cryptanalysis of hash functions based on block ciphers , 1993, CCS '93.

[473]  Richard Taylor,et al.  An Integrity Check Value Algorithm for Stream Ciphers , 1993, CRYPTO.

[474]  A. Atkin,et al.  ELLIPTIC CURVES AND PRIMALITY PROVING , 1993 .

[475]  Thomas Johansson,et al.  On Families of Hash Functions via Geometric Codes and Concatenation , 1993, CRYPTO.

[476]  Stuart Haber,et al.  Improving the Efficiency and Reliability of Digital Time-Stamping , 1993 .

[477]  Jovan Dj. Golic,et al.  Embedding and Probabilistic Correlation Attacks on Clock-Controlled Shift Registers , 1994, EUROCRYPT.

[478]  Mike Burmester,et al.  On the Risk of Opening Distributed Keys , 1994, CRYPTO.

[479]  Rainer A. Rueppel,et al.  Modern key agreement techniques , 1994, Comput. Commun..

[480]  Susan K. Langford,et al.  Differential-Linear Cryptanalysis , 1994, CRYPTO.

[481]  G. Frey,et al.  A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .

[482]  Serge Vaudenay,et al.  On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER , 1994, FSE.

[483]  Kazuo Ohta,et al.  Linear Cryptanalysis of the Fast Data Encipherment Algorithm , 1994, CRYPTO.

[484]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[485]  Warwick Ford,et al.  A key distribution method for object-based protection , 1994, CCS '94.

[486]  Thomas Beth,et al.  Towards acceptable key escrow systems , 1994, CCS '94.

[487]  Simon R. Blackburn,et al.  Clock-Controlled Pseudorandom Generators on Finite Groups , 1994, FSE.

[488]  Moni Naor,et al.  Visual Cryptography , 1994, Encyclopedia of Multimedia.

[489]  Paul F. Syverson,et al.  On unifying some cryptographic protocol logics , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.

[490]  Mitsuru Matsui,et al.  The First Experimental Cryptanalysis of the Data Encryption Standard , 1994, CRYPTO.

[491]  Kathleen A. S. Quinn.  Some constructions for key distribution patterns , 1994, Des. Codes Cryptogr..

[492]  Jonathan P. Sorenson.  Two Fast GCD Algorithms , 1994, J. Algorithms.

[493]  Arjen K. Lenstra,et al.  The Magic Words are Squeamish Ossifrage , 1994, ASIACRYPT.

[494]  Chris J. Skinner,et al.  A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms , 1994, ASIACRYPT.

[495]  S. Vanstone,et al.  The knapsack problem in cryptography , 1994 .

[496]  Jean-Jacques Quisquater,et al.  Secure Acceleration of DSS Signatures Using Insecure Server , 1994, ASIACRYPT.

[497]  Matthew J. B. Robshaw.  On evaluating the linear complexity of a sequence of least period 2n , 1994, Des. Codes Cryptogr..

[498]  Michael Roe,et al.  How to Reverse Engineer an EES Device , 1994, FSE.

[499]  Florent Chabaud,et al.  On the Security of Some Cryptosystems Based on Error-correcting Codes , 1994, EUROCRYPT.

[500]  Ilene H. Morgan,et al.  Primitive normal polynomials over finite fields , 1994 .

[501]  Leonard M. Adleman,et al.  Open problems in number theoretic complexity, II , 1994, ANTS.

[502]  Theodore Y. Ts'o,et al.  Kerberos: an authentication service for computer networks , 1994, IEEE Communications Magazine.

[503]  Ed Dawson,et al.  A computer package for measuring the strength of encryption algorithms , 1994, Comput. Secur..

[504]  Mihir Bellare,et al.  Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.

[505]  S. Micali.  Fair cryptosystems , 1994 .

[506]  M. Smid,et al.  Key escrowing today , 1994, IEEE Communications Magazine.

[507]  Mark Goresky,et al.  Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract) , 1994, EUROCRYPT.

[508]  Henri Gilbert,et al.  A Chosen Plaintext Attack of the 16-round Khufu Cryptosystem , 1994, CRYPTO.

[509]  James L. Massey,et al.  A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences , 1994, CRYPTO.

[510]  Catherine A. Meadows,et al.  Formal Verification of Cryptographic Protocols: A Survey , 1994, ASIACRYPT.

[511]  G. A. Orton,et al.  A Multiple-Iterated Trapdoor for Dense Compact Knapsacks , 1994, EUROCRYPT.

[512]  Arjen K. Lenstra,et al.  Lattice sieving and trial division , 1994, ANTS.

[513]  Simson L. Garfinkel,et al.  PGP: Pretty Good Privacy , 1994 .

[514]  Matt Blaze,et al.  Protocol failure in the escrowed encryption standard , 1994, CCS '94.

[515]  Mitsuru Matsui,et al.  Linear Cryptanalysis of LOKI and s2DES , 1994, ASIACRYPT.

[516]  Eli Biham,et al.  How to Strengthen DES Using Existing Hardware , 1994, ASIACRYPT.

[517]  Mihir Bellare,et al.  The Security of Cipher Block Chaining , 1994, CRYPTO.

[518]  Ross Ihaka,et al.  Cryptographic Randomness from Air Turbulence in Disk Drives , 1994, CRYPTO.

[519]  Preda Mihailescu,et al.  Fast Generation of Provable Primes Using Search in Arithmetic Progressions , 1994, CRYPTO.

[520]  Kaoru Kurosawa,et al.  Low Exponent Attack Against Elliptic Curve RSA , 1994, Inf. Process. Lett..

[521]  Carlo Blundo,et al.  Space Requirements for Broadcast Encryption , 1994, EUROCRYPT.

[522]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[523]  K.-Y. Lam,et al.  Efficiency of SS(I) square-and-multiply exponentiation algorithms , 1994 .

[524]  Patrick Horster,et al.  Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications , 1994, ASIACRYPT.

[525]  C. Pomerance,et al.  There are infinitely many Carmichael numbers , 1994 .

[526]  Martín Abadi,et al.  Prudent engineering practice for cryptographic protocols , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.

[527]  Evangelos Kranakis,et al.  On key distribution via true broadcasting , 1994, CCS '94.

[528]  Jan Camenisch,et al.  Blind Signatures Based on the Discrete Logarithm Problem , 1994, EUROCRYPT.

[529]  Jacques Stern,et al.  On the Length of Cryptographic Hash-Values Used in Identification Schemes , 1994, CRYPTO.

[530]  Leonard M. Adleman,et al.  A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields , 1994, ANTS.

[531]  Chris J. Mitchell.  A Storage Complexity Based Analogue of Maurer Key Establishment Using Public Channels , 1995, IMACC.

[532]  Arjen K. Lenstra,et al.  NFS with Four Large Primes: An Explosive Experiment , 1995, CRYPTO.

[533]  Bart Preneel,et al.  MDx-MAC and Building Fast MACs from Hash Functions , 1995, CRYPTO.

[534]  F. Arnault.  Rabin-Miller primality test: composite numbers which pass it , 1995 .

[535]  Ed Dawson,et al.  Randomness Measures Related to Subset Occurrence , 1995, Cryptography: Policy and Algorithms.

[536]  Simon J. D. Phoenix,et al.  Quantum cryptography: Protecting our future networks with quantum mechanics , 1995, Inf. Secur. Tech. Rep..

[537]  Peter L. Montgomery,et al.  A Block Lanczos Algorithm for Finding Dependencies Over GF(2) , 1995, EUROCRYPT.

[538]  Chris J. Mitchell,et al.  A Proposed Architecture for Trusted Third Party Services , 1995, Cryptography: Policy and Algorithms.

[539]  Gene Tsudik,et al.  Refinement and extension of encrypted key exchange , 1995, OPSR.

[540]  Claus-Peter Schnorr,et al.  Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction , 1995, EUROCRYPT.

[541]  Mihir Bellare,et al.  XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions , 1995, CRYPTO.

[542]  Kazuo Ohta,et al.  Differential-Linear Cryptanalysis of FEAL-8 , 1995 .

[543]  Erich Kaltofen,et al.  Subquadratic-time factoring of polynomials over finite fields , 1995, STOC '95.

[544]  Christian Huitema,et al.  A new approach to the X.509 framework: allowing a global authentication infrastructure without a global trust model , 1995, Proceedings of the Symposium on Network and Distributed System Security.

[545]  Chi-Sung Laih,et al.  On the Security of the Lucas Function , 1995, Inf. Process. Lett..

[546]  Matthew K. Franklin,et al.  Verifiable Signature Sharing , 1995, EUROCRYPT.

[547]  Ross J. Anderson,et al.  Robustness Principles for Public Key Protocols , 1995, CRYPTO.

[548]  Damian Weber,et al.  An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p , 1995, EUROCRYPT.

[549]  Carlo Harpes,et al.  A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma , 1995, EUROCRYPT.

[550]  Walter T. Penzhorn,et al.  Computation of Low-Weight Parity Checks for Correlation Attacks on Stream Ciphers , 1995, IMACC.

[551]  Jan Camenisch,et al.  Fair Blind Signatures , 1995, EUROCRYPT.

[552]  David Pointcheval,et al.  A New Identification Scheme Based on the Perceptrons Problem , 1995, EUROCRYPT.

[553]  Peter Winkler,et al.  A Key Escrow System with Warrant Bounds , 1995, CRYPTO.

[554]  Sangjin Lee,et al.  On the Security of the Gollmann Cascades , 1995, CRYPTO.

[555]  Moti Yung,et al.  Cryptanalysis of the Immunized LL Public Key Systems , 1995, CRYPTO.

[556]  Jonathan P. Sorenson,et al.  Counting the Integers Factorable via Cyclotomic Methods , 1995, J. Algorithms.

[557]  Simon J. Shepherd.  A high speed software implementation of the Data Encryption Standard , 1995, Comput. Secur..

[558]  Burton S. Kaliski,et al.  On Differential and Linear Crytoanalysis of the RC5 Encryption Algorithm , 1995, CRYPTO.

[559]  Bart Preneel,et al.  RIPEMD-160: A Strengthened Version of RIPEMD , 1996, FSE.

[560]  Joe Kilian,et al.  How to Protect DES Against Exhaustive Key Search , 1996, CRYPTO.

[561]  Jacques Patarin,et al.  Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.

[562]  Vincent Rijmen,et al.  The Cipher SHARK , 1996, FSE.

[563]  David Paul Maher,et al.  Crypto backup and key escrow , 1996, CACM.

[564]  Stephen M. Matyas,et al.  A proposed mode for triple-DES encryption , 1996, IBM J. Res. Dev..

[565]  Lars R. Knudsen,et al.  On the Difficulty of Software Key Escrow , 1996, EUROCRYPT.

[566]  Lars R. Knudsen,et al.  Truncated Differentials of SAFER , 1996, FSE.

[567]  Tsutomu Matsumoto,et al.  Optimization of Time-Memory Trade-Off Cryptanalysis and Its Application to DES, FEAL-32, and Skipjack (Special Section on Cryptography and Information Security) , 1996 .

[568]  Willi Meier,et al.  Improved Differential Attacks on RC5 , 1996, CRYPTO.

[569]  Philip R. Zimmermann,et al.  The official PGP user's guide , 1996 .

[570]  Helen May Gustafson.  Statistical analysis of symmetric ciphers , 1996 .

[571]  Eli Biham,et al.  Two Practical and Provably Secure Block Ciphers: BEARS and LION , 1996, FSE.

[572]  Daniel Bleichenbacher,et al.  Generating EIGamal Signatures Without Knowing the Secret Key , 1996, EUROCRYPT.

[573]  Jacques Stern,et al.  An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding , 1996, EUROCRYPT.

[574]  Matthew K. Franklin,et al.  Low-Exponent RSA with Related Messages , 1996, EUROCRYPT.

[575]  Steve Dusse,et al.  S/MIME Message Specification: PKCS Security Services for MIME , 1996 .

[576]  Hugo Krawczyk,et al.  Keying Hash Functions for Message Authentication , 1996, CRYPTO.

[577]  C. Mitchell,et al.  Redundant integer representations and fast exponentiation , 1996 .

[578]  Hyunsoo Yoon,et al.  New Modular Multiplication Algorithms for Fast Modular Exponentiation , 1996, EUROCRYPT.

[579]  David M. Balenson,et al.  Commercial key recovery , 1996, CACM.

[580]  Dorothy E. Denning,et al.  A taxonomy for key escrow encryption systems , 1996, CACM.

[581]  Jörg Schwenk,et al.  Public Key Encryption and Signature Schemes Based on Polynomials over Zn , 1996, EUROCRYPT.

[582]  Stefan Lucks,et al.  Faster Luby-Rackoff Ciphers , 1996, FSE.

[583]  Martín Abadi,et al.  Prudent Engineering Practice for Cryptographic Protocols , 1994, IEEE Trans. Software Eng..

[584]  Ed Dawson,et al.  A Comparison of Fast Correlation Attacks , 1996, FSE.

[585]  Michael Luby,et al.  Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.

[586]  Fred Piper.  Introduction to cryptology , 1997, Inf. Secur. Tech. Rep..

[587]  Alfred Menezes,et al.  Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.

[588]  Mike Gardner.  A new kind of cipher that would take millions of years to break , 1997 .

[589]  Daniel J. Bernstein,et al.  Detecting perfect powers in essentially linear time , 1998, Math. Comput..

[590]  Ivan Damgård,et al.  Zero-Knowledge Authentication Scheme with Secret Key Exchange , 1988, Journal of Cryptology.

[591]  Phillip Rogaway,et al.  A Software-Optimized Encryption Algorithm , 1998, Journal of Cryptology.

[592]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[593]  G. Jain.  Zero Knowledge Proofs : A Survey , .