Linear Cryptanalysis Method for DES Cipher
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The obtained approximate entropy for the proposed improved chaotic map is 1.1995, considerably higher than that of the logistic map, LSS map, DSP map, and TLS map.
“The obtained ApEn for proposed improved chaotic map comes out as 1.1995 which is considerably higher than the logistic map [45], LSS map [46], DSP map [47], and TLS map [48] as evident from the ApEn comparison plot shown in Figure 2 for bifurcation parameter in [0, 4].”
From Bijective S-Boxes Method Using Improved Chaotic Map-Based Heuristic Search and Algebraic Group Structures (2020) · cites this paper as [46]
The construction of long bicliques of high dimension appears to be a very difficult task for primitives with fast diffusion.
“Moreover, the construction of long bicliques of high dimension appears to be a very difficult task for primitives with fast diffusion [37].”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [37]
The omission of the MixColumn transformation in the last round of AES helps to design attacks for more rounds.
“Also, as already observed in [19,37], the fact that the MixColumn transformation is omitted in the last round of AES helps to design attacks for more rounds.”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [37]
Cites
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
Flagged first, then by citations
Cited by
Sorted by citations
PRESENT: An Ultra-Lightweight Block Cipher
Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_31 · Cited by 2,867 · see citing works
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119 · see citing works
KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
De Cannière, C., Dunkelman, O., & Knežević, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04138-9_20 · Cited by 678 · see citing works
Biclique Cryptanalysis of the Full AES
Bogdanov, A., Khovratovich, D., & Rechberger, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_19 · Cited by 546 · see citing works
An image encryption approach based on chaotic maps
Zhang, L., Liao, X., & Wang, X. (2005) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.09.035 · Cited by 374 · see citing works
A novel image encryption scheme based on an elliptic curve
Hayat, U., & Azam, N. A. (2019) · Signal Processing · doi:10.1016/j.sigpro.2018.10.011 · Cited by 178 · see citing works
Design and Implementation of a True Random Number Generator Based on Digital Circuit Artifacts
Epstein, M., Hars, L., Krasinski, R., Rosner, M., & Zheng, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45238-6_13 · Cited by 85 · see citing works
Razaq, A., Alolaiyan, H., Ahmad, M., Yousaf, M. A., Shuaib, U., Aslam, W., & Alawida, M. (2020) · IEEE Access · doi:10.1109/access.2020.2989676 · Cited by 81 · see citing works
Ahmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3001868 · Cited by 67 · see citing works
“The low value of linear approximation probability is essential to withstand the attack suggested by Mitsui [58].”
BackgroundMethodA Comparison of Post-Processing Techniques for Biased Random Number Generators
Kwok, S.-H., Ee, Y.-L., Chew, G., Zheng, K., Khoo, K., & Tan, C.-H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21040-2_12 · Cited by 57 · see citing works
A Novel Design of Cryptographic SP-Network Based on Gold Sequences and Chaotic Logistic Tent System
Khan, M. F., Ahmed, A., Saleem, K., & Shah, T. (2019) · IEEE Access · doi:10.1109/access.2019.2925081 · Cited by 27 · see citing works
Image cipher applications using the elliptical curve and chaos
Silva-García, V. M., Flores-Carapia, R., Rentería-Márquez, C., Luna-Benoso, B., & Chimal-Eguía, J. C. (2020) · International Journal of Applied Mathematics and Computer Science · doi:10.34768/amcs-2020-0029 · Cited by 9 · see citing works
FPGA-friendly compact and efficient AES-like 8 × 8 S-box
Malal, A., & Tezcan, C. (2024) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2024.105007 · Cited by 7 · see citing works
New insights on linear cryptanalysis
Liu, Z., Han, S., Wang, Q., Li, W., Liu, Y., & Gu, D. (2020) · Science China Information Sciences · doi:10.1007/s11432-018-9758-4 · Cited by 6 · see citing works
Some remarks on the TKIP key mixing function of IEEE 802.11i
Han, W., Zheng, D., & Chen, K.-F. (2009) · Journal of Shanghai Jiaotong University (Science) · doi:10.1007/s12204-009-0081-8 · Cited by 2 · see citing works
Malal, A., & Tezcan, C. (2026) · Journal of Cryptographic Engineering · doi:10.1007/s13389-025-00388-2 · Cited by 3 · see citing works
“The MDS property is critical for maximizing diffusion and resisting differential [7] and linear cryptanalysis [8].”
Cipher Image Damage: An Application of Filters
Flores-Carapia, R., Silva-García, V. M., Luna-Benoso, B., & Rentería-Márquez, C. (2015) · Polibits · doi:10.17562/pb-52-7 · Cited by 1 · see citing works
- Authors
- Matsui, M.
- Affiliations
- Mitsubishi Electric (Japan) (JP)
- Corresponding author
- Matsui, Mitsuru
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1994
- Pages
- 386-397
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1964723977
- Cited by
- 2,748
- References
- 1
- Citations by year
- 2026: 75 · 2025: 97 · 2024: 127 · 2023: 154 · 2022: 119 · 2021: 146 · 2020: 114 · 2019: 81 · 2018: 108 · 2017: 108 · 2016: 112 · 2015: 119 · 2014: 117 · 2013: 97 · 2012: 123
- FWCI
- 37.95
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Lecture notes in computer science (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
- DES, linear cryptanalysis, known-plaintext attack, ciphertext-only attack, block cipher cryptanalysis, attack complexity
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
