The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The MD5 Message-Digest Algorithm
Open accessAbstract
Status of this MemoThis memo provides information for the Internet community.It does not specify an Internet standard.Distribution of this memo is unlimited. MD5 Message-Digest AlgorithmApril 1992 /* Store state in digest */ Encode (digest, context->state, 16); /* Zeroize sensitive information.*/ MD5_memset ((POINTER)context, 0, sizeof (*context)); } /* MD5 basic transformation.Transforms state based on block.*/ static void MD5Transform (state, block) UINT4 state[4]; unsigned char block[64]; { UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16]; Decode (x, block, 64); /* Round 1 */ FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */ FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */ FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */ FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */ FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */ FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */ FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */ FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */ FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */ FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */ FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */ FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */ FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */ FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */ FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */ FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */ /* Round 2 */ GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */ GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */ GG (c, d, a, b, x[11]
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
Cites
Rivest, R. L. (1990) · doi:10.17487/rfc1186 · Cited by 607
Self-citation
Cited by
VSEARCH: a versatile open source tool for metagenomics
(2016) · doi:10.7717/peerj.2584 · Cited by 10,773
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
SPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Pappu, R., Recht, B., Taylor, J., & Gershenfeld, N. (2002) · Science · doi:10.1126/science.1074376 · Cited by 2,018
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
How to Break MD5 and Other Hash Functions
Wang, X., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_2 · Cited by 1,440
Security Proofs for Signature Schemes
Pointcheval, D., & Stern, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_33 · Cited by 1,077
Measuring ISP Topologies With Rocketfuel
Spring, N., Mahajan, R., Wetherall, D., & Anderson, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.822655 · Cited by 1,010
Efficient authentication and signing of multicast streams over lossy channels
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848446 · Cited by 946
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Bellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
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
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00019-2 · Cited by 830
A survey of key management for secure group communication
Rafaeli, S., & Hutchison, D. (2003) · ACM Computing Surveys · doi:10.1145/937503.937506 · Cited by 760
Advanced and authenticated marking schemes for IP traceback
Song, D. X., & Perrig, A. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916279 · Cited by 750
Watermarking, tamper-proofing, and obfuscation - tools for software protection
Collberg, C. S., & Thomborson, C. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1027797 · Cited by 735
Key establishment in large dynamic groups using one-way function trees
Sherman, A. T., & McGrew, D. A. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1199073 · Cited by 713
Perkins, C. E. (1997) · IEEE Communications Magazine · doi:10.1109/35.592101 · Cited by 675
VICTOR: genome-based phylogeny and classification of prokaryotic viruses
Meier-Kolthoff, J. P., & Göker, M. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx440 · Cited by 660
Comparing passwords, tokens, and biometrics for user authentication
O'Gorman, L. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.819611 · Cited by 659
PayWord and MicroMint: Two simple micropayment schemes
Rivest, R. L., & Shamir, A. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62494-5_6 · Cited by 621
Self-citationBlockchain Technology in Healthcare: A Comprehensive Review and Directions for Future Research
Khezr, S., Moniruzzaman, M., Yassine, A., & Benlamri, R. (2019) · Applied Sciences · doi:10.3390/app9091736 · Cited by 575
He says, she says: conflict and coordination in Wikipedia
Kittur, A., Suh, B., Pendleton, B. A., & Chi, E. H. (2007) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1240624.1240698 · Cited by 574
Certificate revocation and certificate update
Naor, M., & Nissim, K. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839932 · Cited by 493
RIPEMD-160: A strengthened version of RIPEMD
Dobbertin, H., Bosselaers, A., & Preneel, B. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_44 · Cited by 487
A study of practical deduplication
Meyer, D. T., & Bolosky, W. J. (2012) · ACM Transactions on Storage · doi:10.1145/2078861.2078864 · Cited by 476
An Efficient and Practical Solution to Remote Authentication: Smart Card
Chien, H.-Y., Jan, J.-K., & Tseng, Y.-M. (2002) · Computers & Security · doi:10.1016/s0167-4048(02)00415-7 · Cited by 455
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Schwartz, B., Kent, S. T., & Strayer, W. T. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.804827 · Cited by 450
Counterfeiting attacks on oblivious block-wise independent invisible watermarking schemes
Holliman, M., & Memon, N. (2000) · IEEE Transactions on Image Processing · doi:10.1109/83.826780 · Cited by 431
Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424
De Vleeschouwer, C., Delaigle, J.-F., & Macq, B. (2003) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2003.809729 · Cited by 417
The Security of Cipher Block Chaining
Bellare, M., Kilian, J., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_32 · Cited by 394
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
Joux, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_19 · Cited by 379
Second 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
Towards realizing random oracles: Hash functions that hide all partial information
Canetti, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052255 · Cited by 365
A Survey of BGP Security Issues and Solutions
Butler, K., Farley, T. R., McDaniel, P., & Rexford, J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2034031 · Cited by 350
Security Analysis of SHA-256 and Sisters
Gilbert, H., & Handschuh, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24654-1_13 · Cited by 347
A public key watermark for image verification and authentication
Wong, P. W. (2002) · Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269) · doi:10.1109/icip.1998.723526 · Cited by 344
Gennaro, R., & Rohatgi, P. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052235 · Cited by 338
The First Collision for Full SHA-1
Stevens, M., Bursztein, E., Karpman, P., Albertini, A., & Markov, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63688-7_19 · Cited by 335
A fast new DES implementation in software
Biham, E. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052352 · Cited by 328
Extreme Binning: Scalable, parallel deduplication for chunk-based file backup
Bhagwat, D., Eshghi, K., Long, D. D. E., & Lillibridge, M. (2009) · 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems · doi:10.1109/mascot.2009.5366623 · Cited by 325
On-line/off-line digital signatures
Even, S., Goldreich, O., & Micali, S. (1996) · Journal of Cryptology · doi:10.1007/bf02254791 · Cited by 318
Incremental Cryptography: The Case of Hashing and Signing
Bellare, M., Goldreich, O., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_22 · Cited by 312
On the (In)security of the Fiat-Shamir paradigm
Goldwasser, S., & Kalai, Y. T. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238185 · Cited by 311
Cherukuri, S., Venkatasubramanian, K. K., & Gupta, S. K. S. (2003) · 2003 International Conference on Parallel Processing Workshops, 2003. Proceedings. · doi:10.1109/icppw.2003.1240399 · Cited by 308
Digital signatures for flows and multicasts
Wong, C. K., & Lam, S. S. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793005 · Cited by 281
Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
Simon, D. R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054137 · Cited by 280
The design and implementation of a secure auction service
Franklin, M. K., & Reiter, M. K. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.502223 · Cited by 274
Collisions for the compression function of MD5
den Boer, B., & Bosselaers, A. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_26 · Cited by 273
Verifying completeness of relational query results in data publishing
Pang, H., Jain, A., Ramamritham, K., & Tan, K.-L. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066204 · Cited by 267
A password authentication scheme over insecure networks
Liao, I.-E., Lee, C.-C., & Hwang, M.-S. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.10.001 · Cited by 267
Trajectory sampling for direct traffic observation
Duffield, N. G., & Grossglauser, M. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929851 · Cited by 260
Efficient multi-server password authenticated key agreement using smart cards
Juang, W.-S. (2004) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2004.1277870 · Cited by 258
Abstracting application-level web security
Scott, D., & Sharp, R. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511498 · Cited by 257
Dynamics of Conflicts in Wikipedia
Yasseri, T., Sumi, R., Rung, A., Kornai, A., & Kertész, J. (2012) · PLoS ONE · doi:10.1371/journal.pone.0038869 · Cited by 257
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
Bellare, M., Guérin, R., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_2 · Cited by 255
Differential collisions in SHA-0
Chabaud, F., & Joux, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055720 · Cited by 209
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
DNS performance and the effectiveness of caching
Jung, J., Sit, E., Balakrishnan, H., & Morris, R. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.803905 · Cited by 182
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
Realizing an Internet of Secure Things: A Survey on Issues and Enabling Technologies
Hamad, S. A., Sheng, Q. Z., Zhang, W. E., & Nepal, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2976075 · Cited by 100
Near Similarity Search and Plagiarism Analysis
Stein, B., & zu Eissen, S. M. (2006) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/3-540-31314-1_52 · Cited by 62
Malware prevalence in the KaZaA file-sharing network
Shin, S., Jung, J., & Balakrishnan, H. (2006) · Proceedings of the 6th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1177080.1177125 · Cited by 49
An efficient security system for CABAC bin-strings of H.264/SVC
Asghar, M. N., & Ghanbari, M. (2013) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2012.2204941 · Cited by 38
Murasaki: A Fast, Parallelizable Algorithm to Find Anchors from Multiple Genomes
Popendorf, K., Tsuyoshi, H., Osana, Y., & Sakakibara, Y. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012651 · Cited by 32
Preliminary Study of Trusted Execution Environments on Heterogeneous Edge Platforms
Ning, Z., Liao, J., Zhang, F., & Shi, W. (2018) · 2018 IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec.2018.00057 · Cited by 28
Masquerading attacks detection in mobile ad hoc networks
Abbas, S., Faisal, M., Ur Rahman, H., Khan, M. Z., Merabti, M., & Khan, A. U. R. (2018) · IEEE Access · doi:10.1109/access.2018.2872115 · Cited by 28
Giorgino, T., Harvey, M. J., & de Fabritiis, G. (2010) · Computer Physics Communications · doi:10.1016/j.cpc.2010.04.007 · Cited by 8
Metadata
- Authors
- Rivest, R.
- Publisher
- RFC Editor
- Published
- 1992-04
- OpenAlex
- W2916086000
- Cited by
- 1,976
- References
- 1
- Type
- report
- Language
- en
- Open access
- gold
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.