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 101–200 of 565

Automated Analysis of Security APIs
Lin, A. H. (2005) · Cited by 35
Finding Motifs in Promoter Regions
Hertzberg, L., Zuk, O., Getz, G. A., et al. (2005) · Journal of Computational Biology · doi:10.1089/cmb.2005.12.314 · Cited by 35
“This can be done efficiently using the " meet in the middle " approach (Diffie and Hellman, 1977), often used in cryptology.”
Method
Data Encryption Standard (DES)
Biryukov, A., & Cannière, C. D. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_568 · Cited by 35
Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example
Arratia, R. A., & DeSalvo, S. (2016) · Combinatorics Probability Computing · doi:10.1017/s0963548315000358 · Cited by 34
“Such a comparison of two lists has been exploited previously, as in [17], the meet-in-the-middle attack, and in biological sequence matching [8, 6], where for two independent sequences of i.”
Background
Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64
Zhu, B., & Gong, G. (2014) · Cryptography and Communications · doi:10.1007/s12095-014-0102-9 · Cited by 34
Programming the Demirci-Selçuk Meet-in-the-Middle Attack with Constraints
Shi, D., Sun, S., Derbez, P., Todo, Y., Sun, B., & Hu, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03329-3_1 · Cited by 36
“ciphers [39, 40] and on a number of hash functions, e.”
Background
Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
Gaži, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40041-4_30 · Cited by 34
A Single-Key Attack on the Full GOST Block Cipher
Isobe, T. (2012) · Journal of Cryptology · doi:10.1007/s00145-012-9118-5 · Cited by 34
Cryptanalysis of Four-Round DES Based on Genetic Algorithm
Song, J., Zhang, H., Meng Qingshu, B., et al. (2007) · International Conference on Wireless Communications, Networking and Mobile Computing · doi:10.1109/wicom.2007.580 · Cited by 34
sLiSCP: Simeck-Based Permutations for Lightweight Sponge Cryptographic Primitives
AlTawy, R., Rohit, R. S., He, M., et al. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_7 · Cited by 34
“A meet-in-the-middle attack [38] divides the permutation into two or three parts such that some intermediate state variables can be computed by evaluating the permutation and its inverse using only incomplete sets of the input and output bits, respectively.”
Background
DCT-based reversible data hiding scheme
Lin, C., & Shiu, P.-F. (2009) · International Conference on Ubiquitous Information Management and Communication (IMCOM) · doi:10.1145/1516241.1516298 · Cited by 34
Time-memory-processor trade-offs
Amirazizi, H. R., & Hellman, M. E. (1983) · IEEE Transactions on Information Theory · doi:10.1109/18.6030 · Cited by 33
Self-citation
New Preimage Attacks against Reduced SHA-1
Knellwolf, S., & Khovratovich, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_22 · Cited by 33
“Originally, the technique was used for block ciphers, starting with Diffie and Hellman [8] showing that double encryption under two different keys does not”
Method
JPEG based steganography methods using Cohort Intelligence with Cognitive Computing and modified Multi Random Start Local Search optimization algorithms
Sarmah, D. K., & Kulkarni, A. J. (2017) · Information Sciences · doi:10.1016/j.ins.2017.11.027 · Cited by 32
Meet-in-the-Middle Preimage Attacks on Sponge-Based Hashing
Qin, L., Hua, J., Dong, X., Yan, H., & Wang, X. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30634-1_6 · Cited by 32
“The Meet-in-the-Middle (MitM) attack proposed by Diffie and Hellman in 1977 [22] is a generic technique for cryptanalysis of symmetric-key primitives.”
Integer Linear Programming for Three-Subset Meet-in-the-Middle Attacks: Application to GIFT
Sasaki, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-97916-8_15 · Cited by 32
Block Ciphers and Stream Ciphers: The State of the Art.
Biryukov, A. (2004) · Cited by 31
Meet-in-the-Middle Attacks on Reduced-Round XTEA
Sekar, G., Mouha, N., Velichkov, V., & Bart Preneel, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19074-2_17 · Cited by 31
Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
Gaži, P., & Tessaro, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_6 · Cited by 31
Simplified MITM Modeling for Permutations: New (Quantum) Attacks
Schrottenloher, A., & Stevens, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15982-4_24 · Cited by 31
“MITM attacks can be traced back to Diffie and Hellman’s time-memory trade-off on Double-encryption [23].”
Exploiting Parallelism in Hardware Implementation of the DES
Broscius, A. G., & Smith, J. M. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_30 · Cited by 31
Cryptographic Schemes Based on the ASASA Structure: Black-box, White-box, and Public-key
Biryukov, A., Bouillaguet, C., & Khovratovich, D. (2014) · Open Repository and Bibliography (University of Luxembourg) · Cited by 28
Is the data encryption standard a group
Kaliski, B. S., Rivest, R. L., & Sherman, A. T. (1986) · Theory and Application of Cryptographic Techniques · Cited by 28
Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys
Moore, J. H., & Simmons, G. J. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.233150 · Cited by 27
Quantum attacks against iterated block ciphersPreprint
Kaplan, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.1434 · Cited by 33
Tri-layer stego for enhanced security - a keyless random approach
Amirtharajan, R., & Rayappan, J. B. B. (2009) · doi:10.1109/imsaa.2009.5439438 · Cited by 25
Meet-in-the-Middle Attacks on Reduced-Round Midori64
Lin, L., & Wu, W. (2017) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2017.i1.215-239 · Cited by 25
Security in open networks and distributed systems
Janson, P. A., & Molva, R. A. (1991) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(91)90092-q · Cited by 25
Differential Meet-In-The-Middle Cryptanalysis
Boura, C., David, N., Derbez, P., Leander, G., & Naya‐Plasencia, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38548-3_9 · Cited by 25
“Among these first and most important attacks are, of course meet-in-the-middle [21], differential [8] and linear cryptanalysis [39], ©IACR 2023.”
Meet-in-the-Middle Attack on 8 Rounds of the AES Block Cipher under 192 Key Bits
Wei, Y., Lu, J., & Hu, Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21031-0_17 · Cited by 24
The design and implementation of a symmetric encryption algorithm based on DES
Yingbing, Z., & Li, Y. (2014) · IEEE International Conference on Software Engineering and Service Science (ICSESS) · doi:10.1109/icsess.2014.6933619 · Cited by 24
New Attacks on Feistel Structures with Improved Memory Complexities
Dinur, I., Dunkelman, O., Keller, N., & Adi Shamir, Z. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6_21 · Cited by 24
On the effective subkey space of some image encryption algorithms using external key
Yap, W., Phan, R. C. ‐., Goi, B., Yau, W., & Heng, S. (2016) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2016.06.005 · Cited by 24
Dependence of output on input in DES: Small avalanche characteristics
Desmedt, Y., Quisquater, J.-J., & Davio, M. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_28 · Cited by 24
Improved Meet-in-the-Middle Attacks on AES-192 and PRINCE.Preprint
Li, L., Jia, K., & Wang, X. (2013) · IACR Cryptology ePrint Archive · Cited by 24
Linear cryptanalysis of substitution-permutation networks
Meijer, H., Tavares, S. E., & Keliher, L. (2004) · Cited by 23
Cryptology: The Mathematics of Secure Communication
Simmons, G. J., Grattan-Guinness, I., Garder, A. O., & Poston, T. (1979) · The Mathematical Intelligencer · doi:10.1007/bf03028244 · Cited by 23
DeCrypt: a 3DES inspired optimised cryptographic algorithm
Chowdhury, D., Dey, A., Garai, R., Adhikary, S., Dwivedi, A. D., Ghosh, U., & Alnumay, W. S. (2022) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-022-04379-7 · Cited by 23
“Diffie and Hellman (in Diffie and Hellman 1977) raised concern about the key size of 56 bits.”
Background
HDLBC: A lightweight block cipher with high diffusion
Li, Y., Feng, J., Zhao, Q., & Wei, Y. (2023) · Integration · doi:10.1016/j.vlsi.2023.102090 · Cited by 22
Error-Correcting Codes and Cryptography
Sloane, N. J. A. (1981) · Springer eBooks · doi:10.1007/978-1-4684-6686-7_30 · Cited by 22
Cryptoeconomics as governance: an intellectual history from “Crypto Anarchy” to “Cryptoeconomics”
Nabben, K. (2023) · Internet Histories · doi:10.1080/24701475.2023.2183643 · Cited by 25
Software randomness analysis and evaluation of lightweight ciphers: the prospective for IoT security
Qasaimeh, M., Al‐Qassas, R. S., & Tedmori, S. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-5663-8 · Cited by 20
“The security resistance has been analyzed mainly using differential and linear cryptanalysis [14, 65], impossible differential attacks [16], algebraic attacks [51], and meet-in-the-middle attacks [22].”
Background
A switching closure test to analyze cryptosystems
Morita, H., Ohta, K., & Miyaguchi, S. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_13 · Cited by 20
Analysis of Impossible, Integral and Zero-Correlation Attacks on Type-II Generalized Feistel Networks Using the Matrix Method
Blondeau, C., & Minier, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48116-5_5 · Cited by 20
Efficient hardware implementation of the DES
Hoornaert, F., Goubert, J., & Desmedt, Y. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_15 · Cited by 20
Differential-Linear Crypt analysis
Langfordl, S. K., & Hellman, M. E. (1994) · Cited by 20
Self-citation
The Security of Multiple Encryption in the Ideal Cipher Model
Dai, Y., Lee, J., Mennink, B., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44371-2_2 · Cited by 19
Cryptographic Competitions
Bernstein, D. J. (2023) · Journal of Cryptology · doi:10.1007/s00145-023-09467-1 · Cited by 20
Multidimensional Meet-in-the-Middle Attacks on Reduced-Round TWINE-128
Boztaş, Ö., Karakoç, F., & Çoban, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40392-7_5 · Cited by 19
Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE
Espitau, T., Fouque, P.-A., & Karpman, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6_33 · Cited by 19
“Our starting point is the meet-in-the-middle technique, which was ﬁrst used in cryptography by Diﬃe and Hellman in 1977 to attack double-encryption [7].”
Method
Meet-in-the-Middle Attacks on SHA-3 Candidates
Khovratovich, D., Nikolić, I., & Weinmann, R.-P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03317-9_14 · Cited by 19
Contemporary Block Ciphers
Knudsen, L. R. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48969-x_5 · Cited by 19
On the Design of Permutation P in des Type Cryptosystems
Brown, L., & Seberry, J. (2007) · Springer eBooks · doi:10.1007/3-540-46885-4_71 · Cited by 19
What Happened with Knapsack Cryptographic Schemes?
Desmedt, Y. (1988) · Springer eBooks · doi:10.1007/978-94-009-2794-0_7 · Cited by 20
Chinese lotto as an exhaustive code-breaking machine
Quisquater, J.-J., & Desmedt, Y. (1991) · Computer · doi:10.1109/2.116847 · Cited by 19
A Better Key Schedule for DES-like Ciphers
Blumenthal, U., & Bellovin, S. M. (1996) · doi:10.7916/d81j9hgr · Cited by 18
Quantum Key-Length Extension
Jaeger, J., Song, F., & Tessaro, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-90459-3_8 · Cited by 18
Meet-in-the-Middle Attack on Reduced Versions of the Camellia Block Cipher
Lu, J., Wei, Y., Pašalić, E., & Fouque, P.-A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34117-5_13 · Cited by 18
The Higher-Order Meet-in-the-Middle Attack and Its Application to the Camellia Block Cipher
Lu, J., Wei, Y., Kim, J., & Pašalić, E. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34931-7_15 · Cited by 18
Impact of Computational Power on Cryptography
Bhat, M. I., & Giri, K. J. (2021) · Algorithms for intelligent systems · doi:10.1007/978-981-15-8711-5_4 · Cited by 18
WARX: efficient white-box block cipher based on ARX primitives and random MDS matrix
Liu, J., Rijmen, V., Hu, Y., et al. (2021) · Science China Information Sciences · doi:10.1007/s11432-020-3105-1 · Cited by 17
New Attacks on IDEA with at Least 6 Rounds
Biham, E., Dunkelman, O., Keller, N., & Adi Shamir, Z. (2013) · Journal of Cryptology · doi:10.1007/s00145-013-9162-9 · Cited by 17
FFT Key Recovery for Integral Attack
Todo, Y., & Aoki, K. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12280-9_5 · Cited by 19
Design and implementation of algorithm for DES cryptanalysis
Zodpe, H. D., Wani, P. W., & Mehta, R. (2012) · International Conference on Hybrid Intelligent Systems (HIS) · doi:10.1109/his.2012.6421347 · Cited by 17
Cryptanalysis of Ladder-DES
Biham, E. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052341 · Cited by 17
Three-Subset Meet-in-the-Middle Attack on Reduced XTEA
Sasaki, Y., Wang, L., Sakai, Y., Sakiyama, K., & Ohta, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31410-0_9 · Cited by 16
Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings
Khovratovich, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_33 · Cited by 16
“Meet-in-the-middle attacks have been known in cryptanalysis at least since the analysis of DoubleDES [9], but got less attention in 90s and early 2000s because of more difficult key schedules in contemporary block ciphers.”
Background
Meet-in-the-Middle Attacks on Reduced-Round Midori64
Lin, L., & Wu, W. (2017) · doi:10.13154/tosc.v2017.i1.215-239 · Cited by 16
“Deﬁne a structure of 2 24 plaintexts where P [1 , 3 , 6 , 9 , 11 , 14] take all the possible values, and the remaining 10 nibbles are ﬁxed to some constants.”
BackgroundMethodInfluential
Image Steganography Based On Optimal LSB Pixel Adjustment Method
S, G. P. T. V., Varadarajan, S., Jilani, S. A. K., & Kodandaramaiah, G. N. (2013) · INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY · doi:10.24297/ijct.v5i1.4380 · Cited by 16
The Importance of “Good” Key Scheduling Schemes (How to Make a Secure DES* Scheme with ≤ 48 Bit Keys?)
Quisquater, J.-J., Desmedt, Y., & Davio, M. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_43 · Cited by 16
High-Performance Cryptanalysis on RIVYERA and COPACOBANA Computing Systems
Güneysu, T. E., Kasper, T., Novotný, M., Paar, C., Wienbrandt, L., & Zimmermann, R. (2013) · Springer eBooks · doi:10.1007/978-1-4614-1791-0_11 · Cited by 15
Privacy and Authentication: An Introduction to Cryptography
Diffie, W., & Hellman, M. E. (2022) · ACM eBooks · doi:10.1145/3549993.3550010 · Cited by 15
Self-citation
Toggle-Registers Generating in Parallel k kth Decimations of m-Sequences xP+ xk+ 1 Design Tables
Arvillias, & Maritsas (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675298 · Cited by 15
Improved Differential Meet-in-the-Middle Cryptanalysis
Ahmadian, Z., Khalesi, A., M’foukh, D., Moghimi, H., & Naya‐Plasencia, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58716-0_10 · Cited by 14
Low Data Complexity Attack on Reduced Camellia-256
Chen, J., & Li, L. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31448-3_8 · Cited by 14
“The meet-in-the-middle (MITM) attack was first applied to block cipher by Diffie and Hellman [8].”
Method
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
Bao, Z., Ding, L., Guo, J., Wang, H., & Zhang, W. (2020) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2019.i4.318-347 · Cited by 14
“, their impacts on #20[0, 2], #20[5, 7], #20[8, 10], #20[13, 15] equal to predefined constants Cneut 1 = Cneut 1,0 ‖Cneut 1,1 ‖Cneut 1,2 ‖Cneut 1,3 .”
BackgroundMethodInfluential
LEOBAT : Lightweight encryption and OTP based authentication technique for securing IoT networks
Goel, A., Sharma, D. K., & Gupta, K. D. (2021) · Expert Systems · doi:10.1111/exsy.12788 · Cited by 14
“As evident from Table 5, the time of encryption of the proposed algorithm not only beats the traditional techniques like DES and Blowfish but also outperforms the SIT algo-rithm.”
Method
Simplified Modeling of MITM Attacks for Block Ciphers: New (Quantum) Attacks
Schrottenloher, A., & Stevens, M. (2023) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2023.i3.146-183 · Cited by 14
Cryptanalysis of Four-Rounded DES Using Ant Colony Optimization
Khan, S., Shahzad, W., & Khan, F. A. (2010) · International Conference on Information Science and Applications · doi:10.1109/icisa.2010.5480260 · Cited by 14
Accelerating DES and AES Algorithms for a Heterogeneous Many-core Processor
Xing, B., Wang, D., Yang, Y., et al. (2021) · International Journal of Parallel Programming · doi:10.1007/s10766-021-00692-4 · Cited by 14
Covert Distributed Processing with Computer Viruses
White, S. R. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_57 · Cited by 14
The data encryption standard--Retrospective and prospects
Morris, R. (1978) · Communications Society · doi:10.1109/mcom.1978.1089783 · Cited by 14
Cryptanalysis and design of block ciphers
Nakahara, J. (2003) · Cited by 14
On the cryptanalysis of rotor machines and substitution - permutation networks
Andelman, D., & Reeds, J. A. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056523 · Cited by 14
An LSI digital encryption processor (DEP)
Fairfield, R. C., Matusevich, A., & Plany, J. (1985) · IEEE Communications Magazine · doi:10.1109/mcom.1985.1092609 · Cited by 14
Secret-key cryptography from ideal primitives: A systematic overview
Gaži, P., & Tessaro, S. (2015) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2015.7133163 · Cited by 13
Quantum mechanical meet-in-the-middle search algorithm for Triple-DES
Zhong, P., & Bao, W. (2010) · Chinese Science Bulletin · doi:10.1007/s11434-009-0532-5 · Cited by 13
Localization-Free Detection of Replica Node Attacks in Wireless Sensor Networks Using Similarity Estimation with Group Deployment Knowledge
Ding, C., Yang, L., & Wu, M. (2017) · Sensors · doi:10.3390/s17010160 · Cited by 13
Ensuring Cybersecure Telemetry and Telecommand in Small Satellites: Recent Trends and Empirical Propositions
Saha, S. S., Rahman, S., Ahmed, M. U., & Aditya, S. K. (2019) · IEEE Aerospace and Electronic Systems Magazine · doi:10.1109/maes.2019.2927852 · Cited by 14
“Double DES-56 2(57) (instead of 2(112)) [57] 2(56) [57] 0.”
Key generation of algebraic-code cryptosystems
Sun, H., & Hwang, T. (1994) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(94)90038-8 · Cited by 13
Subtraction‐based DNA Origami Cryptography by using Structural Defects for Information Encryption
Chu, J., Tan, R., Li, W., Zhang, Y., & Liu, H. (2024) · Small · doi:10.1002/smll.202406470 · Cited by 12
Improved Biclique Cryptanalysis of the Lightweight Block Cipher Piccolo
Han, G., & Zhang, W. (2017) · Security and Communication Networks · doi:10.1155/2017/7589306 · Cited by 12
Improved MITM Cryptanalysis on Streebog
Hua, J., Dong, X., Sun, S., Zhang, Z., Hu, L., & Wang, X. (2022) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2022.i2.63-91 · Cited by 12
Is the Data Encryption Standard a Group? (Preliminary Abstract)
Kaliski, B. S., Rivest, R. L., & Sherman, A. T. (1986) · Lecture notes in computer science · doi:10.1007/3-540-39805-8_10 · Cited by 12
Diving Deep into the Preimage Security of AES-Like Hashing
Chen, S., Guo, J., List, E., Shi, D., & Zhang, T. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58716-0_14 · Cited by 11
Application of Binary Particle Swarm Optimization in Cryptanalysis of DES
Jadon, S. S., Sharma, H., Kumar, E., et al. (2012) · Advances in intelligent and soft computing · doi:10.1007/978-81-322-0487-9_97 · Cited by 11
Improved Integral Attack on Reduced-Round Simeck
Li, H., Ren, J., & Chen, S. (2019) · IEEE Access · doi:10.1109/access.2019.2936834 · Cited by 12
Isomorphic Cipher Reduction
Ghosh, B., Dutta, I. K., Khare, S., et al. (2021) · IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON) · doi:10.1109/iemcon53756.2021.9623135 · Cited by 11
Minable Data Publication Based on Sensitive Association Rule Hiding
Yang, F., Lei, X., Le, J., et al. (2021) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2021.3127523 · Cited by 11
“To achieve data privacy in minable data publication, a straightforward solution is to encrypt the data by using standard encryption algorithms (such as AES [4] and DES [5]).”
Method
Cryptanalysis of PRINCE with Minimal Data
Rasoolzadeh, S., & Raddum, H. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-31517-1_6 · Cited by 11

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