Cryptography and Secure Communication - Richard E. Blahut

. .

Résumé :
Today's pervasive computing and communications networks have created an intense need for secure and reliable cryptographic systems. Bringing together a fascinating mixture of topics in engineering, mathematics, computer science, and informatics, this book presents the timeless mathematical theory underpinning cryptosystems both old and new. Major branches of classical and modern cryptography are discussed in detail, from basic block and stream cyphers through to systems based on elliptic and hyperelliptic curves, accompanied by concise summaries of the necessary mathematical background. Practical aspects such as implementation, authentication and protocol-sharing are also covered, as are the possible pitfalls surrounding various cryptographic methods. Written specifically with engineers in mind, and providing a solid grounding in the relevant algorithms, protocols and techniques, this insightful introduction to the foundations of modern cryptography is ideal for graduate students and researchers in engineering and computer science, and practitioners involved in the design of security systems for communications networks....

Biographie:
Richard E. Blahut is the Henry Magnuski Professor of Electrical and Computer Engineering at the University of Illinois, Urbana-Champaign. He is a Fellow of the Institute of Electrical and Electronics Engineers and the recipient of many awards including the IEEE Alexander Graham Bell Medal (1998), the Tau Beta Pi Daniel C. Drucker Eminent Faculty Award, and the IEEE Millennium Medal. He was named a Fellow of IBM Corporation in 1980 (where he worked for over 30 years) and was elected to the US National Academy of Engineering in 1990.

Sommaire:
1. Introduction; 2. The integers; 3. Cryptography based on the integer ring; 4. Cryptography based on the discrete logarithm; 5. Information-theoretic methods in cryptography; 6. Block ciphers; 7. Stream ciphers; 8. Authentication and ownership protection; 9. Groups, rings, and fields; 10. Cryptography based on elliptic curves; 11. Cryptography based on hyperelliptic curves; 12. Cryptography based on bilinear pairings; 13. Implementation; 14. Cryptographic protocols for security and identification; 15. More public-key cryptography.