Algorithms
A number of public–key algorithms exist, and each is suitable for one or more of the services discussed in the previous section. The most well known examples are mentioned briefly here; see the Handbook of Applied Cryptography [MvOV97] or Applied Cryptography: Protocols, Algorithms, and Source Code in C [Sch96] for a much more complete enumeration.
RSA
The algorithm proposed by Ron Rivest, Adi Shamir, and Len Adleman in 1978 [RSA78], known as RSA, is one of the earliest and most versatile of the public–key algorithms. It is suitable for encryption/decryption, for signing/verification (and, therefore, for data integrity), and for key establishment (specifically key transfer). It can be used as the basis for a secure pseudorandom ...
Get Understanding Public-Key Infrastructure: Concepts, Standards, and Deployment Considerations 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.
