The SCEAS System
Navigation Menu

Conferences in DBLP

International Crytology Conference (CRYPTO) (crypto)
1985 (conf/crypto/1985)

  1. Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller
    Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:3-13 [Conf]
  2. Don Coppersmith
    Another Birthday Attack. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:14-17 [Conf]
  3. Wiebren de Jonge, David Chaum
    Attacks on Some RSA Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:18-27 [Conf]
  4. Ernest F. Brickell, John M. DeLaurentis
    An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:28-32 [Conf]
  5. Gustavus J. Simmons
    A Secure Subliminal Channel (?). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:33-41 [Conf]
  6. Yvo Desmedt
    Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:42-55 [Conf]
  7. Shimon Even, Oded Goldreich, Adi Shamir
    On the Security of Ping-Pong Protocols when Implemented using the RSA. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:58-72 [Conf]
  8. Claude Crépeau
    A Secure Poker Protocol that Minimizes the Effect of Player Coalitions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:73-86 [Conf]
  9. Richard Berger, Sampath Kannan, René Peralta
    A Framework for the Study of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:87-103 [Conf]
  10. Don Coppersmith
    Cheating at Mental Poker. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:104-107 [Conf]
  11. Whitfield Diffie
    Security for the DoD Transmission Control Protocol. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:108-127 [Conf]
  12. Zvi Galil, Stuart Haber, Moti Yung
    Symmetric Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:128-137 [Conf]
  13. James R. Gosler
    Software Protection: Myth or Reality? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:140-157 [Conf]
  14. Amir Herzberg, Shlomit S. Pinter
    Public Protection of Software. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:158-179 [Conf]
  15. G. R. Blakley, Catherine Meadows, George B. Purdy
    Fingerprinting Long Forgiving Messages. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:180-189 [Conf]
  16. David Chaum, Jan-Hendrik Evertse
    Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:192-211 [Conf]
  17. Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman
    Is DES a Pure Cipher? (Results of More Cycling Experiments on DES). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:212-226 [Conf]
  18. T. E. Moore, Stafford E. Tavares
    A Layered Approach to the Design of Private Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:227-245 [Conf]
  19. Eiji Okamoto, K. Nakamura
    Lifetimes of Keys in Cryptographic Key Management Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:246-259 [Conf]
  20. Rainer A. Rueppel
    Correlation Immunity and the Summation Generator. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:260-272 [Conf]
  21. Thomas Siegenthaler
    Design of Combiners to Prevent Divide and Conquer Attacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:273-279 [Conf]
  22. Adi Shamir
    On the Security of DES. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:280-281 [Conf]
  23. G. R. Blakley
    Information Theory Without the Finiteness Assumption, II: Unfolding the DES. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:282-337 [Conf]
  24. Harriet J. Fell, Whitfield Diffie
    Analysis of a Public Key Approach Based on Polynomial Substitution. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:340-349 [Conf]
  25. Martin Kochanski
    Developing an RSA Chip. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:350-357 [Conf]
  26. Hugh C. Williams
    An M³ Public-Key Encryption Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:358-368 [Conf]
  27. Vijay Varadharajan
    Trapdoor Rings and Their Use in Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:369-395 [Conf]
  28. Taher El Gamal
    On Computing Logarithms Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:396-402 [Conf]
  29. Johan Håstad
    On Using RSA with Low Exponent in a Public Key Network. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:403-408 [Conf]
  30. N. M. Stephens
    Lenstra's Factorization Method Based on Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:409-416 [Conf]
  31. Victor S. Miller
    Use of Elliptic Curves in Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:417-426 [Conf]
  32. Stephen Wolfram
    Cryptography with Cellular Automata. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:429-432 [Conf]
  33. John H. Reif, J. D. Tygar
    Efficient Parallel Pseudo-Random Number Generation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:433-446 [Conf]
  34. Michael Luby, Charles Rackoff
    How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:447- [Conf]
  35. Benny Chor, Oded Goldreich, Shafi Goldwasser
    The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:448-457 [Conf]
  36. Philippe Godlewski, Gérard D. Cohen
    Some Cryptographic Aspects of Womcodes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:458-467 [Conf]
  37. Charles H. Bennett, Gilles Brassard, Jean-Marc Robert
    How to Reduce Your Enemy's Information (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:468-476 [Conf]
  38. Joan Feigenbaum
    Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:477-488 [Conf]
  39. Johan van Tilburg, Dick E. Boekee
    Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:489-513 [Conf]
  40. Yvo Desmedt, Andrew M. Odlyzko
    A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:516-522 [Conf]
  41. A. F. Webster, Stafford E. Tavares
    On the Design of S-Boxes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:523-534 [Conf]
  42. Don Coppersmith
    The Real Reason for Rivest's Phenomenon. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:535-536 [Conf]
  43. Jean-Jacques Quisquater, Yvo Desmedt, Marc Davio
    The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:537-542 [Conf]
  44. Willem H. Haemers
    Access Control at the Netherlands Postal and Telecommunications Services. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:543-544 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002