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 301–400 of 565

Modelling of a privacy language and efficient policy-based de-identification
Gerl, A. (2019) · doi:10.70675/904ebb6cz8ea6z499bzbbadz15dba552ae14 · Cited by 5
“For salary, Deletion is specified as the anonymization method with a Minimum and Maximum Anonymization Level of ′0 ′, which specifies that the value for salary is not altered for the processing. dsalary = (’salary’, ’Number’, true, ’Sensitive’, D̂G,am2, ĤEAD, D̂ESC) (5.48) am2 = (’Deletion’, {ama5,ama6}, ∅, ĤEAD, D̂…”
MethodInfluential
IOSHA - An Enhanced Hash Function for Secure and Efficient Key Generation in CRYSTALS-Dilithium for IoT
Borhan, R., Hossain, M. D., Taenaka, Y., & Kadobayashi, Y. (2024) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc62729.2024.00046 · Cited by 4
“Then, in the equation, if we put this probability, This comprehensive analysis establishes that the IOSHA exhibits formidable resistance against both birthday and random guess attacks, thus substantiating its robust collision resistance capabilities [23].”
Background
Differential Sieving for 2-Step Matching Meet-in-the-Middle Attack with Application to LBlock
AlTawy, R., & Youssef, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16363-5_8 · Cited by 4
Generalized MitM attacks on full TWINE
Tolba, M. F., & Youssef, A. (2015) · Information Processing Letters · doi:10.1016/j.ipl.2015.09.011 · Cited by 4
“A 3-subset MitM attack [6] is a generalization of the basic MitM which was originally proposed by Diffie and Helman [10].”
Background
Cryptanalysis of mCrypton‐64
Shakiba, M., Dakhilalian, M., & Mala, H. (2014) · International Journal of Communication Systems · doi:10.1002/dac.2721 · Cited by 4
“Biclique attack, although may be considered as an extension of the meet-in-the-middle attack [7], is one of the cryptanalytic techniques that brings new tools from the area of hash functions to the area of block cipher cryptanalysis [8, 9].”
Background
Adapting Rigidity to Symmetric Cryptography
Dunkelman, O., & Perrin, L. P. (2019) · doi:10.1145/3338500.3360335 · Cited by 4
“The ﬁrst class of attacks, ﬁrst proposed by Diﬃe and Hellman, takes advantage of insuﬃcient mixing between state (i.e. plaintext or intermediate encryption values) and key bits [DH77].”
Background
Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
Ma, Z., Li, M., & Chen, S. (2023) · IET Information Security · doi:10.1049/ise2.12114 · Cited by 4
3DAES: An Ensemble of Symmetric cryptographic protocol for Data security
Chowdhury, D., Mazumdar, S., & Bera, T. K. (2025) · International Conference on Power, Control and Computing Technologies (ICPC2T) · doi:10.1109/icpc2t63847.2025.10958680 · Cited by 4
“Concern was expressed regarding the 56—bit key size by Diffe and Hellman (in [6]).”
Cryptographic technology
Diffie, W. (1982) · ACM SIGACT News · doi:10.1145/1008902.1008903 · Cited by 4
Self-citation
Achieving non-repudiation of Web based transactions
Kalla, M., Wong, J. S. K., Mikler, A. R., et al. (1999) · Journal of Systems and Software · doi:10.1016/s0164-1212(99)00055-2 · Cited by 4
Improved Single-Key Distinguisher on HMAC-MD5 and Key Recovery Attacks on Sandwich-MAC-MD5 and MD5-MAC
Sasaki, Y., Wang, G., & Wang, L. (2015) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e98.a.26 · Cited by 4
Implementation of New Method to Generate a Key in Automatic Variable Key for Perfect Security
Das, M., Goswami, R. S., & Bhunia, C. T. (2016) · International Journal of Security and Its Applications · doi:10.14257/ijsia.2016.10.4.33 · Cited by 4
Logical Reasoning to Detect Weaknesses About SHA-1 and MD4/5
Legendre, F., Dequen, G., & Krajecki, M. (2014) · Cited by 4
On the application of symbolic regression and genetic programming for cryptanalysis of symmetric encryption algorithm
Smetka, T., Homoliak, I., & Hanáček, P. (2016) · IEEE International Carnahan Conference on Security Technology (ICCST) · doi:10.1109/ccst.2016.7815720 · Cited by 4
“At the time of introducing DES as a standard, there were some concerns and doubts about its safety – particularly by Hellman and Diffie [3], [4].”
Background
A cluster-based practical key recovery attack on reduced-round AES using impossible-differential cryptanalysis
Pal, D., Ali, M. R., Das, A., et al. (2022) · The Journal of Supercomputing · doi:10.1007/s11227-022-04872-y · Cited by 4
“Diffie and Hellman [16] first proposed the concept of Meet in the Middle Attack (MITM).”
Background
An image encryption algorithm based on the double time-delay Lorenz system
Zhou, Y., Zhu, E., & Li, S. (2023) · Mathematical Biosciences & Engineering · doi:10.3934/mbe.2023821 · Cited by 4
Meet-in-the-middle attacks on AES with value constraints
Dong, X., Liu, J., Wei, Y., Gao, W., & Chen, J. (2024) · Designs Codes and Cryptography · doi:10.1007/s10623-024-01396-9 · Cited by 4
“The MITM attack [14, 18] consists of two phases: the precomputation phase and the online phase.”
(Pseudo-) Preimage Attacks on Step-Reduced HAS-160 and RIPEMD-160
Wang, G., & Shen, Y. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13257-0_6 · Cited by 4
Security analysis of M‐DES and key‐based coded permutation ciphers in wireless channels
Yap, W., Heng, S., & Goi, B. (2018) · IET Communications · doi:10.1049/iet-com.2017.0566 · Cited by 4
Preimage Attacks on Reduced DHA-256.
Zhong, J., & Lai, X. (2009) · Cited by 4
Solving the Discrete Logarithm Problem for Packing Candidate Preferences
Heather, J., Culnane, C., Schneider, S. A., et al. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40588-4_15 · Cited by 4
The higher-order meet-in-the-middle attack and its application to the Camellia block cipher
Lu, J., Wei, Y., Kim, J., et al. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.01.031 · Cited by 4
Applying public key distribution to local area networks
Schanning, B. P. (1982) · Computers & Security · doi:10.1016/0167-4048(82)90046-3 · Cited by 4
New observation on the key schedule of RECTANGLE
Yan, H., Luo, Y., Chen, M., et al. (2019) · Science China Information Sciences · doi:10.1007/s11432-018-9527-8 · Cited by 4
Cryptography for computer security: Making the decision
Fisher, W. W. (1984) · Computers & Security · doi:10.1016/0167-4048(84)90044-0 · Cited by 4
Strategies for extending the useful lifetime of DES
Carroll, J. M. (1987) · Computers & Security · doi:10.1016/0167-4048(87)90065-4 · Cited by 4
Scrutinizing the Security of AES-Based Hashing and One-Way Functions
Chen, S., Guo, J., List, E., Shi, D., & Zhang, T. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5018-0_6 · Cited by 4
Fast Fourier Transform Key Recovery for Integral Attacks
Todo, Y., & Aoki, K. (2015) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e98.a.1944 · Cited by 3
A novel color image encryption method using Fibonacci transformation and chaotic systems
Xu, C. (2024) · ICST Transactions on Scalable Information Systems · doi:10.4108/eetsis.5452 · Cited by 3
A Survey on Machine Learning approaches to Cryptanalysis
Baragada, S., & Reddy, P. S. (2013) · Cited by 3
A Meet-in-the-Middle Attack on Reduced-Round Crypton *
Liu, C., Liao, F., & Wei, H. (2012) · Cited by 3
Key Diffusion Approach for AVK based Cryptosystem
Prajapat, S., & Thakur, R. S. (2016) · International Conference on Information and Communication Technology for Competitive Strategies (ICTCS) · doi:10.1145/2905055.2905288 · Cited by 3
Generation of Variable Session Keys Based on Piggybacking Strategy
Carvalho Sergio, T., Dutta, M. P., & Banerjee, S. (2015) · International Conference on Advances in Computing, Electronics and Communication (ACEC) · doi:10.15224/978-1-63248-064-4-21 · Cited by 3
Practical Attacks on Reduced-Round 3D and Saturnin
Hou, T., Cui, T., & Zhang, J. (2021) · The Computer Journal · doi:10.1093/comjnl/bxab174 · Cited by 3
Data security: a cryptographic approach
Raina, A. K., & Kak, S. C. (1982) · Proceedings of the Indian Academy of Sciences Section C Engineering Sciences · doi:10.1007/bf02843103 · Cited by 3
OSHA: A General-purpose and Next Generation One-way Secure Hash Algorithm
Patgiri, R. (2022) · IEEE/ACIS International Conference on Computer and Information Science (ICIS) · doi:10.1109/icis54925.2022.9882430 · Cited by 3
“Meet-in-the-middle [25] performs an exhaustive search on key spaces to achieve preimage attacks.”
Background
Securing confidential data in the cloud environment by using DNA computing
Agrawal, D., & Minocha, S. (2022) · Advances in computers · doi:10.1016/bs.adcom.2022.08.006 · Cited by 3
Differential, Linear, and Meet‐in‐the‐Middle Attacks on the Lightweight Block Cipher RBFK
Sugio, N. (2023) · IET Information Security · doi:10.1049/2023/6691726 · Cited by 3
Cryptanalysis of HALFLOOP Block Ciphers
Leander, G., Rasoolzadeh, S., & Stennes, L. (2023) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2023.i4.58-82 · Cited by 3
“In this section, we present a time-data-memory trade-off (TDM-TO) attack [DH77] which works on all three versions of full-round HALFLOOP .”
Method
Meet-in-the-Middle Key Recovery Attacks on Rocca Using Differential and Integral Properties
Song, C. H., Wu, W., & Zhang, L. (2025) · Chinese Journal of Electronics · doi:10.23919/cje.2024.00.032 · Cited by 3
Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications
Dinur, I., Dunkelman, O., Keller, N., et al. (2018) · Journal of Cryptology · doi:10.1007/s00145-018-9303-2 · Cited by 3
“For example, Difﬁe and Hellman’s original meet-in-the-middle attack [8], Lucks’ improvement for Triple-DES [23], or Biham’s work on triple modes of operation [6].”
Background
A new strong user authentication scheme with local certification authority for internet of things based cloud computing services
Youssefi, M. A., & Mouhsen, A. (2019) · International Journal of Advanced Technology and Engineering Exploration · doi:10.19101/ijatee.2019.650051 · Cited by 3
“This attack is also known as exhaustive search of passwords [9, 10].”
Background
A software based approach to secure voice applications
Troullinos, G. (2002) · IEEE International Conference on Electronics, Circuits and Systems (ICECS) · doi:10.1109/icecs.1996.582747 · Cited by 3
Analysis of Simplified DES Algorithms
Konikoff, J., & Toplosky, S. (2010) · Cryptologia · doi:10.1080/01611191003646433 · Cited by 3
Security systems of point-of-sales devices
Yang, C., Tian, G. Y., & Ward, S. (2006) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-006-0638-8 · Cited by 3
High Imperceptible Data Hiding using Remainder Method
Datta, B., Bandyopadhyay, S. K., & Kedia, A. (2014) · International Journal of Computer Applications · doi:10.5120/16693-6817 · Cited by 3
Recent Developments in Cryptography
Piper, F. C. (1988) · Springer eBooks · doi:10.1007/978-94-009-2794-0_13 · Cited by 3
Preimage Attack on Reduced DHA-256
Zhong, J., & Lai, X. (2011) · Journal of information science and engineering · Cited by 3
Scramble the Password Before You Type It
Li, J., Stecker, L., Zeigler, E., et al. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-77712-2_105 · Cited by 3
Quantum attacks against iterated block ciphers
Kaplan, M. A. (2016) · Математические вопросы криптографии · doi:10.4213/mvk185 · Cited by 3
FFT-Based Key Recovery for the Integral Attack.
Todo, Y. (2014) · Cited by 3
Improved Meet-in-the-Middle Attacks on Reduced-Round Tweakable Block Cipher Deoxys-BC
Li, M., & Chen, S. (2021) · The Computer Journal · doi:10.1093/comjnl/bxab076 · Cited by 3
Enhancing AES Algorithm with DNA Computing
Abood, O. G., Mesbah, S., & Guirguis, S. K. (2018) · International Conference on Computer Theory and Applications (ICCTA) · doi:10.1109/iccta45985.2018.9499202 · Cited by 3
The Machines Take Over: Computer Cryptography
Dooley, J. F. (2018) · History of computing · doi:10.1007/978-3-319-90443-6_10 · Cited by 3
Resilience as 'Political Decentralization': An Alternate History of the Cypherpunks Origins of Decentralised TechnologyPreprint
Nabben, K. (2021) · SSRN Electronic Journal · doi:10.2139/ssrn.3938626 · Cited by 3
Study on Fog Computing Enabled Data Processing
Dhingra, M., Goyal, S. J., & Goyal, R. (2024) · doi:10.46632/eae/3/1/1 · Cited by 2
On the Effectiveness of TMTO and Exhaustive Search Attacks
Mukhopadhyay, S., & Sarkar, P. (2006) · Lecture notes in computer science · doi:10.1007/11908739_24 · Cited by 2
Developing an Empirical Algorithm for Protecting Text-Based CAPTCHAs against Segmentation Attacks
Pan, L., & Zhou, Y. (2013) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2013.77 · Cited by 2
Differential fault analysis and meet-in-the-middle attack on the block cipher KATAN32
Zhang, W., Liu, F., Liu, X., et al. (2013) · Journal of Shanghai Jiaotong University (Science) · doi:10.1007/s12204-013-1377-2 · Cited by 2
Meet-in-the-middle Attack on the 6-round Variant of the Block Cipher PRINCE
Igarashi, Y., Kaneko, T., Setoguchi, S., et al. (2014) · Advanced science and technology letters · doi:10.14257/astl.2014.51.57 · Cited by 2
“MITM attack was proposed by Diffie and Hellman in 1977 as a generic method to analyze symmetric-key cryptographic algorithms [2], [3], [4].”
Method
Improved Meet-in-the-Middle Attacks on Round-Reduced ARIA
Bai, D., & Yu, H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-27659-5_11 · Cited by 2
A Workload Division Differential Privacy Algorithm to Improve the Accuracy for Linear Computations
Li, J., Ma, H., Wu, G., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-50417-5_33 · Cited by 2
New Symmetric Key Cipher Based on Quasigroup
Kumar, U., Agarwal, A., & Venkaiah, V. C. (2022) · Lecture notes in networks and systems · doi:10.1007/978-981-16-8664-1_8 · Cited by 2
The differential meet-in-the-middle attack on FUTURE and CRAFT
Lin, H., Zou, J., & Jiayin Li, A. (2023) · International Conference on Communication and Network Security (ICCNS) · doi:10.1145/3638782.3638805 · Cited by 2
“TheMITM attack, initially proposed by Diffie and Hellman in the 1970s [5], is a widely employed methodology for cryptanalysis of symmetric-key primitives.”
Method
The Exact Multi-user Security of 2-Key Triple DES
Naito, Y., Sasaki, Y., & Sugawara, T. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58868-6_5 · Cited by 2
That’s AmorE: Amortized Efficiency for Pairing Delegation
Keilty, A. P., Aranha, D. F., Pagnin, E., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01913-4_7 · Cited by 2
Crack me if you can: hardware acceleration bridging the gap between practical and theoretical cryptanalysis?
Khairallah, M., Najm, Z., Chattopadhyay, A., et al. (2018) · International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation · doi:10.1145/3229631.3239366 · Cited by 2
Applying Time-Memory-Data Trade-Off to Meet-in-the-Middle Attack
Choy, J., Khoo, K., & Loe, C.-W. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88625-9_11 · Cited by 2
Breaking Legacy Banking Standards with Special-Purpose Hardware
Güneysu, T. E., & Paar, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85230-8_10 · Cited by 2
How to Launch A Birthday Attack Against DES.
Cao, Z. (2008) · Cited by 2
Design principles of DES-like ciphers: A historical overview
Loebenberger, D., & Nüsken, M. (2015) · Cryptologia · doi:10.1080/01611194.2015.1028681 · Cited by 2
Message Guided Adaptive Random Steganography using Countingout Embedding
Rakesh, R., Devathi, S., Sekaran, P. S. C., & Tatikonda, B. S. K. (2011) · International Journal of Computer Applications · doi:10.5120/2949-3951 · Cited by 2
A Meet-in-the-Middle Attack on Reduced-Round Crypton
刘, 超. (2012) · Software Engineering and Applications · doi:10.12677/sea.2012.12004 · Cited by 2
An LSI Digital Encryption Processor (DEP)
Fairfield, R. C., Matusevich, A., & Plany, J. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_13 · Cited by 2
Securing large datasets involving fast-performing key bunch matrix block cipher
Kakarla, S. (2018) · Elsevier eBooks · doi:10.1016/b978-0-12-815368-0.00004-x · Cited by 2
Lightweight Cryptography in Cloud-Based IoT
Guria, P., & Bhattacharyya, A. (2021) · Advances in web technologies and engineering book series · doi:10.4018/978-1-7998-6981-8.ch010 · Cited by 2
Matrix Power Function Based Block Cipher Operating in CBC Mode
Dindienė, L., Mihalkovich, A., Lukšys, K., et al. (2022) · Mathematics · doi:10.3390/math10122123 · Cited by 2
Meet-in-the-Middle Differential Fault Analysis on ITUbee Block Cipher
Kang, Y., Yu, Q., Qin, L., et al. (2023) · Symmetry · doi:10.3390/sym15061196 · Cited by 2
“Proposed initially by Diffie and Hellman [31], the meet-in-the-middle strategy stands as a pivotal tool in symmetric-key primitive cryptanalysis, specifically targeting block ciphers.”
Background
Automatic Search of Meet-in-the-Middle Differential Fault Analysis on AES-like Ciphers
Yu, Q., Dong, X., Qin, L., et al. (2023) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2023.i4.1-31 · Cited by 2
Collision Attack on the Full Extended MD4 and Pseudo-Preimage Attack on RIPEMD
Wang, G. (2013) · Journal of Computer Science and Technology · doi:10.1007/s11390-013-1317-5 · Cited by 2
Second Preimage Attack on SHAMATA-512
Ideguchi, K., & Watanabe, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10628-6_12 · Cited by 2
Land mobile voice privacy communications
Hennen, H. A. (1980) · IEEE Vehicular Technology Conference · doi:10.1109/vtc.1980.1622860 · Cited by 2
A software scheme for user-controlled file encryption
Oldehoeft, A. E., & McDonald, R. (1984) · Computers & Security · doi:10.1016/0167-4048(84)90024-5 · Cited by 2
Structure the Use: Notes on a Method for Designing Computing System Environments
Schorer, P. (1981) · Computer · doi:10.1109/c-m.1981.220299 · Cited by 2
Securing a wireless local area network - using standard security techniques
Ekström, D. (2003) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 2
Cryptographic Techniques
Qian, Y., Ye, F., & Chen, H. (2021) · doi:10.1002/9781119244400.ch4 · Cited by 2
Triple DES
Cannière, C. D. (2011) · Springer eBooks · doi:10.1007/978-1-4419-5906-5_621 · Cited by 2
Cryptographic Protection of Computer-Based Data Files*
Murray, T. J. (1979) · MIS Quarterly · doi:10.2307/249145 · Cited by 2
Improved Meet-in-the-Middle Attacks on Nine Rounds of the AES-192 Block Cipher
Lu, J., & Zhou, W. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58868-6_6 · Cited by 1
Security Analysis of the Lightweight Cryptographic Algorithm Sycon for IoT Devices
Jia, J., Wang, G., Li, Y., Ni, J., & Hu, J. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3585031 · Cited by 1
“MitM attacks were initially introduced by Difﬁe and Hellman [18] for block cipher analysis [19], [20], [21], [22] and later extended to hash functions [23], [24], [25].”
Triangulating Meet-in-the-Middle Attack
Zhao, B., Hou, Q., Qin, L., & Dong, X. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01901-1_9 · Cited by 1
Neural cryptography: Synergy and conflict between neural networks and cryptographic systems
Zhong, Y., Gu, J., & Yu, X. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.133084 · Cited by 1
An automated model for differential meet in the middle attacks on AndRX ciphers
Chakraborty, D., Sahoo, S., Nguyen, P. H., et al. (2026) · Scientific Reports · doi:10.1038/s41598-026-41390-w · Cited by 1
Browser Based Agile E-Voting System
Simhalu, S. K., & Takeda, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-76929-3_7 · Cited by 1
A Brief Survey of Research Jointly with Jean-Jacques Quisquater
Desmedt, Y. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28368-0_3 · Cited by 1
An interview with Richard Roe
Battle, R. K. (1984) · International Journal of Project Management · doi:10.1016/s0263-7863(84)80008-3 · Cited by 1
CRYPTOGRAPHY AND CRYPTANALYSIS ON RECONFIGURABLE DEVICES Security Implementations for Hardware and Reprogrammable Devices
Tim Erhan, G. (2009) · Cited by 1
A Higher Order Key Partitioning Attack with Application to LBlock
AlTawy, R., Tolba, M. F., & Youssef, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-18681-8_17 · Cited by 1
A semantically secure public key cryptoscheme using bit-pair shadows
Su, S., Lü, S., Xu, M., et al. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.04.017 · Cited by 1
FPGA BASED HARDWARE KEY FOR TEMPORAL ENCRYPTION
Lakshmi, B. V., Kirubakaran, E., & T.N.Prabakar (2010) · ICTACT Journal on Communication Technology · doi:10.21917/ijct.2010.0022 · Cited by 1

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