Douglas R. Stinson

THE LEGACY... First introduced in 1995, Cryptography: Theory and Practice garnered enormous praise and popularity, and soon became the standard textbook for cryptography courses around the world. The second edition was equally embraced, and enjoys status as a perennial bestseller. Now in its third edition, this authoritative text continues to provide a solid foundation for future breakthroughs in cryptography. WHY A THIRD EDITION? The art and science of cryptography has been evolving for thousands of years. Now, with unprecedented amounts of information circling the globe, we must be prepared to face new threats and employ new encryption schemes on an ongoing basis. This edition updates relevant chapters with the latest advances and includes seven additional chapters covering: Pseudorandom bit generation in cryptography Entity authentication, including schemes built from primitives and special purpose "zero-knowledge" schemes Key establishment including key distribution and protocols for key agreement, both with a greater emphasis on security models and proofs Public key infrastructure, including identity-based cryptography Secret sharing schemes Multicast security, including broadcast encryption and copyright protection THE RESULT... Providing mathematical background in a "just-in-time" fashion, informal descriptions of cryptosystems along with more precise pseudocode, and a host of numerical examples and exercises, Cryptography: Theory and Practice, Third Edition offers comprehensive, in-depth treatment of the methods and protocols that are vital to safeguarding the mind-boggling amount of information circulating around the world.

Theory and Practice, Third Edition

Cryptography

Major advances over the last five years precipitated this major revision of the bestselling Cryptography: Theory and Practice. With more than 40 percent new or updated material, the second edition now provides an even more comprehensive treatment of modern cryptography. It focuses on the new Advanced Encryption Standards and features an entirely new chapter on that subject. Another new chapter explores the applications of secret sharing schemes, including ramp schemes, visual cryptography, threshold cryptography, and broadcast encryption. This is an ideal introductory text for both computer science and mathematics students and a valuable reference for professionals.

Theory and Practice

Guang Gong

Alex Biryukov

This book constitutes the thoroughly refereed post-proceedings of the 17th Annual International Workshop on Selected Areas in Cryptography, SAC 2010, held in Waterloo, Ontario, Canada in August 2010. The 24 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 90 submissions. The papers are organized in topical sections on hash functions, stream ciphers, efficient implementations, coding and combinatorics, block ciphers, side channel attacks, and mathematical aspects.

17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers

Selected Areas in Cryptography

Stafford Tavares

This book constitutes the thoroughly refereed post-proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography, SAC 2000, held in Waterloo, Ontario, Canada, in August 2000. The 24 revised full papers presented were selected from 41 submissions and have gone through two rounds of reviewing and revision. The papers are organized in topical sections on cryptanalysis, block ciphers: new designs, elliptic curves and efficient implementations, security protocols and applications, block ciphers and hash functions, Boolean functions and stream ciphers, and public key systems.

7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000. Proceedings

Jeffrey H. Dinitz

Foremost experts in their field have contributed articles resulting in a compilation of useful and timely surveys in this ever-expanding field. Each of these 12 original papers covers important aspects of design theory including several in areas that have not previously been surveyed. Also contains surveys updating earlier ones where research is particularly active.

A Collection of Surveys

Contemporary Design Theory

The CRYPTO ’93 conference was sponsored by the International Association for Cryptologic Research (IACR) and Bell-Northern Research (a subsidiary of Northern Telecom), in co-operation with the IEEE Computer Society Technical Committee. It took place at the University of California, Santa Barbara, from August 22-26, 1993. This was the thirteenth annual CRYPTO conference, all of which have been held at UCSB. The conference was very enjoyable and ran very of the General Chair, Paul Van Oorschot. smoothly, largely due to the efforts It was a pleasure working with Paul throughout the months leading up to the conference. There were 136 submitted papers which were considered by the Program Committee. Of these, 38 were selected for presentation at the conference. There was also one invited talk at the conference, presented by Miles Smid, the title of which was “A Status Report On the Federal Government Key Escrow System.” The conference also included the customary Rump Session, which was presided over by Whit Diffie in his usual inimitable fashion. Thanks again to Whit for organizing and running the Rump session. This year, the Rump Session included an interesting and lively panel discussion on issues pertaining to key escrowing. Those taking part were W. Diffie, J. Gilmore, S. Goldwasser, M. Hellman, A. Herzberg, S. Micali, R. Rueppel, G. Simmons and D. Weitzner.

13th Annual International Cryptology Conference Santa Barbara, California, USA August 22–26, 1993 Proceedings

Advances in Cryptology — CRYPTO ’93

Donald L. Kreher

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.

Douglas R. Stinson

About

Books

Join the club