Chapter Summary
This chapter deals with the algorithmic details needed for setting up public-key cryptosystems. We study algorithms for selecting public-key parameters and for carrying out the basic cryptographic primitives. Algorithms required for cryptanalysis are dealt with in Chapters 4 and 7.
We start the chapter with a discussion on algorithms. Time and space complexities of algorithms are discussed first and the standard order notations are explained. Next we study the class of randomized algorithms which provide practical solutions to many computational problems that do not have known efficient deterministic algorithms. In the worst case, a randomized algorithm may take exponential running time and/or may output an incorrect answer. ...
Get Public-key Cryptography: Theory and Practice now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
