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 201–300 of 565

A New Algorithm for the Unbalanced Meet-in-the-Middle Problem
Nikolić, I., & Sasaki, Y. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53887-6_23 · Cited by 11
“The standard MITM algorithm on triple encryption by Merkle and Hellman [16] follows T M = 2 3n , thus for M = 2 n 2 it requires time T = 2 5n 2 , which is larger than our time.”
Influential
Non-isomorphic Biclique Cryptanalysis and Its Application to Full-Round mCrypton.Preprint
Shakiba, M., Dakhilalian, M., & Mala, H. (2013) · IACR Cryptology ePrint Archive · Cited by 11
On Bruteforce-Like Cryptanalysis: New Meet-in-the-Middle Attacks in Symmetric Cryptanalysis
Rechberger, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37682-5_3 · Cited by 10
Generic MitM Attack Frameworks on Sponge Constructions
Dong, X., Zhao, B., Qin, L., Hou, Q., Zhang, S., & Wang, X. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68385-5_1 · Cited by 10
Improved Meet-in-the-Middle Distinguisher on Feistel Schemes
Lin, L., Wu, W., & Zheng, Y. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-31301-6_7 · Cited by 10
“If there is a truncated differential trail from xi[1][0] to xi+8[0][0] as the figure shows, then yi+1[0][0], yi+2[0][0, 1, 2, 5, 7], yi+3[0], yi+4[0] and yi+5[0][1, 2, 4, 7] can be determined by ∆xi[1][0], yi+1[0][0], yi+2[0][0, 1, 2, 5, 7],∆xi+8[0][0], yi+6[0][0], yi+5[0][0, 1, 2, 4, 7].”
BackgroundInfluential
Modeling Partial Attacks with Alloy
Lin, A. H., Bond, M., & Clulow, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17773-6_4 · Cited by 10
Biological versus computer viruses
Guinier, D. (1989) · ACM SIGSAC Review · doi:10.1145/70948.70949 · Cited by 10
Secure Key Exchange using RSA in Extended Playfair Cipher Technique
SinghChauhan, S., Singh, H., & Gurjar, R. N. (2014) · International Journal of Computer Applications · doi:10.5120/18277-9180 · Cited by 10
Reducing RFID reader load with the meet-in-the-middle strategy
Cheon, J. H., Hong, J., & Tsudik, G. (2012) · Journal of Communications and Networks · doi:10.1109/jcn.2012.6184545 · Cited by 10
Cryptanalysis of hardware-oriented ciphers the Knapsack generator, and SHA-1
Knellwolf, S. (2012) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-007554419 · Cited by 10
“Originally, the technique was used for block ciphers, starting with Diffie and Hellman showing that double encryption under two different keys does not double the security level [39], and later by Chaum and Evertse for key recovery attacks on reduced DES [32].”
Method
Automated Meet-in-the-Middle Attack Goes to Feistel
Hou, Q., Dong, X., Qin, L., Zhang, G., & Wang, X. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8727-6_13 · Cited by 9
Improved Cryptanalysis of Reduced-Version QARMA-64/128
Liu, Y., Zang, T., Gu, D., et al. (2020) · IEEE Access · doi:10.1109/access.2020.2964259 · Cited by 9
“Proof: In the following, we will show that the ordered sequence V 8 [1] is determined by 12 bytes, i.e., Z 5 [0 , 4 , 12] V 6 [1 , 6 , 9 , 10 , 11 , 15] V 7 [1 , 9 , 13] .”
BackgroundInfluential
Information Hiding in Audio Steganography using LSB Matching Revisited
Shanthakumari, R., Devi, E. M. R., Rajadevi, R., et al. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1911/1/012027 · Cited by 9
“Cryptography [4-6] and Steganography [7-9] are the two techniques used for information security.”
Method
A Robust and Fast Symmetric Text Encryption Algorithm Based on Fermat's Two Squares Theorem
Manoharan, R. K., Mani, R., Revathi, P., et al. (2023) · International Conference on Recent Advances in Electrical, Electronics, Ubiquitous Communication, and Computational Intelligence (RAEEUCCI) · doi:10.1109/raeeucci57140.2023.10134472 · Cited by 9
Improved Single-Key Distinguisher on HMAC-MD5 and Key Recovery Attacks on Sandwich-MAC-MD5
Sasaki, Y., & Wang, L. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43414-7_25 · Cited by 9
A meet-in-the-middle attack on reduced-round ARIA
Tang, X., Sun, B., Li, R., et al. (2011) · Journal of Systems and Software · doi:10.1016/j.jss.2011.04.053 · Cited by 9
Two New Schemes to Generate Automatic Variable Key (AVK) to achieve the Perfect Security in Insecure Communication Channel
Dutta, M. P., Banerjee, S., & Bhunia, C. T. (2015) · doi:10.1145/2743065.2743080 · Cited by 9
A New Cryptographic Scheme Utilizing the Difficulty of Big Boolean Satisfiability
Ahmad, W., & Rushdi, A. M. A. (2018) · International Journal of Mathematical Engineering and Management Sciences · doi:10.33889/ijmems.2018.3.1-005 · Cited by 9
“…to retrieve secret information such as linear attacks (Matsui and Yamagishi, 1992), extended linearization attacks (Courtois, 2003), Meet-in-Middle attacks (Diffie and Hellman, 1977), differential and side-channel attacks (Ambrose, 2009), as well as the use of SAT-Solvers (Eén and Sörensson, 2003).”
Background
La securite des primitives cryptographiques
Serge Vaudenay, B. (1995) · Cited by 9
Developing information policy
DUNN, D. A. (1982) · Telecommunications Policy · doi:10.1016/0308-5961(82)90003-9 · Cited by 9
Standardizing cryptographic services at OSI higher layers
Tardo, J. J. (1985) · IEEE Communications Magazine · doi:10.1109/mcom.1985.1092610 · Cited by 9
Robust high-capacity watermarking scheme based on Euclidean norms and quick coefficient alignment
Yang, C.-Y. (2015) · Multimedia Tools and Applications · doi:10.1007/s11042-015-3065-8 · Cited by 8
“To protect private data, several traditional cryptography techniques such as symmetric/asymmetric cryptographic schemes [6, 18] and hash algorithms [17] have been used.”
Method
CryptAttackTester: high-assurance attack analysis
Bernstein, D. J., & Chou, T. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68391-6_5 · Cited by 10
Markov Analysis of AVK Approach of Symmetric Key Based Cryptosystem
Prajapat, S., & Thakur, R. S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21413-9_12 · Cited by 8
The parallel-cut meet-in-the-middle attack
Nikolić, I., Wang, L., & Wu, S. (2014) · Cryptography and Communications · doi:10.1007/s12095-014-0118-1 · Cited by 8
“S S S S Ki-1[2] Ki-1[3] Ki-1[4] Ki-1[5] Ki-1[6] Ki-1[7]”
Method
Differential Analysis on Block Cipher PRIDE.
Zhao, J., Wang, X., Wang, M., et al. (2014) · Cited by 8
A Meet-in-the-Middle Attack on Round-Reduced mCrypton Using the Differential Enumeration Technique
Hao, Y., Bai, D., & Li, L. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11698-3_13 · Cited by 8
The State of Cryptocurrencies, Their Issues and Policy Interactions
Subramanian, R., & Chino, T. (2015) · Journal of international technology and information management · doi:10.58729/1941-6679.1045 · Cited by 8
“Diffie and Hellman conducted a comprehensive analysis of the DES in 1977 (W. Diffie & Hellman, 1977).”
Method
Meet-in-the-Middle Attacks on Reduced Round Piccolo
Tolba, M. F., Abdelkhalek, A., & Youssef, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29078-2_1 · Cited by 8
“The MitM attack was first proposed by Diffie and Hellman in 1977 to be used in the cryptanalysis of Data Encryption Standard (DES) [11].”
Cryptography and Digital Image Steganography Techniques
Sarmah, D. K., Kulkarni, A. J., & Abraham, A. (2020) · Intelligent systems reference library · doi:10.1007/978-3-030-42044-4_2 · Cited by 8
Content-Addressable Search Engines and DES-like Systems
Wayner, P. C. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_42 · Cited by 8
Computational Secure Physical Layer Algorithm for MIMO Wireless Systems
Mesleh, R., Alouneh, S., & Hiari, O. (2024) · IEEE Systems Journal · doi:10.1109/jsyst.2024.3370613 · Cited by 7
ChiLow and ChiChi: New Constructions for Code Encryption
Belkheyar, Y., Derbez, P., Ghosh, S., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91107-1_8 · Cited by 7
Cryptography-Based Secure Underwater Acoustic Communication for UUVs: A Review
Zhou, Q., Ye, Q., Lai, C., & Kou, G. (2025) · Electronics · doi:10.3390/electronics14122415 · Cited by 7
A provably secure non-iterative hash function resisting birthday attack
Su, S., Xie, T., & Lü, S. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.02.023 · Cited by 7
Fog-Assisted Dynamic IoT Device Access Management Using Attribute-Based Encryption
Routray, K., & Bera, P. (2024) · International Conference on Distributed Computing and Networking (ICDCN) · doi:10.1145/3631461.3631466 · Cited by 7
“Symmetric-key encryption schemes such as AES [18] and DES [11] are capable of ensuring secure access control for data stored on untrusted servers.”
Background
An innovative approach for pattern based image steganography
Mani, M. R., Lalithya, V., & Rekha, P. S. (2015) · IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES) · doi:10.1109/spices.2015.7091380 · Cited by 7
Cryptic Mining for Automatic Variable Key Based Cryptosystem
Prajapat, S., & Thakur, R. S. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.02.034 · Cited by 7
A high-payload, reversible data hiding scheme based on histogram modification in JPEG bitstream
liu, X., Chang, C., Lin, C., et al. (2016) · The Imaging Science Journal · doi:10.1080/13682199.2016.1213983 · Cited by 7
Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm
Ahmadi, S., & Aref, M. R. (2019) · IEEE Access · doi:10.1109/access.2019.2962101 · Cited by 7
Post Quantum Cryptography Algorithms: A Review and Applications
Paul, B., & Trivedi, G. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-99-1912-3_1 · Cited by 10
A New Security Evaluation Method Based on Resultant for Arithmetic-Oriented Algorithms
Yang, H.-S., Zheng, Q.-X., Yang, J., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0941-3_15 · Cited by 7
“Meet-in-the-middle (MITM) technique is a generic cryptanalytic approach for symmetric-key primitives, which was first introduced by Diffie and Hellman in 1977 [15] for the cryptanalysis of DES.”
Method
Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check
Angelova, V., & Borissov, Y. (2014) · Serdica Journal of Computing · doi:10.55630/sjc.2013.7.257-270 · Cited by 7
Cryptanalysis of Two-Round DES Using Genetic Algorithms
Song, J., Zhang, H., Meng Qingshu, B., et al. (2007) · Springer eBooks · doi:10.1007/978-3-540-74581-5_64 · Cited by 7
Meet-in-the-Middle Attacks on Reduced-Round Hierocrypt-3
Abdelkhalek, A., AlTawy, R., Tolba, M. F., et al. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_11 · Cited by 7
“In 1977, Diffie and Hellman were the first to propose the meet-in-the-middle (MitM) attack for the cryptanalysis of Data Encryption Standard (DES) [16].”
Cryptography old and new
Willett, M. (1982) · Computers & Security · doi:10.1016/0167-4048(82)90010-4 · Cited by 7
Symmetric Key Cryptosystem Based on Randomized Block Cipher
Aruljothi, S., & Venkatesulu, M. A. (2010) · International Conference on Future Information Technology · doi:10.1109/futuretech.2010.5482692 · Cited by 7
Biclique key recovery for ARIA‐256
Chen, S., & Xu, T. (2014) · IET Information Security · doi:10.1049/iet-ifs.2012.0353 · Cited by 7
Design and Implementation of FPGA Based Dual key Encryption
Lakshmi, B. V., Kirubakaran, E., & PRABAKAR, T. N. (2010) · International Journal of Computer Applications · doi:10.5120/714-1006 · Cited by 7
Ant-Crypto, a Cryptographer for Data Encryption Standard
Khan, S., Ali, A., & Durrani, M. Y. (2013) · Cited by 7
Meet-in-the-Middle Attacks on Round-Reduced Khudra
Tolba, M. F., Abdelkhalek, A., & Youssef, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24126-5_8 · Cited by 7
Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains
Durak, F. B., & Serge Vaudenay, B. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93387-0_23 · Cited by 7
“The MITM attack was introduced by Diffie and Hellman [10].”
Method
A Review On Digital Image Watermarking With Cryptosystem Techniques
Razak, M. K. A., Abdullah, K., & Halim, S. A. (2021) · doi:10.1109/iscaie51753.2021.9431809 · Cited by 7
“However, the DES is proven insecure due to the short key length of 56-bits, making brute force attacks feasible [33], especially in the current modern era.”
Background
An Optimized Sanitization Approach for Minable Data Publication
Yang, F., & Liao, X. (2022) · Big Data Mining and Analytics · doi:10.26599/bdma.2022.9020007 · Cited by 7
Towards a Cryptographic Minimal Design: The sLiSCP Family of Permutations
AlTawy, R., Rohit, R. S., He, M., Mandal, K., Yang, G., & Gong, G. (2018) · IEEE Transactions on Computers · doi:10.1109/tc.2018.2811467 · Cited by 7
“A meet-in-the-middle attack [45] divides the permutation into two or three parts such that some intermediate state variables can be computed by evaluating the permutation”
Background
Dynamic optimal pixel block selection data hiding approach using bit plane and image encryption
Roselinkiruba, R., & Sharmila, T. S. (2023) · International Journal of Information Technology · doi:10.1007/s41870-023-01363-y · Cited by 6
Quantum Differential Meet‐In‐The‐Middle Attack and Some Applications to Lightweight Ciphers
Xu, Y., Cai, B., Yuan, Z., Qin, S., Gao, F., & Wen, Q. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400157 · Cited by 6
New models for the cryptanalysis of ASCON
Degré, M., Derbez, P., Lahaye, L., & Schrottenloher, A. (2025) · Designs Codes and Cryptography · doi:10.1007/s10623-025-01572-5 · Cited by 6
“Meet-in-the-middle (MITM) attacks were introduced in the cryptanalysis of block ciphers by Diffie and Hellman [6], and were later extended to hash functions.”
FPGA implementation of Data Encryption Standard using time variable permutations
Oukili, S., & Bri, S. (2015) · doi:10.1109/icm.2015.7438004 · Cited by 6
A flexible and lightweight user‐demand DRM system for multimedia contents over multiple portable device platforms
Wu, E. H., Chuang, S.-M., Shih, C., Hsueh, H., Huang, S., & Huang, H. (2017) · Software Practice and Experience · doi:10.1002/spe.2479 · Cited by 6
“DES is considered to be insecure now because it is feasible to break a 56-bit key by brute-force attacks [18].”
Background
Improved meet-in-the-middle attacks on reduced-round Kalyna-128/256 and Kalyna-256/512
Lin, L., & Wu, W. (2017) · Designs Codes and Cryptography · doi:10.1007/s10623-017-0353-5 · Cited by 6
“In recent years, meet-in-the-middle attack [8] is widely researched due to its effectiveness against block cipher AES [3].”
Background
Cybersecurity, nuclear security, alan turing, and illogical logic
Hellman, M. E. (2017) · Communications of the ACM · doi:10.1145/3104985 · Cited by 6
Self-citation
Investigating Profiled Side-Channel Attacks Against the DES Key Schedule
Heyszl, J., Miller, K., Unterstein, F., et al. (2020) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2020.i3.22-72 · Cited by 6
Modern Symmetric Ciphers—DES and AES
Buell, D. A. (2021) · Undergraduate topics in computer science · doi:10.1007/978-3-030-73492-3_9 · Cited by 6
Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework
Zhang, K., Lai, X., Wang, L., Guan, J., Hu, B., Wang, S., & Shi, T. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01226-4 · Cited by 6
Specifying a principle of cryptographic justice as a response to the problem of going dark
Wilson, M. (2023) · Ethics and Information Technology · doi:10.1007/s10676-023-09707-9 · Cited by 6
Crypto-Mine: Cryptanalysis Via Mutual Information Neural Estimation
Kim, B. D., Vasudevan, V. A., Woo, J., et al. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10447256 · Cited by 6
“Although extensive research has been conducted on MI analysis on side channels to evaluate the security of cryptographic systems [13, 14], application of MI between the plaintext and ciphertext directly in the context of chosen plaintext attack [15, 16] has not been explored as much.”
Background
Meet-in-the-middle attack on digital signature schemes
Ohta, K., & Koyama, K. (2006) · Springer eBooks · doi:10.1007/bfb0030357 · Cited by 6
Tight security bounds for multiple encryption.
Dai, Y., & Steinberger, J. P. (2014) · Cited by 6
Biclique Attack of Block Cipher SKINNY
Zheng, Y., & Wu, W. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-54705-3_1 · Cited by 6
Improved Preimage Attacks on RIPEMD-160 and HAS-160
Shen, Y., & Wang, G. (2018) · KSII Transactions on Internet and Information Systems · doi:10.3837/tiis.2018.02.011 · Cited by 6
MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth
Ankele, R., Böhl, F., & Friedberger, S. J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93387-0_20 · Cited by 6
Two‐dimensional encryption system for secure free‐space optical communication of time‐series data streams
Ikeda, K., Sato, Y., Koyama, O., et al. (2019) · Electronics Letters · doi:10.1049/el.2019.0899 · Cited by 6
Absolute key variation technique of automatic variable key in cryptography
Goswami, R. S., Banerjee, S., Dutta, M. P., et al. (2015) · International Conference on Security of Information and Networks (SIN) · doi:10.1145/2799979.2800021 · Cited by 6
Preimage and pseudo-collision attacks on step-reduced SM3 hash function
Wang, G., & Shen, Y. (2013) · Information Processing Letters · doi:10.1016/j.ipl.2013.02.006 · Cited by 6
Green Cryptanalysis: Meet-in-the-Middle Key-Recovery for the Full KASUMI Cipher ?
Jia, K., Rechberger, C., & Wang, X. (2013) · Cited by 6
A secure computer network design
Cohen, F. (1985) · Computers & Security · doi:10.1016/0167-4048(85)90028-8 · Cited by 6
An Approach to Generate 2-Dimensional AVK to Enhance Security of Shared Information
Dutta, M. P., Banerjee, S., & Bhunia, C. T. (2015) · International Journal of Security and Its Applications · doi:10.14257/ijsia.2015.9.10.13 · Cited by 5
Context-Aware Attribute Based Access Control for Cloud-based SCADA Systems
Routray, K., & Bera, P. (2023) · doi:10.1145/3609389.3610569 · Cited by 5
Improved meet-in-the-middle attack on 10 rounds of the AES-256 block cipher
Lu, J., & Zhou, W. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01323-4 · Cited by 5
CryptoHHO: a bio-inspired cryptosystem for data security in Fog–Cloud architecture
Jawed, M. S., & Sajid, M. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06055-3 · Cited by 5
“DES [66] uses 64-bit keys, out of which only 56-bit is used to encrypt or decrypt the data.”
A successful attack against the DES
Hendessi, F., & Aref, M. R. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57936-2_32 · Cited by 5
Information Security Best Practices
Mayes, K. E., & Markantonakis, K. (2013) · Springer eBooks · doi:10.1007/978-1-4614-7915-4_6 · Cited by 5
Improved Multi-Dimensional Meet-in-the-Middle Cryptanalysis of Katan
Rasoolzadeh, S., & Raddum, H. (2016) · Tatra Mountains Mathematical Publications · doi:10.1515/tmmp-2016-0037 · Cited by 5
Improved meet‐in‐the‐middle attacks on reduced‐round Joltik‐BC
Li, M., & Chen, S. (2021) · IET Information Security · doi:10.1049/ise2.12019 · Cited by 5
On Weaknesses of Non—surjective Round Functions
Rijmen, V., Bart Preneel, A., & Win, E. D. (1997) · Selected Areas in Cryptography · doi:10.1007/978-1-4615-5489-9_4 · Cited by 5
An improved preimage attack against HAVAL-3
Guo, J., Su, C., & Yap, W. (2014) · Information Processing Letters · doi:10.1016/j.ipl.2014.10.016 · Cited by 5
Meet-in-the-middle Attack with Splice-and-Cut Technique on the 19-round Variant of Block Cipher HIGHT
Igarashi, Y., Sueyoshi, R., Kaneko, T., et al. (2015) · Lecture notes in electrical engineering · doi:10.1007/978-3-662-46578-3_50 · Cited by 5
Security Amplification against Meet-in-the-Middle Attacks Using Whitening
Fouque, P.-A., & Karpman, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45239-0_15 · Cited by 5
“Beyond the classical result on double-encryption (see e.g. [15]), MiTM attacks are effective at exploiting weaknesses in the key schedule algorithms of block ciphers or the message expansion of hash functions.”
Background
Memoryless Unbalanced Meet-in-the-Middle Attacks: Impossible Results and Applications
Sasaki, Y. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07536-5_16 · Cited by 5
A Related-Key Attack against Multiple Encryption Based on Fixed Points
Bay, A., Mashatan, A., & Serge Vaudenay, B. (2012) · Communications in computer and information science · doi:10.1007/978-3-642-35755-8_19 · Cited by 5
Securing wireless medical devices
Kaadan, A., & Refai, H. H. (2012) · Globecom · doi:10.1109/glocom.2012.6503234 · Cited by 5
Sparse Boolean equations and circuit lattices
Semaev, I. (2010) · Designs Codes and Cryptography · doi:10.1007/s10623-010-9465-x · Cited by 5
Open systems security: Traps and pitfalls
Reid, J. (1995) · Computers & Security · doi:10.1016/0167-4048(95)99313-e · Cited by 5
Security of computer communication
Branstad, D. K. (1978) · Communications Society · doi:10.1109/mcom.1978.1089777 · Cited by 5
Reversible data hiding for VQ indices using hierarchical state codebook mapping
Xia, B., Wang, A., Chang, C., et al. (2017) · Multimedia Tools and Applications · doi:10.1007/s11042-017-5490-3 · Cited by 5
Exhaustive Key Search
Wiener, M. J. (2006) · Springer eBooks · doi:10.1007/0-387-23483-7_147 · Cited by 5
Meet-in-the-Middle Attack on QARMA Block Cipher.Preprint
Zong, R. L., & Dong, X. (2016) · IACR Cryptology ePrint Archive · Cited by 5
Correlated Sequence Attack on Reduced-Round Simon-32/64 and Simeck-32/64.Preprint
Rohit, R. S., & Gong, G. (2018) · IACR Cryptology ePrint Archive · Cited by 5
Access control mechanisms for a network operating system
Wood, H. M., & Kimbleton, S. R. (1979) · International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817205 · Cited by 5

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