Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
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
Cites
Statistics
Claims the paper makes
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713 · see citing works
Self-citationCommunication 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 · see citing works
Golomb, S. W. (2014) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,194 · see citing works
Science and information theory
Charp, S. (1956) · Journal of the Franklin Institute · doi:10.1016/0016-0032(56)90094-1 · Cited by 1,518 · see citing works
Cattermole, K. W. (1968) · Electronics and Power · doi:10.1049/ep.1968.0141 · Cited by 1,326 · see citing works
Science and Information Theory
Brillouin, L., & Gottschalk, C. M. (1962) · Physics Today · doi:10.1063/1.3057866 · Cited by 313 · see citing works
Physical limits in digital electronics
Keyes, R. W. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9825 · Cited by 301 · see citing works
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 · see citing works
Self-citationA 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 · see citing works
Self-citationASSESSMENT 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 · see citing works
Flagged first, then by citations
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
Cited by
Sorted by citations
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713 · see citing works
Self-citationA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914 · see citing works
One Way Hash Functions and DES
Merkle, R. C. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34805-0_40 · Cited by 880 · see citing works
A cryptanalytic time-memory trade-off
Hellman, M. E. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056220 · Cited by 703 · see citing works
Self-citationThe Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Mihir Bellare, Y., & Rogaway, P. (2006) · Lecture notes in computer science · doi:10.1007/11761679_25 · Cited by 674 · see citing works
Differential Cryptanalysis of DES-like Cryptosystems
Biham, E., & Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_1 · Cited by 660 · see citing works
Privacy and authentication: An introduction to cryptography
Diffie, W., & Hellman, M. E. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11256 · Cited by 468 · see citing works
Self-citationParallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639 · see citing works
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Springer eBooks · doi:10.1007/3-540-39757-4_20 · Cited by 367 · see citing works
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012 · see citing works
Reversible hiding in DCT-based compressed images
Chang, C., Lin, C., Tseng, C.-S., & Tai, W. (2007) · Information Sciences · doi:10.1016/j.ins.2007.02.019 · Cited by 327 · see citing works
Data Encryption Standard (DES)
Biryukov, A., & Cannière, C. D. (2011) · Springer eBooks · doi:10.1007/978-1-4419-5906-5_568 · Cited by 317 · see citing works
Differential-Linear Cryptanalysis
Langford, S. K., & Hellman, M. E. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_3 · Cited by 276 · see citing works
Self-citationSelecting Cryptographic Key Sizes
Lenstra, A. K., & Verheul, E. R. (2000) · Lecture notes in computer science · doi:10.1007/978-3-540-46588-1_30 · Cited by 270 · see citing works
The Simeck Family of Lightweight Block Ciphers
Yang, G., Zhu, B., Suder, V., Aagaard, M. D., & Gong, G. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48324-4_16 · Cited by 263 · see citing works
An introduction to contemporary cryptology
Massey, J. L. (1988) · Proceedings of the IEEE · doi:10.1109/5.4440 · Cited by 252 · see citing works
LEA: A 128-Bit Block Cipher for Fast Encryption on Common Processors
Hong, D., Lee, J., Kim, D.-C., Kwon, D., Ryu, K. H., & Lee, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-05149-9_1 · Cited by 244 · see citing works
Symmetric and Asymmetric Encryption
Simmons, G. J. (1979) · ACM Computing Surveys · doi:10.1145/356789.356793 · Cited by 246 · see citing works
On the security of multiple encryption
Merkle, R. C., & Hellman, M. E. (1981) · Communications of the ACM · doi:10.1145/358699.358718 · Cited by 238 · see citing works
Self-citationOn Memory-Bound Functions for Fighting Spam
Dwork, C., Goldberg, A. V., & Naor, M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_25 · Cited by 236 · see citing works
Data Encryption Standard: past and future
Smid, M. E., & Branstad, D. K. (1988) · Proceedings of the IEEE · doi:10.1109/5.4441 · Cited by 230 · see citing works
The first ten years of public-key cryptography
Diffie, W. (1988) · Proceedings of the IEEE · doi:10.1109/5.4442 · Cited by 219 · see citing works
Self-citationAn overview of public key cryptography
Hellman, M. E. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1006971 · Cited by 215 · see citing works
Self-citationCryptographic Processors-A Survey
Anderson, R., Bond, M., Clulow, J., et al. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2005.862423 · Cited by 198 · see citing works
Denning, D. E., & Denning, P. J. (1979) · ACM Computing Surveys · doi:10.1145/356778.356782 · Cited by 193 · see citing works
How to Protect DES Against Exhaustive Key Search
Kilian, J., & Rogaway, P. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_20 · Cited by 188 · see citing works
Structured Design of Substitution-Permutation Encryption Networks
Kam, P., & Davida (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675242 · Cited by 181 · see citing works
UNIX Password Security - Ten Years Later
Feldmeier, D. C., & Karn, P. R. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_6 · Cited by 172 · see citing works
CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks
Beierle, C., Leander, G., Moradi, A., et al. (2019) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2019.i1.5-45 · Cited by 166 · see citing works
DNA origami cryptography for secure communication
Zhang, Y., Wang, F., Chao, J., Xie, M., Liu, H., Pan, M., Kopperger, E., Liu, X., Li, Q., Shi, J., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-13517-3 · Cited by 163 · see citing works
Code-Based Game-Playing Proofs and the Security of Triple Encryption
Mihir Bellare, Y., & Rogaway, P. (2006) · Cited by 161 · see citing works
A survey of algebraic properties used in cryptographic protocols
Cortier, V., Delaune, S., & Lafourcade, P. (2006) · Journal of Computer Security · doi:10.3233/jcs-2006-14101 · Cited by 149 · see citing works
Güneysu, T. E., Kasper, T., Novotný, M., Paar, C., & Rupp, A. (2008) · IEEE Transactions on Computers · doi:10.1109/tc.2008.80 · Cited by 148 · see citing works
A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
Bogdanov, A., & Rechberger, C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19574-7_16 · Cited by 135 · see citing works
Cryptanalysis: a survey of recent results
Brickell, E. F., & Odlyzko, A. M. (1988) · Proceedings of the IEEE · doi:10.1109/5.4443 · Cited by 135 · see citing works
A fast software one-way hash function
Merkle, R. C. (1990) · Journal of Cryptology · doi:10.1007/bf00203968 · Cited by 132 · see citing works
Encryption and Secure Computer Networks
Popek, G. J., & Kline, C. S. (1979) · ACM Computing Surveys · doi:10.1145/356789.356794 · Cited by 116 · see citing works
Cascade ciphers: The importance of being first
Maurer, U. M., & Massey, J. L. (1993) · Journal of Cryptology · doi:10.1007/bf02620231 · Cited by 110 · see citing works
Tanenbaum, A. S. (1981) · ACM Computing Surveys · doi:10.1145/356859.356864 · Cited by 111 · see citing works
Breaking Ciphers with COPACOBANA –A Cost-Optimized Parallel Code Breaker
Kumar, S. S., Paar, C., Pelzl, J., Pfeiffer, G., & Schimmler, M. (2006) · Lecture notes in computer science · doi:10.1007/11894063_9 · Cited by 107 · see citing works
Fast Software Encryption Functions
Merkle, R. C. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_34 · Cited by 102 · see citing works
How to decrypt or even substitute DES-encrypted messages in 228 steps
Biham, E. (2002) · Information Processing Letters · doi:10.1016/s0020-0190(02)00269-7 · Cited by 91 · see citing works
Dinur, I., Dunkelman, O., Keller, N., et al. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_42 · Cited by 84 · see citing works
On the power of cascade ciphers
Even, S., & Goldreich, O. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214438.214442 · Cited by 84 · see citing works
“Diffie and Hellman [3] showed how to break a CC consisting of two stages (i.”
Narrow-Bicliques: Cryptanalysis of Full IDEA
Khovratovich, D., Leurent, G., & Rechberger, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_24 · Cited by 82 · see citing works
“One of the first applications is the cryptanalysis of DoubleDES EK2(EK1(·)), which demonstrated that the total security level is not the sum of key lengths [12].”
BackgroundA Known-Plaintext Attack on Two-Key Triple Encryption
van Oorschot, P. C., & Wiener, M. J. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_29 · Cited by 80 · see citing works
Preimages for Reduced SHA-0 and SHA-1
Cannière, C. D., & Rechberger, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_11 · Cited by 74 · see citing works
Fast DES Implementations for FPGAs and Its Application to a Universal Key-Search Machine
Kaps, J.-P., & Paar, C. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48892-8_19 · Cited by 76 · see citing works
Lempel, A. (1979) · ACM Computing Surveys · doi:10.1145/356789.356792 · Cited by 75 · see citing works
Is the Data Encryption Standard a group? (Results of cycling experiments on DES)
Kaliski, B. S., Rivest, R. L., & Sherman, A. T. (1988) · Journal of Cryptology · doi:10.1007/bf00206323 · Cited by 74 · see citing works
Avalanche characteristics of substitution-permutation encryption networks
Heys, H. M., & Tavares, S. E. (1995) · IEEE Transactions on Computers · doi:10.1109/12.464391 · Cited by 73 · see citing works
Applications of information networks
Licklider, J. C. R., & Vezza, A. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11144 · Cited by 72 · see citing works
Giacon, F., Heuer, F., & Poettering, B. (2018) · IACR Cryptology ePrint Archive · doi:10.1007/978-3-319-76578-5_7 · Cited by 115 · see citing works
“[5,19]) to combine various symmetric encryption schemes is to apply them in a cascade fashion where the message is encrypted using the first scheme, the resulting ciphertext then being encrypted with the second scheme, and so on.”
BackgroundTransform domain analysis of DES
Gong, G., & Golomb, S. W. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782138 · Cited by 67 · see citing works
Rivest, R. L. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50018-7 · Cited by 65 · see citing works
Meet-in-the-Middle Technique for Integral Attacks against Feistel Ciphers
Sasaki, Y., & Wang, L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35999-6_16 · Cited by 63 · see citing works
Security Analysis of the Lightweight Block Ciphers XTEA, LED and Piccolo
Isobe, T., & Shibutani, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31448-3_6 · Cited by 63 · see citing works
A survey of password mechanisms: Weaknesses and potential improvements. Part 2
Jobusch, D. L., & Oldehoeft, A. E. (1989) · Computers & Security · doi:10.1016/0167-4048(89)90006-0 · Cited by 60 · see citing works
A High-speed DES Implementation for Network Applications
Eberle, H. (1993) · Lecture notes in computer science · doi:10.1007/3-540-48071-4_37 · Cited by 61 · see citing works
Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks
Dong, X., Hua, J., Sun, S., Li, Z., Wang, X., & Hu, L. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84252-9_10 · Cited by 57 · see citing works
Simpira v2: A Family of Efficient Permutations Using the AES Round Function
Gueron, S., & Mouha, N. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53887-6_4 · Cited by 56 · see citing works
An overview of public key cryptography
Hellman, M. E. (1978) · Communications Society · doi:10.1109/mcom.1978.1089772 · Cited by 57 · see citing works
Self-citationImproved Single-Key Attacks on 9-Round AES-192/256
Li, L., Jia, K., & Wang, X. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46706-0_7 · Cited by 57 · see citing works
Experience Using a Low-Cost FPGA Design to Crack DES Keys
Clayton, R., & Bond, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36400-5_42 · Cited by 56 · see citing works
Avoine, G., Bingöl, M. A., Carpent, X., & Örs, B. (2012) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2012.174 · Cited by 55 · see citing works
A Single-Key Attack on the Full GOST Block Cipher
Isobe, T. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21702-9_17 · Cited by 90 · see citing works
Encrypting by Random Rotations
Sloane, N. J. A. (2007) · Springer eBooks · doi:10.1007/3-540-39466-4_6 · Cited by 53 · see citing works
Lin, C., Liu, X.-L., & Yuan, S. (2014) · Information Sciences · doi:10.1016/j.ins.2014.08.057 · Cited by 52 · see citing works
Designing secure substitution boxes based on permutation of symmetric group
Anees, A., & Chen, Y. P. (2019) · Neural Computing and Applications · doi:10.1007/s00521-019-04207-8 · Cited by 51 · see citing works
A case study of partially evaluated hardware circuits: Key-specific DES
Leonard, J., & Mangione-Smith, W. H. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63465-7_220 · Cited by 50 · see citing works
Neuro-Cryptanalysis of DES and Triple-DES
Alani, M. M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34500-5_75 · Cited by 49 · see citing works
A survey of password mechanisms: Weaknesses and potential improvements. Part 1
Jobusch, D. L., & Oldehoeft, A. E. (1989) · Computers & Security · doi:10.1016/0167-4048(89)90051-5 · Cited by 49 · see citing works
Lightweight block ciphers for resource-constrained environments: A comprehensive survey
Zhong, Y. Q., & Gu, J. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.03.054 · Cited by 55 · see citing works
Security amplification by composition: The case of doubly-iterated, ideal ciphers
Aiello, W. A., Bellare, M., Crescenzo, G. D., & Venkatesan, R. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055743 · Cited by 47 · see citing works
Cy : Chaotic yolo for user intended image encryption and sharing in social media
Asgari-Chenaghlu, M., Feizi‐Derakhshi, M., Nikzad-Khasmakhi, N., Feizi-Derakhshi, A.-R., Ramezani, M., Jahanbakhsh-Nagadeh, Z., Akan, T., Zafarani-Moattar, E., Ranjbar-Khadivi, M., & Balafar, M. A. (2020) · Information Sciences · doi:10.1016/j.ins.2020.07.007 · Cited by 46 · see citing works
Biclique Cryptanalysis of Reduced-Round Piccolo Block Cipher
Wang, Y., Wu, W., & Yu, X. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29101-2_23 · Cited by 46 · see citing works
SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations
Chen, S., Fan, Y., Sun, L., Fu, Y. L., Zhou, H., Li, Y., Wang, M., Wang, W., & Guo, C. F. (2021) · Designs Codes and Cryptography · doi:10.1007/s10623-021-00970-9 · Cited by 47 · see citing works
“Meet-in-the-Middle (MITM) attacks [32] have been applied to the security analysis of many block ciphers.”
BackgroundImproving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
van Oorschot, P. C., & Wiener, M. J. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_18 · Cited by 43 · see citing works
All Subkeys Recovery Attack on Block Ciphers: Extending Meet-in-the-Middle Approach
Isobe, T., & Shibutani, K. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35999-6_14 · Cited by 42 · see citing works
Secret Error-Correcting Codes (SECC)
Hwang, T., & Rao, T. R. N. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_39 · Cited by 42 · see citing works
How to strengthen DES using existing hardware
Biham, E., & Biryukov, A. (1995) · Lecture notes in computer science · doi:10.1007/bfb0000451 · Cited by 42 · see citing works
Multicast security and its extension to a mobile environment
Gong, L., & Shacham, N. (1995) · Wireless Networks · doi:10.1007/bf01200847 · Cited by 42 · see citing works
Security on LBlock against Biclique Cryptanalysis
Wang, Y., Wu, W., Yu, X., & Zhang, L. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35416-8_1 · Cited by 41 · see citing works
Multiphase Encryption: A New Concept in Modern Cryptography
Gupta, H., & Sharma, V. (2013) · International Journal of Computer Theory and Engineering · doi:10.7763/ijcte.2013.v5.765 · Cited by 41 · see citing works
Cryptographic sealing for information secrecy and authentication
Gifford, D. K. (1982) · Communications of the ACM · doi:10.1145/358468.358493 · Cited by 41 · see citing works
Bond, M. (2004) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 41 · see citing works
A novel hybrid image authentication scheme based on absolute moment block truncation coding
Lin, C., Huang, Y., & Tai, W. (2015) · Multimedia Tools and Applications · doi:10.1007/s11042-015-3059-6 · Cited by 40 · see citing works
On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?
Zhang, R., Hanaoka, G., Shikata, J., et al. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24632-9_26 · Cited by 40 · see citing works
Improved Meet-in-the-Middle Attacks on Reduced-Round DES
Dunkelman, O., Sekar, G., & Preneel, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77026-8_8 · Cited by 61 · see citing works
Role-based security for distributed object systems
Yialelis, N., Lupu, E., & Sloman, M. S. (2002) · IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE) · doi:10.1109/enabl.1996.555078 · Cited by 39 · see citing works
Analytical Characteristics of the DES
Davio, M., Desmedt, Y., Fosséprez, M., et al. (1984) · Springer eBooks · doi:10.1007/978-1-4684-4730-9_16 · Cited by 39 · see citing works
LSBase: A key encapsulation scheme to improve hybrid crypto-systems using DNA steganography
Khalifa, A. S. (2013) · International Conference on Computer Engineering & Systems (ICCES) · doi:10.1109/icces.2013.6707182 · Cited by 38 · see citing works
Surreptitiously Weakening Cryptographic Systems.Preprint
Schneier, B., Fredrikson, M., Kohno, T., et al. (2015) · IACR Cryptology ePrint Archive · Cited by 38 · see citing works
On the Security of 2-Key Triple DES
Mitchell, C. J. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2611003 · Cited by 37 · see citing works
Probable plaintext cryptanalysis of the IP security protocols
Bellovin, S. M. (2002) · doi:10.1109/ndss.1997.579220 · Cited by 37 · see citing works
A survey on secure communication techniques for 5G wireless heterogeneous networks
Kakkar, A. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.04.009 · Cited by 38 · see citing works
Privacy and Cybersecurity: The Next 100 Years
Landwehr, C. E., Boneh, D., Mitchell, J. C., Bellovin, S. M., Landau, S. M., & Lesk, M. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2189794 · Cited by 37 · see citing works
On Weaknesses of Non–surjective Round Functions
Rijmen, V., Bart Preneel, A., & Win, E. D. (1997) · Designs Codes and Cryptography · doi:10.1023/a:1008224928678 · Cited by 36 · see citing works
Gaži, P., & Maurer, U. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10366-7_3 · Cited by 35 · see citing works
- Authors
- Diffie, W., & Hellman, M. E.
- Affiliations
- Stanford University (US)
- ORCID
- Hellman, M.E.
- Venue
- Computer
- Published
- 1977-06
- Volume
- 10
- Issue
- 6
- Pages
- 74-84
- ISSN
- 0018-9162 (ISSN-L)
- 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
- Locations
- Computer (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Artificial Intelligence › 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