Crypto Bibliography

Citations by First Author - L

K. Lüders-Jensen and T. Jakobsen, Bounds on Minimal Codewords in Linear Codes, 1994. [.ps] [.ps.gz]

B. LaMacchia and A. Odlyzko, Computation of discrete logarithms in prime fields, Designs, Codes, and Cryptography 1 (1991), pp. 46-62. Extended abstract in Advances in Cryptology - CRYPTO '90, A. J. Menezes, and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537, 1991, pp. 616-618. [.pdf] [.ps]

B. LaMacchia, Policy in Public Key Infrastructures, or How Values End Up in the Code, DIMACS Workshop on Design for Values: Ethical, Social and Political Dimensions of Information Technology (position paper for invited talk), Princeton, NJ, March 1998.

B. LaMacchia and A. Odlyzko, Solving large sparse linear systems over finite fields, Advances in Cryptology - CRYPTO '90, A. J. Menezes and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537 (1991), pp. 109-133. [.pdf] [.ps]

J. Lee, H. Heys, and S. Tavares, Resistance of a CAST-like Encryption Algorithm to Linear and Differential Cryptanalysis, Designs, Codes, and Cryptography, Sep. 1996. [.ps]

R. Lercier, Factoriser des entiers par la méthode des courbes elliptiques [french], Mémoire de DEA Informatique, Mathématiques et Applications, filière algorithmique, complexité et cryptographie, École Polytechnique, 1993 [.ps.gz]

R. Lercier, Computing isogenies in GF(2^n), in H. Cohen, editor, ANTS-II, volume 1122 of Lecture Notes in Comput. Sci., pages 197--212. Springer-Verlag, 1996. [.ps.gz]

R. Lercier, Finding Good Random Elliptic Curves for Cryptosystems Defined over GF(2^n), Advances in Cryptology - EUROCRYPT'97, Springer-Verlag. [.ps.gz]

R. Lercier and F. Morain, Counting the number of points on elliptic curves over GF(p^n) using Couveignes's algorithm, Rapport de Recherche LIX/RR/95/09, Laboratoire d'Informatique de l'École polytechnique (LIX), 1995. [.ps.gz]

R. Lercier and F. Morain, Algorithms for computing isogenies between elliptic curves, Computational Perspectives On Number Theory, 1997. [.ps.gz]

R. Levein, L. McCarthy and M. Blaze, Transparent Internet E-mail Security (DRAFT). August 9, 1996. Submitted for publication. [.ps]

C. Lim and P. Lee, Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks, Crypto '93, pp. 420-434. [.ps]

H. Lipmaa and S. Moriai, Efficient Algorithms for Computing Differential Properties of Addition, Fast Software Encryption 2001 workshop, Yokohama, Japan, 2-4 April 2001.

H. Lipmaa, Secure and Efficient Time-Stamping Systems, PhD thesis, University of Tartu, 1999, 56 pp.

H. Lipmaa, P. Rogaway, and D. Wagner, Comments to NIST Concerning AES-modes of Operations: CTR-mode Encryption, Symmetric Key Block Cipher Modes of Operation Workshop, Baltimore, Maryland, US, 20 October 2000. Electronic proceedings available from http://www.nist.gov/modes.

H. Lipmaa, IDEA: A Cipher for Multimedia Architectures?, Stafford Tavares and Henk Meijer, eds., Selected Areas in Cryptography '98, volume 1556 of Lecture Notes in Computer Science, pages 248--263, Kingston, Canada, 17-18 August 1998. Springer-Verlag.

T. Lomas, L. Gong, J. Salzer, and R. Needham, Reducing Risks from Poorly Chosen Keys, Proceedings of the 12th ACM Symposium on Operating System Principles, Litchfield Park, Arizona, December, 1989. Published as ACM Operating Systems Review, Vol.23, No.5, pp.14-18. [.ps.gz]

P. Louridas, Some Guidelines for Non-repudiation Protocols, Computer Communication Review, Volume 30, No. 4, October 2000.

M. Luby and J. Staddon, Combinatorial Bounds for Broadcast Encryption, Eurocrypt, June 1-4, 1998. [.ps]

M. Luby, Pseudorandomness and Cryptographic Applications, Princeton Computer Science Notes, David R. Hanson and Robert E. Tarjan, Editors, Princeton University Press, January 1996.

S. Lucks, On the Security of Remotely Keyed Encryption [.ps.gz]

S. Lucks, BEAST: A fast block cipher for arbitrary blocksizes [.ps.gz]

S. Lucks, Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys [.ps.gz]

S. Lucks, Faster Luby-Rackoff Ciphers [.ps.gz]

S. Lucks, How Traveling Salespersons Prove Their Identity [.ps.gz]

S. Lucks, How to Exploit the Intractability of Exact TSP for Cryptography [.ps.gz]

S. Lucks, Attacking Triple Encryption. [.ps.gz]

H. Luiijf, A. Dey, J. Watson, C. Muckenhirn , and M. Garnsey, Fortezza-enabled Multi-level Sensitive Simulations, The 1998 Spring Simulation Interoperability Workshop, Position Papers, Volume I, March 9-13, 1998, pp. 119-132. [.doc]

Schneier.com is a personal website. Opinions expressed are not necessarily those of BT Counterpane.