Cited by 567Cryptographic Implementations and SecurityCoding theory and cryptographyCryptography and Residue Arithmetic

The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.

Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

Diffie, W., Hellman, M.E.·1977·Computer

DOI 10.1109/c-m.1977.217750

Open this paper in CoChat — free account

Abstract

For centuries, cryptography has been a valuable asset of the military and diplomatic communities. Indeed, it is so valuable that its practice has usually been shrouded in secrecy and mystery.

Integrity signals

Registry

Crossref · 10.1109/c-m.1977.217750

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Self-citation
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Shift Register Sequences
Golomb, S. W. (2014) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,196
Science and information theory
Charp, S. (1956) · Journal of the Franklin Institute · doi:10.1016/0016-0032(56)90094-1 · Cited by 1,524
Shift Register Sequences
Cattermole, K. W. (1968) · Electronics and Power · doi:10.1049/ep.1968.0141 · Cited by 1,326
Science and Information Theory
Brillouin, L., & Gottschalk, C. M. (1962) · Physics Today · doi:10.1063/1.3057866 · Cited by 313
Physical limits in digital electronics
Keyes, R. W. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9825 · Cited by 301
An extension of the Shannon theory approach to cryptography
Hellman, M. E. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055709 · Cited by 121
Self-citation
A note on Wyner's wiretap channel (Corresp.)
Carleial, A. B., & Hellman, M. E. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055721 · Cited by 54
Self-citation
ASSESSMENT OF THE NATIONAL BUREAU OF STANDARDS PROPOSED FEDERAL DATA ENCRYPTION STANDARD
Morris, R. H., Sloane, N. J. A., & Wyner, A. D. (1977) · Cryptologia · doi:10.1080/0161-117791833020 · Cited by 36

Show all 9 references

Research works printed but not linked: 12

1976, Report of the 1976 Workshop on Estimation of Significant Advances in Computer Technology
hellman, 1976, Results of an Initial Attempt to Cryptanalyze the NBS Data Encryption Standard
grubb, 1975, Subject Stanford University letter on length of key needed for NBS encryption algorithm
davis, 1975, NBS letter to the Hon Charles A Mosher
faggin, 1975, microprocessor technology: yesterday, today and tomorrow, EDN
faggin, 1975, the role of technology in microcomputer design and evolution, IEEE Trans on Circuits and Systems, 7, 4
hellman, 1975, letter to Dennis Branstad at NBS
diffie, 1975, Preliminary Remarks on the National Bureau of Standards Proposed Standard Encryption Algorithm for Computer Data Protection
yasaki, 1976, encryption algorithm: key size is the thing, Datamation, 164
jeffery, 1976, letter to M Hellman
1975, Federal Register, 40
1975, Federal Register, 40

Sorted by citations

Items 501–565 of 565

More on Cryptographic Techniques
Qian, Y., Ye, F., & Chen, H. (2021) · Wiley eBooks · doi:10.1002/9781119244400.ch5
Randomised Key Selection and Encryption of Plaintext Using Large Primes
Das, S., Bhattacharyya, S., & Sarkar, D. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-030-94507-7_4
Sichere Kryptosysteme
Oppliger, R. (1992) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-87230-2_3
References
Schneier, B. (2015) · Wiley eBooks · doi:10.1002/9781119183471.refs
Literaturverzeichnis
Furrer, F. J. (1981) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-5818-2_9
A Comprehensive Evaluation of Cryptographic Ciphers on Secure Publish/Subscribe Communications for IoT Devices
Kul, S., & Sayar, A. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-030-94191-8_93
Introduction
Penttinen, J. T. J. (2016) · doi:10.1002/9781119084402.ch1
Computer Science & Information Technology (CS & IT)
(2017) · doi:10.5121/csit.2017.71100
Proceedings of the IEEE Through 100 Years: 1970-1979 [Scanning Our Past]
IEEE History Center Staff (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2200556
Primerjava hitrosti simetričnih bločnih šifer
Kompara, M., Jerenko, T., & Hölbl, M. (2020) · Uporabna informatika · doi:10.31449/upinf.vol28.num3.94
Creating an Open Community of Cryptographers
Orman, H. K. (2022) · ACM eBooks · doi:10.1145/3549993.3550001
A Research of Image Encryption Algorithm Based on Double Time-delay Lorenz SystemPreprint
Zhou, Y., Zhu, E., & Li, S. (2022) · Research Square · doi:10.21203/rs.3.rs-2023375/v1
Algoritmos de Multiplicação de Montgomery em Hardware e Impacto no Algoritmo RSA
Bissoli, M. L., Branco, K. R. L. J. C., & Moreno, E. D. (2007) · doi:10.5753/wscad.2007.18760
Cryptanalysis of Magpie Block Cipher
Huang, J.-J., Wang, J.-S., Dai, W., et al. (2022) · IEEE International Conference on Information, Communication and Networks (ICICN) · doi:10.1109/icicn56848.2022.10006502
“The S-box of Magpie is modified from the S-box of PRESENT [15], and Magpie constructs a two-dimensional array Sbox [2], [16] as the nonlinear transformation.”
Method
Proceedings of the 1st Workshop on Enhanced Network Techniques and Technologies for the Industrial IoT to Cloud Continuum
(2023) · doi:10.1145/3609389
Foundation of Attribute‐Based Encryption
Xia, Q., Gao, J., Worae, D. A., et al. (2023) · doi:10.1002/9781119989387.ch1
Design of Security Chips in the IoT Ecosystem
Zhang, J. (2023) · Highlights in Science Engineering and Technology · doi:10.54097/hset.v70i.12478
“Among them, Whitfield Diffie and Martin Hellman proposed the famous "public key cryptosystem" in 1977, which laid the foundation of modern encryption technology and provided important support for later Internet of Things security [1].”
Background
Reusing Outputs from S-Boxes for Tamper Resistant Design
Ukezono, T., & Koyanagi, Y. (2023) · International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet58911.2023.10389410
Moderne symmetrische Chiffren – DES und AES
Buell, D. A. (2024) · Springer eBooks · doi:10.1007/978-3-031-50432-7_9
Falling into Bytes and Pieces – Cryptanalysis of an Apple Patent Application
Leander, G., Stennes, L., & Vorloeper, J. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-56232-7_13
MILP-Based for Middle-Meeting Cryptanalysis of BORON
付, 豪. (2024) · Modeling and Simulation · doi:10.12677/mos.2024.133234
Hybrid Encryption Algorithm: AES and PRESENT Lightweight with a Chaotic System (PHEPA-AES)
Khanjar, I. A., Hoomod, H. K., & Yousif, I. A. (2024) · Lecture notes in networks and systems · doi:10.1007/978-981-97-0892-5_52
Automated Analysis of the Lightweight Block Cipher Algorithm FBC
Lu, Y. (2024) · International Conference on Cryptography, Network Security and Communication Technology (CNSCT) · doi:10.1145/3673277.3673278
“Improving the efficiency of the analysis of lightweight algorithms will continue to be an important challenge in future research [8] [10].”
Meet-in-the-middle Cryptanalysis of IVLBC
Uchiyama, Y., & Igarashi, Y. (2024) · International Conference on Communications and Electronics (ICCE) · doi:10.1109/icce62051.2024.10634730
Meet-in-the-Middle Attack on the 15-Round Variant of the Lightweight Block Cipher Shakey for Protection of IoT Devices
Yada, K., & Igarashi, Y. (2024) · International Conference on Communications and Electronics (ICCE) · doi:10.1109/icce62051.2024.10634622
Knapsack Cryptographic Schemes
Desmedt, Y. (2024) · Springer eBooks · doi:10.1007/978-3-642-27739-9_323-2
Triple-DES
Cannière, C. D. (2024) · Springer eBooks · doi:10.1007/978-3-642-27739-9_621-2
The Machines Take Over: Computer Cryptography
Dooley, J. F. (2024) · History of computing · doi:10.1007/978-3-031-67485-3_10
Meet-in-the-middle attacks on reduced round TweAES and NBC
Sun, R., Du, X., Ying, X., et al. (2024) · Cryptologia · doi:10.1080/01611194.2024.2427651
“Among which, meet-in-the-middle (MITM) attack is an effective chosen plaintext attack proposed by Diffie and Hellman (1977) when they analyzed DES in 1977.”
MITM and Differential Fault Attack on ULBC
Ghorai, S., & Nandi, M. (2024) · Asian Conference on Communication and Networks (ASIANComNet) · doi:10.1109/asiancomnet63184.2024.10811080
“Difﬁe and Hellman ﬁrst introduced cryptographic attack meet-in-the-middle (MITM) in 1997 [1].”
Special-Purpose Cryptanalytical Hardware
Paar, C. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_47
Triple-DES
Cannière, C. D. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_621
Knapsack Cryptographic Schemes
Desmedt, Y. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_323
Meet-in-the-middle attack on round-reduced SCARF under single pair-of-tweaks setting
Chen, S., Hu, K., Liu, G., et al. (2025) · Designs Codes and Cryptography · doi:10.1007/s10623-025-01596-x
“Their results showed that SCARF is strong enough against common attacks such as differential [1], linear [10], impossible differential [2], integral [5, 7] and meet-in-the-middle [6] attacks.”
Meet-in-the-Middle Attack on Primitives with Binary Matrix Linear Layer
Hou, Q., Li, K., Zhang, G., Shen, Y., You, Q., & Dong, X. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-88661-4_3
“The Meet-in-the-middle (MitM) is a powerful cryptanalysis strategy first proposed by Diffie and Hellman to attack Double DES [12].”
Meet-in-the-Middle Attacks on Reduced-Round GRANULE
刘, 先. (2025) · Modeling and Simulation · doi:10.12677/mos.2025.148570
Research on Block Cipher Technology
Yin, Y. (2025) · ITM Web of Conferences · doi:10.1051/itmconf/20257803029
FLLBC: a low-power lightweight block cipher for internet of medical things
Xie, K., Li, L., & Song, Q. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae1388
Extended Meet in the Middle Attacks Using Cryptanalytic Approximations as DMZ
Biham, E., & Perle, S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-10759-6_11
Towards Contactless Data-Model Matching
Li, Z., & Wang, C. (2025) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3774939
“Existing methodologies can partially alleviate but not resolve data-model matching security and privacy issues [1, 20, 22, 42, 52, 59, 60, 67, 68].”
Übertragbarkeit existierender DuD-Konzepte und -Maßnahmen großer Betriebe auf die kleinen und mittleren Betriebe
Mucksch, H. (1988) · Deutscher Universitätsverlag eBooks · doi:10.1007/978-3-322-93828-2_6
Cryptography and Crypto-Systems
Davies, D. W. (1979) · Springer eBooks · doi:10.1007/978-94-009-9431-7_13
Cryptanalysis of PRINCEv2 using Biclique structures
Roy, H. S., Dey, P., Sarkar, S., et al. (2025) · Discrete Applied Mathematics · doi:10.1016/j.dam.2025.10.013
A Symbolic Analysis of Hash Functions Vulnerabilities in Maude-NPA
Hernández-Sánchez, A., & Escobar, S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-07891-9_10
Research on Encryption and Decryption Technology of Microservice Communication Based on Block Cipher
Zhang, S., Xie, X., Fan, T., & Wang, Y. (2026) · Electronics · doi:10.3390/electronics15020431
Quantum Meet-in-the-Middle Attacks on Two-Key 3DES
Gao, R., Wu, J., & Liang, M. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-4791-3_10
Automated Tool for Meet-in-the-Middle Attacks with Very Low Data and Memory Complexity
Vaziri, M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-15541-2_17
Design and Analysis of Lightweight Encryption Schemes
Huynh, L.-P. (2020) · theses.fr (ABES) · doi:10.70675/aafab450z906bz42b5z9146z457750e56902 · Cited by 1
Suivi de forme et reconstruction de champ dans un environnement logiciel contraint – une approche minimaliste et externaliste.
Savaroche, K. (2021) · doi:10.70675/50c1cc28zd47ez4f21z86b4z13ae22605e37
Improved Techniques in the Cryptanalysis of Symmetric Primitives
Flórez-Gutiérrez, A. (2022) · doi:10.70675/4f93004ezeca5z4f0czb79azcb3e53e24b41
Analysis of AES-based and arithmetization-oriented symmetric cryptography primitives
Bariant, A. (2024) · theses.fr (ABES) · doi:10.70675/91e98fcezfe0cz4b88z8e64zb2a679034ecd
Symmetric cryptanalysis ˸ from primitives to modes
Boissier, R. H. (2024) · theses.fr (ABES) · doi:10.70675/107ee980z2beez434aza1dbz37f6474d6e9f
Characterization of Masking Schemes Against Side-Channel Attacks in the Presence of Glitches
Simões, M. (2024) · theses.fr (ABES) · doi:10.70675/6dddcaa3za5d1z49b0zb410z15780f80f236
Improved quantum differential Meet-In-The-Middle attack and some applications
Wei, J., Zou, J. X., & Lin, R. (2025) · International Conference on Communication and Network Security (ICCNS) · doi:10.1145/3789456.3789469
Optimized Diamond Structure Construction and Its Application to Enhanced MITM Nostradamus Attacks to Enhanced MITM Nostradamus Attacks
Dai, J., Zou, J. X., Lin, R., & Lan, Q. (2025) · International Conference on Communication and Network Security (ICCNS) · doi:10.1145/3789456.3789468
Improved Classical Meet in the Middle Nostradamus Attack
Lin, R., Zou, J. X., Dai, J., & Wei, J. (2025) · International Conference on Communication and Network Security (ICCNS) · doi:10.1145/3789456.3789482
“The Meet-in-the-Middle (MITM) attack was first introduced by Diffie and Hellman [9].”
Exploiting Quantum Elongated Diamond Structure: Quantum-Enhanced Nostradamus Attacks and Applications
Zou, J., Yu, T., Dai, J., Shi, D., & Wu, W. (2026) · IACR Communications in Cryptology · doi:10.62056/a0c3wa0kr
Improved differential meet-in-the-middle attack using S-box linearization
Cao, Y., & Yang, Y. (2026) · Cybersecurity · doi:10.1186/s42400-025-00507-w
“Besides, meet-in-the-middle (Diffie and Hellman 1977), boomerang (Wagner 1999), rectangle (Biham et al. 2001), impossible differential (Knudsen 1998), higher-order differential (Knudsen 1994), differential-linear (Langford and Hellman 1994), invariant sub-space (Leander et al. 2011) and integral…”
Improved meet-in-the-middle collision attack on round-reduced Xoodyak
Gao, M., Zhang, S., Guan, J., et al. (2026) · Cybersecurity · doi:10.1186/s42400-025-00510-1
“The MitM attack, originally proposed by Diffie and Hellman, represents the generic cryptanalysis technique for symmetric-key primitives (Diffie and Hellman 1977).”
Meet-in-the-Middle Preimage Attacks with Multi-match on ASCON-XOF
Zhang, X., Shi, T., Guan, J., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-9284-5_7
SoK: The Cryptanalysis of SHA-3 Standard
Yan, H., Sun, A., Wang, J., & Li, Z. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-3018-1_5
Meet-in-the-Middle Attacks on Full ChiLow
Lambooij, E., Neumann, P., Verbauwhede, M., Wang, S., & Zhang, T. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35412-9_12
Quantum Computing and Ethical Exceptionalism: Lessons from Classical Computing
Mann, S. P., Aboy, M., Compagnucci, M. C., Davis, P. A. E., Earp, B. D., Minssen, T., & Lenarczyk, G. (2026) · Perspectives in law, business and innovation · doi:10.1007/978-981-92-3768-5_5
Improving the Quality of Secure Distributed Systems
Zorkadis, V. C. (1997) · Springer eBooks · doi:10.1007/978-0-387-35097-4_15
SECURITY FOR BROADBAND METROPOLITAN AND WIDE AREA NETWORK AT THE ACCESS INTERFACE LEVEL
Olayinka, A., & Adenuga, K. (2007) · KTH Publication Database DiVA (KTH Royal Institute of Technology)

Authors: Diffie, W., & Hellman, M. E.
Affiliations: Stanford University (US)
ORCID: Hellman, M.E.
Venue: Computer
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Published: 1977-06
Volume: 10
Issue: 6
Pages: 74-84
ISSN: 0018-9162 (ISSN-L)
DOI: 10.1109/c-m.1977.217750
OpenAlex: W1991374982
Semantic Scholar: 923f41cfd75b38e084078862319f4c8f3b3dfe47
Cited by: 567
References: 9
Citations by year: 2026: 12 · 2025: 26 · 2024: 37 · 2023: 32 · 2022: 19 · 2021: 32 · 2020: 17 · 2019: 16 · 2018: 23 · 2017: 17 · 2016: 21 · 2015: 36 · 2014: 27 · 2013: 30 · 2012: 31
FWCI: 9.18
Type: journal article
Language: en
Open access: closed
Licence: ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html (vor)
Locations: Computer (publishedVersion)
Topics: Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
Keywords: Data Encryption Standard, DES, cryptanalysis, exhaustive search, block cipher

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

Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

Abstract

Overview

Integrity signals

Verification

Claims the paper makes

Citations

Cites

Cited by

Related

Metadata

Record

About these checks