This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
4.5 Summary and Bibliographic Remarks
F. Bauer. Decrypted Secrets: Methods and Maxims of Cryptology. Springer-Verlag, second edition, 2000.
F. Bauer. Entzifferte Geheimnisse: Methoden und Maximen der Kryptologie. Springer-Verlag, third edition, 2000. In German.
A. Beutelspacher. Kryptologie. Vieweg, 6th edition, 2002. In German.
A. Beutelspacher. Cryptology. Spectrum series. Mathematical Association of America, 1994.
A. Beygelzimer, L. Hemaspaandra, C. Homan, and J. Rothe. One-way functions in worst-case cryptography: Algebraic and security properties are on the house. SIGACT News, 30(4):25–40, December 1999.
A. Beutelspacher, J. Schwenk, and K. Wolfenstetter. Moderne Verfahren der Kryptographie. Vieweg, 4th edition, 2001. In German.
J. Buchmann. Introduction to Cryptography. Undergraduate Texts in Mathematics. Springer-Verlag, 2001.
J. Cai. Some recent progress on the complexity of lattice problems. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pages 158–179. IEEE Computer Society Press, May 1999.
J. Daemen and V. Rijmen. The Design of Rijndael. Springer-Verlag, 2001.
J. Feigenbaum. Overview of interactive proof systems and zero-knowledge. In G. Simmons, editor, Contemporary Cryptology: The Science of Information Integrity, pages 423–439. IEEE Computer Society Press, 1992.
O. Goldreich. Foundations of Cryptography. Cambridge University Press, 2001.
O. Goldreich. Randomness, interactive proofs, and zero-knowledge—A survey. In R. Herken, editor, The Universal Turing Machine: A Half-Century Survey, pages 377–405. Oxford University Press, Oxford, 1988.
S. Goldwasser. Interactive proof systems. In J. Hartmanis, editor, Computational Complexity Theory, pages 108–128. AMS Short Course Lecture Notes: Introductory Survey Lectures, Proceedings of Symposia in Applied Mathematics, Volume 38, American Mathematical Society, 1989.
O. Goldreich. Modern cryptography, probabilistic proofs, and pseudorandomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1999.
D. Kahn. The Codebreakers: The Story of Secret Writing. MacMillan Publishing Company, 1967.
B. Kaliski Jr., R. Rivest, and A. Sherman. Is the data encryption standard a group? (Results of cycling experiments on DES). Journal of Cryptology, 1(1):3–36, 1988.
R. Kumar and D. Sivakumar. Complexity of SVP-A reader's digest. SIGACT News, 32(3):40–52, June 2001.
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes. Princeton University Press, Princeton, New Jersey, 1996.
D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: A Cryptographic Perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts, March 2002.
P. Nguyen and J. Stern. The two faces of lattices in cryptology. In Proceedings of the International Conference on Cryptography and Lattices, pages 146–180. Springer-Verlag Lecture Notes in Computer Science #2146, 2001.
J. Rothe. Some facets of complexity theory and cryptography: A five-lecture tutorial. ACM Computing Surveys, 34(4):504–549, December 2002.
J. Rothe. Kriptográfia (Cryptography). In A. Iváanyi, editor, Informatikai Algoritmusok I (Algorithms of Computer Science I), pages 94–124. ELTE Eötvös Kiadó, 2004. In Hungarian. German version available on-line at http://www.cs.uni-duesseldorf.de/~rothe/TONY/main.pdf.
R. Rueppel. Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin, Heidelberg, New York, 1986.
A. Salomaa. Public-Key Cryptography, volume 23 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, second edition, 1996.
B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley and Sons, New York, second edition, 1996.
A. Selman. A survey of one-way functions in complexity theory. Mathematical Systems Theory, 25(3):203–221, 1992.
C. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28(4):657–715, 1949.
S. Singh. The Code Book. The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Fourth Estate, London, 1999.
D. Stinson. Cryptography: Theory and Practice. CRC Press, Boca Raton, second edition, 2002.
D. Welsh. Codes and Cryptography. Oxford science publications. Clarendon Press, Oxford, 6th edition, 1998. Reprinted with corrections.
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2005). Foundations of Cryptology. In: Complexity Theory and Cryptology. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28520-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-28520-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22147-0
Online ISBN: 978-3-540-28520-5
eBook Packages: Computer ScienceComputer Science (R0)