Handbook of Applied Cryptography
The DOI matches its Crossref record.
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
Weedbrook, C., Pirandola, S., García-Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,664
PRESENT: An Ultra-Lightweight Block Cipher
Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_31 · Cited by 2,867
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_28 · Cited by 1,653
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420
Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems
Weis, S. A., Sarma, S. E., Rivest, R. L., & Engels, D. W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39881-3_18 · Cited by 1,382
Hide and seek: an introduction to steganography
Provos, N., & Honeyman, P. (2003) · IEEE Security & Privacy · doi:10.1109/msecp.2003.1203220 · Cited by 1,292
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
Bash, B. A., Goeckel, D., & Towsley, D. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130923 · Cited by 1,075
Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks
Buttyán, L., & Hubaux, J.-P. (2003) · Mobile Networks and Applications · doi:10.1023/a:1025146013151 · Cited by 1,068
TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks
Liu, A., & Ning, P. (2008) · 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008) · doi:10.1109/ipsn.2008.47 · Cited by 924
A survey of security issues in wireless sensor networks
Wang, Y., Attebury, G., & Ramamurthy, B. (2006) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2006.315852 · Cited by 898
Reversible Data Hiding in Encrypted Images by Reserving Room Before Encryption
Ma, K., Zhang, W., Zhao, X., Yu, N., & Li, F. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2248725 · Cited by 751
Universally Composable Notions of Key Exchange and Secure Channels
Canetti, R., & Krawczyk, H. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_22 · Cited by 746
“A very partial list includes [b + 91, dow92, br93, bjm97, bck98, s99, ck01,] See [ mov96 , Chapter 12] for more background information.”
BackgroundHMQV: A High-Performance Secure Diffie-Hellman Protocol: (Extended Abstract)
Krawczyk, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_33 · Cited by 730
HIGHT: A New Block Cipher Suitable for Low-Resource Device
Hong, D., Sung, J., Hong, S., Lim, J., Lee, S., Koo, B.-S., Lee, C., Chang, D., Lee, J., Jeong, K., et al. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_4 · Cited by 708
Recommendation for block cipher modes of operation: methods and techniques
Dworkin, M. J. (2001) · doi:10.6028/nist.sp.800-38a · Cited by 746
“[5] for information about linear feedback shift registers.”
Privacy-Preserving Set Operations
Kissner, L., & Song, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_15 · Cited by 648
Advanced Encryption Standard (AES)
National Institute of Standards and Technology (US) (2001) · doi:10.6028/nist.fips.197 · Cited by 642
Rogaway, P., & Shrimpton, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25937-4_24 · Cited by 614
A Survey of Attacks and Countermeasures in Mobile Ad Hoc Networks
Wu, B., Chen, J., Wu, J., & Cardei, M. (2007) · Signals and Communication Technology · doi:10.1007/978-0-387-33112-6_5 · Cited by 588
Mamoshina, P., Ojomoko, L., Yanovich, Y., Ostrovski, A., Botezatu, A., Prikhodko, P., Izumchenko, E., Aliper, A., Romantsov, K., Zhebrak, A., et al. (2018) · Oncotarget · doi:10.18632/oncotarget.22345 · Cited by 471
“A Shamir’s secret sharing technique [101] is then used to split the secret key to be distributed among key keepers, so that any K of key keepers together would be able to decrypt data, where K is a constant less than the number of key keepers N.”
MethodTeoh, A. B. J., Goh, A., & Ngo, D. C. L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.250 · Cited by 467
Key Generation From Wireless Channels: A Review
Zhang, J., Duong, T. Q., Marshall, A., & Woods, R. (2016) · IEEE Access · doi:10.1109/access.2016.2521718 · Cited by 451
Security, Privacy, and Safety Aspects of Civilian Drones: A Survey
Altawy, R., & Youssef, A. M. (2017) · ACM Transactions on Cyber-Physical Systems · doi:10.1145/3001836 · Cited by 428
A study of the energy consumption characteristics of cryptographic algorithms and security protocols
Potlapally, N. R., Ravi, S., Raghunathan, A., & Jha, N. K. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.16 · Cited by 426
Securing wireless sensor networks: a survey
Zhou, Y., Fang, Y., & Zhang, Y. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2008.4625802 · Cited by 424
A Lightweight RFID Protocol to protect against Traceability and Cloning attacks
Dimitriou, T. (2006) · First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05) · doi:10.1109/securecomm.2005.4 · Cited by 409
Thapa, C., & Camtepe, S. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2020.104130 · Cited by 393
EAACK—A Secure Intrusion-Detection System for MANETs
Shakshuki, E. M., Kang, N., & Sheltami, T. R. (2013) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2012.2196010 · Cited by 383
SIGMA: The ‘SIGn-and-MAc’ Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols
Krawczyk, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_24 · Cited by 382
Controlled physical random functions
Gassend, B., Clarke, D., van Dijk, M., & Devadas, S. (2003) · 18th Annual Computer Security Applications Conference, 2002. Proceedings. · doi:10.1109/csac.2002.1176287 · Cited by 380
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Gallant, R. P., Lambert, R. J., & Vanstone, S. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_11 · Cited by 376
Self-citationSecond Preimages on n-Bit Hash Functions for Much Less than 2 n Work
Kelsey, J., & Schneier, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_28 · Cited by 374
Structural digital signature for image authentication: an incidental distortion resistant scheme
Lu, C.-S., & Liao, H.-Y. M. (2003) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2003.811621 · Cited by 373
ID-based signatures from pairingson elliptic curves
Paterson, K. G. (2002) · Electronics Letters · doi:10.1049/el:20020682 · Cited by 366
An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks
Sun, J., Zhang, C., Zhang, Y., & Fang, Y. (2010) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.14 · Cited by 364
More efficient oblivious transfer and extensions for faster secure computation
Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516738 · Cited by 358
Self-securing ad hoc wireless networks
Luo, H., Zerfos, P., Kong, J., Lu, S., & Zhang, L. (2003) · Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications · doi:10.1109/iscc.2002.1021731 · Cited by 358
Understanding a Revolutionary and Flawed Grand Experiment in Blockchain: The DAO Attack
Mehar, M. I., Shier, C. L., Giambattista, A., Gong, E., Fletcher, G., Sanayhie, R., Kim, H. M., & Laskowski, M. (2019) · Journal of Cases on Information Technology · doi:10.4018/jcit.2019010102 · Cited by 347
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
Lagendijk, R. L., & Barni, M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 336
He, D., & Zeadally, S. (2015) · IEEE Internet of Things Journal · doi:10.1109/jiot.2014.2360121 · Cited by 327
PSKA: Usable and Secure Key Agreement Scheme for Body Area Networks
Venkatasubramanian, K. K., Banerjee, A., & Gupta, S. K. S. (2010) · IEEE Transactions on Information Technology in Biomedicine · doi:10.1109/titb.2009.2037617 · Cited by 322
Asynchronous protocols for optimistic fair exchange
Asokan, N., Shoup, V., & Waidner, M. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674826 · Cited by 316
New Algorithms for Secure Outsourcing of Modular Exponentiations
Chen, X., Li, J., Ma, J., Tang, Q., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.180 · Cited by 307
Boneh, D., & Naor, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_15 · Cited by 307
Efficient Garbling from a Fixed-Key Blockcipher
Bellare, M., Hoang, V. T., Keelveedhi, S., & Rogaway, P. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.39 · Cited by 304
Lossless watermarking for image authentication: a new framework and an implementation
Celik, M. U., Sharma, G., & Tekalp, A. M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.863053 · Cited by 301
An Efficient Public Key Traitor Tracing Scheme
Boneh, D., & Franklin, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_22 · Cited by 293
Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
Chevallier-Mames, B., Ciet, M., & Joye, M. (2004) · IEEE Transactions on Computers · doi:10.1109/tc.2004.13 · Cited by 277
Mix and Match: Secure Function Evaluation via Ciphertexts
Jakobsson, M., & Juels, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_13 · Cited by 276
Security Analysis of the Strong Diffie-Hellman Problem
Cheon, J. H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_1 · Cited by 274
Juels, A. (2004) · IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second · doi:10.1109/percomw.2004.1276920 · Cited by 269
b-SPECS+: Batch Verification for Secure Pseudonymous Authentication in VANET
Horng, S.-J., Tzeng, S.-F., Pan, Y., Fan, P., Wang, X., Li, T., & Khan, M. K. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2277471 · Cited by 268
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Albrecht, M., Grassi, L., Rechberger, C., Roy, A., & Tiessen, T. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53887-6_7 · Cited by 258
CRYPTANALYSIS OF FRIDRICH'S CHAOTIC IMAGE ENCRYPTION
SOLAK, E., ÇOKAL, C., YILDIZ, O. T., & BIYIKOĞLU, T. (2010) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127410026563 · Cited by 215
A Review of IEC 62351 Security Mechanisms for IEC 61850 Message Exchanges
Hussain, S. M. S., Ustun, T. S., & Kalam, A. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2956734 · Cited by 185
Security Tradeoffs in Cyber Physical Systems: A Case Study Survey on Implantable Medical Devices
Altawy, R., & Youssef, A. M. (2016) · IEEE Access · doi:10.1109/access.2016.2521727 · Cited by 139
Guo, J., Ling, S., Rechberger, C., & Wang, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_4 · Cited by 127
A new and secure authentication scheme for wireless sensor networks with formal proof
Wu, F., Xu, L., Kumari, S., & Li, X. (2017) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-015-0404-5 · Cited by 105
“All messages in the registration phase should be transmitted in a secure channel, such as the wired transport layer security protocol referred in [9] , WiFi Direct referred in [4] , or trusted couriers and dedicated communication link referred in [17] .”
BackgroundDrive-By Key-Extraction Cache Attacks from Portable Code
Genkin, D., Pachmanov, L., Tromer, E., & Yarom, Y. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93387-0_5 · Cited by 57
Fault-based attack of RSA authentication
Pellegrini, A., Bertacco, V., & Austin, T. (2010) · 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010) · doi:10.1109/date.2010.5456933 · Cited by 56
True Random Number Generation Via Sampling From Flat Band-Limited Gaussian Processes
Gov, N. C., Mihcak, M. K., & Ergun, S. (2011) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2010.2089561 · Cited by 48
“RUE random number generators (TRNG) are used for a variety of security applications and certain requirements on such generators are outlined in [ 1 ], [2].”
BackgroundSecond-level NIST Randomness Tests for Improving Test Reliability
Pareschi, F., Rovatti, R., & Setti, G. (2007) · 2007 IEEE International Symposium on Circuits and Systems (ISCAS) · doi:10.1109/iscas.2007.378572 · Cited by 45
New statistical randomness tests: 4-bit template matching tests
SULAK, F. (2017) · TURKISH JOURNAL OF MATHEMATICS · doi:10.3906/mat-1509-19 · Cited by 5
Metadata
- Authors
- Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A.
- Venue
- CRC Press eBooks
- Publisher
- CRC Press
- Published
- 2018-12-07
- OpenAlex
- W4289127653
- Cited by
- 2,896
- References
- 0
- FWCI
- 91.77
- 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.