A Proposal for a New Block Encryption Standard
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
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
Latin Squares and their Applications
Keedwell, A. D., & Dénes, J. (2015) · Elsevier eBooks · doi:10.1016/c2014-0-03412-0 · Cited by 1,042
An introduction to contemporary cryptology
Massey, J. L. (1988) · Proceedings of the IEEE · doi:10.1109/5.4440 · Cited by 253
Self-citation
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Chaos-based cryptography: a brief overview
Kocarev, L. (2001) · IEEE Circuits and Systems Magazine · doi:10.1109/7384.963463 · Cited by 901
Chaos and cryptography: block encryption ciphers based on chaotic maps
Jakimoski, G., & Kocarev, L. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.904880 · Cited by 673
Markov Ciphers and Differential Cryptanalysis
Lai, X., Massey, J. L., & Murphy, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_2 · Cited by 556
Self-citationThakor, V. A., Razzaque, M. A., & Khandaker, M. R. A. (2021) · IEEE Access · doi:10.1109/access.2021.3052867 · Cited by 424
“IDEA [114], designed by Lai and Massey, makes use of a 128-bit key on 64-bit input to perform 8.5 iterations, mainly used for high-speed networks [115].”
MethodInfluentialA cryptographic file system for UNIX
Blaze, M. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168590 · Cited by 413
Higher Order Derivatives and Differential Cryptanalysis
Lai, X. (1994) · Communications and Cryptography · doi:10.1007/978-1-4615-2694-0_23 · Cited by 412
Self-citationGulcu, C., & Tsudik, G. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492350 · Cited by 302
A review of lightweight block ciphers
Hatzivasilis, G., Fysarakis, K., Papaefstathiou, I., & Manifavas, C. (2018) · Journal of Cryptographic Engineering · doi:10.1007/s13389-017-0160-y · Cited by 259
Side channel cryptanalysis of product ciphers
Kelsey, J., Schneier, B., Wagner, D., & Hall, C. (2000) · Journal of Computer Security · doi:10.3233/jcs-2000-82-304 · Cited by 257
Role-based access control on the web
Park, J. S., Sandhu, R., & Ahn, G.-J. (2001) · ACM Transactions on Information and System Security · doi:10.1145/383775.383777 · Cited by 228
“Basically, it uses RSA [Rivest et al. 1978] for the convenience of the public-key cryptosystem, message digests (MD5 [Rivest 1992]), and IDEA [Lai and Massey 1991] for process speed, and Diffie-Hellman [Diffie and Hellman 1997] for key exchange.”
BackgroundMethodSecure Data Encryption Based on Quantum Walks for 5G Internet of Things Scenario
El-Latif, A. A. A., Abd-El-Atty, B., Mazurczyk, W., Fung, C., & Venegas-Andraca, S. E. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.2969863 · Cited by 217
Related-Key Boomerang and Rectangle Attacks
Biham, E., Dunkelman, O., & Keller, N. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_30 · Cited by 217
A survey on lightweight block ciphers for low-resource devices: Comparative study and open issues
Mohd, B. J., Hayajneh, T., & Vasilakos, A. V. (2015) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2015.09.001 · Cited by 196
Side channel cryptanalysis of product ciphers
Kelsey, J., Schneier, B., Wagner, D., & Hall, C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055858 · Cited by 192
Miss in the Middle Attacks on IDEA and Khufu
Biham, E., Biryukov, A., & Shamir, A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48519-8_10 · Cited by 162
“It is a modified version of a previous design by the same authors [19], with added strength against differential attacks [6].”
BackgroundAbd El-Latif, A. A., Abd-El-Atty, B., Amin, M., & Iliyasu, A. M. (2020) · Scientific Reports · doi:10.1038/s41598-020-58636-w · Cited by 155
An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization
Azam, N. A., Hayat, U., & Ullah, I. (2018) · Security and Communication Networks · doi:10.1155/2018/3421725 · Cited by 56
Image Encryption and Chaotic Cellular Neural Network
Peng, J., & Zhang, D. (2009) · Machine Learning in Cyber Trust · doi:10.1007/978-0-387-88735-7_8 · Cited by 9
Metadata
- Authors
- Lai, X., & Massey, J. L.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1991
- Pages
- 389-404
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1605116544
- Cited by
- 608
- References
- 3
- FWCI
- 6.34
- Type
- conference paper
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.