The DOI matches its Crossref record.
Handbook of Applied Cryptography
Abstract
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques are now in widespread use, especially in the financial services industry, in the public sector, and by individuals for their personal privacy, such as in electronic mail. This Handbook will serve as a valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography. It is a necessary and timely guide for professionals who practice the art of cryptography. The Handbook of Applied Cryptography provides a treatment that is multifunctional:It serves as an introduction to the more practical aspects of both conventional and public-key cryptographyIt is a valuable source of the latest techniques and algorithms for the serious practitionerIt provides an integrated treatment of the field, while still presenting each major topic as a self-contained unitIt provides a mathematical treatment to accompany practical discussionsIt contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussedNow in its third printing, this is the definitive cryptography reference that the novice as well as experienced developers, designers, researchers, engineers, computer scientists, and mathematicians alike will use.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617
Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
Constant-Size Commitments to Polynomials and Their Applications
Kate, A., Zaverucha, G. M., & Goldberg, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_11 · Cited by 624
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Boneh, D., & Boyen, X. (2008) · Journal of Cryptology · doi:10.1007/s00145-007-9005-7 · Cited by 605
On the Importance of Eliminating Errors in Cryptographic Computations
Boneh, D., DeMillo, R. A., & Lipton, R. J. (2001) · Journal of Cryptology · doi:10.1007/s001450010016 · Cited by 514
Simple and fault-tolerant key agreement for dynamic collaborative groups
Kim, Y., Perrig, A., & Tsudik, G. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352638 · Cited by 488
On the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
Recommendation for Key Management Part 1: General
Barker, E. (2016) · doi:10.6028/nist.sp.800-57pt1r4 · Cited by 396
RFID-Tags for Anti-counterfeiting
Tuyls, P., & Batina, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11605805_8 · Cited by 388
Hierarchical watermarking for secure image authentication with localization
Utku Celik, M., Sharma, G., Saber, E., & Murat Tekalp, A. (2002) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.1014990 · Cited by 368
Kulsoom, A., Xiao, D., Aqeel-ur-Rehman, & Abbas, S. A. (2016) · Multimedia Tools and Applications · doi:10.1007/s11042-014-2221-x · Cited by 331
Public Key Cryptography in Sensor Networks—Revisited
Gaubatz, G., Kaps, J.-P., & Sunar, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30496-8_2 · Cited by 289
Internet X.509 Public Key Infrastructure Certificate Management Protocols
Adams, C., & Farrell, S. (1999) · doi:10.17487/rfc2510 · Cited by 285
Yu, P. L., Baras, J. S., & Sadler, B. M. (2008) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.916273 · Cited by 266
Mobility helps security in ad hoc networks
Čapkun, S., Hubaux, J.-P., & Buttyán, L. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778422 · Cited by 257
Digital signature standard (DSS)
National Institute of Standards and Technology (US) (2013) · doi:10.6028/nist.fips.186-4 · Cited by 246
Preimage Attacks on One-Block MD4, 63-Step MD5 and More
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04159-4_7 · Cited by 182
Rebound Distinguishers: Results on the Full Whirlpool Compression Function
Lamberger, M., Mendel, F., Rechberger, C., Rijmen, V., & Schläffer, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_8 · Cited by 159
AlMarshoud, M., Sabir Kiraz, M., & H. Al-Bayatti, A. (2024) · ACM Computing Surveys · doi:10.1145/3656166 · Cited by 145
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_5 · Cited by 115
Advanced Encryption Standard (AES)
National Institute of Standards and Technology (US) (2023) · doi:10.6028/nist.fips.197-upd1 · Cited by 252
Quantum reversible circuit of AES-128
Almazrooie, M., Samsudin, A., Abdullah, R., & Mutter, K. N. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1864-3 · Cited by 75
Khelifi, F. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.09.020 · Cited by 63
Fully Digital Random Bit Generators for Cryptographic Applications
Bucci, M., & Luzzi, R. (2008) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2008.916446 · Cited by 46
Secure and Efficient Block Cipher Mode Design for Parallel Processing and Reliable Security
Vatsavayi, V. K., & Bommireddy, D. R. (2026) · Cryptography · doi:10.3390/cryptography10010013 · Cited by 2
Metadata
- Authors
- Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A.
- Venue
- CRC Press eBooks
- Publisher
- CRC Press
- Published
- 2018-12-07
- OpenAlex
- W4289126832
- Cited by
- 1,770
- References
- 0
- FWCI
- 25.98
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.