Preimage Attacks on One-Block MD4, 63-Step MD5 and More
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 new approach originates from the splice-and-cut framework in hash function cryptanalysis, more specifically its element called initial structure.
“The new approach originates from the so-called spliceand-cut framework [1,2,26] in the hash function cryptanalysis, more specifically its element called initial structure.”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [1]
In the section introducing Technique 1: Splice-and-Cut (page not available), the paper proposes and explains the splice-and-cut technique for hash-function preimage attacks. Our copy does not call any element of that technique an “initial structure,” so it supports the framework connection but not that more specific attribution. (LLM, conf=0.84)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357 · see citing works
The MD5 Message-Digest Algorithm
Rivest, R. L. (1992) · doi:10.17487/rfc1321 · Cited by 2,390 · see citing works
Handbook of Applied Cryptography
Menezes, A., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9780429466335 · Cited by 1,771 · see citing works
How to Break MD5 and Other Hash Functions
Wang, X., & Yu, H. (2005) · Lecture notes in computer science · doi:10.1007/11426639_2 · Cited by 1,442 · see citing works
Matsui, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45473-x · Cited by 1,422 · see citing works
Advances in Cryptology – EUROCRYPT 2005
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,227 · see citing works
Information Security and Privacy
Hutchison, D., Boyd, C., González Nieto, J., Weikum, G., Mitchell, J. C., Kleinberg, J. M., Takeo Kanade, A., Mattern, F., Naor, M., Nierstrasz, O., et al. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02620-1 · Cited by 1,040 · see citing works
The Internet Engineering Task Force
Needleman, M. H. (2000) · Serials Review · doi:10.1016/s0098-7913(99)00073-8 · Cited by 410 · see citing works
Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
Kelsey, J. M., & Schneier, B. (2005) · Lecture notes in computer science · doi:10.1007/11426639_28 · Cited by 376 · see citing works
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
Stam, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_22 · Cited by 361 · see citing works
Flajolet, P., & Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_34 · Cited by 274 · see citing works
Advances in Cryptology – EUROCRYPT 2017
Nielsen, J. B., & Coron, J.-S. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3 · Cited by 258 · see citing works
Hash Functions Based on Block Ciphers
Lai, X., & Massey, J. L. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_5 · Cited by 250 · see citing works
Advances in Cryptology--Eurocrypt '92
Rueppel, R. A. (1993) · Cited by 206 · see citing works
Theory and Applications of Satisfiability Testing – SAT 2007
Marques-Silva, J. P., & Sakallah, K. A. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72788-0 · Cited by 147 · see citing works
Tunnels in Hash Functions: MD5 Collisions Within a Minute.Preprint
Klíma, V. (2006) · IACR Cryptology ePrint Archive · Cited by 136 · see citing works
Leurent, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-71039-4_26 · Cited by 112 · 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
Inversion Attacks on Secure Hash Functions Using sat Solvers
De, D., Kumarasubramanian, A., & Venkatesan, R. (2007) · Springer eBooks · doi:10.1007/978-3-540-72788-0_36 · Cited by 69 · see citing works
The First Two Rounds of MD4 are Not One-Way
Dobbertin, H. (1998) · Lecture notes in computer science · doi:10.1007/3-540-69710-1_19 · Cited by 54 · see citing works
Preimage Attacks on 3-Pass HAVAL and Step-Reduced MD5
Aumasson, J.-P., Meier, W., & Mendel, F. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04159-4_8 · Cited by 49 · see citing works
Preimage Attacks on Step-Reduced MD5
Sasaki, Y., & Aoki, K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70500-0_21 · Cited by 29 · see citing works
Self-citationKuwakado, H., & Tanaka, H. (2000) · Institutional Repositories DataBase (IRDB) · Cited by 5 · see citing works
Flagged first, then by citations
Research works printed but not linked: 2
- Kuwakado, H., Tanaka, H.: New algorithm for finding preimages in a reduced version of the MD4 compression function. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences (Japan) E83-A(1), 97-100 (2000)
- Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptog- raphy. CRC Press, Boca Raton (1997)
Cited by
Sorted by citations
Piccolo: An Ultra-Lightweight Blockcipher
Shibutani, K., Isobe, T., Hiwatari, H., Mitsuda, A., Akishita, T., & Shirai, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23951-9_23 · Cited by 571 · 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
Midori: A Block Cipher for Low Energy
Banik, S., Bogdanov, A., Isobe, T., Shibutani, K., Hiwatari, H., Akishita, T., & Regazzoni, F. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48800-3_17 · Cited by 500 · see citing works
Banik, S., Pandey, S. K., Peyrin, T., Sasaki, Y., Sim, S. M., & Todo, Y. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66787-4_16 · Cited by 436 · see citing works
Self-citationFinding Preimages in Full MD5 Faster Than Exhaustive Search
Sasaki, Y., & Aoki, K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01001-9_8 · Cited by 220 · see citing works
Self-citationChaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
Mouha, N., Mennink, B., Herrewege, A. V., Watanabe, D., Bart Preneel, A., & Verbauwhede, I. M. R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13051-4_19 · Cited by 204 · see citing works
Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 Family
Khovratovich, D., Rechberger, C., & Savelieva, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34047-5_15 · Cited by 151 · see citing works
Guo, J., Ling, S., Rechberger, C., & Wang, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_4 · Cited by 127 · see citing works
Preimages for Step-Reduced SHA-2
Aoki, K., Guo, J., Matusiewicz, K., Sasaki, Y., & Wang, L. (2009) · IACR Cryptology ePrint Archive · doi:10.1007/978-3-642-10366-7_34 · Cited by 133 · see citing works
Self-citationMeet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_5 · Cited by 115 · see citing works
Self-citationGIFT: A Small Present Towards Reaching the Limit of Lightweight Encryption
Banik, S., Pandey, S. K., Peyrin, T., Sasaki, Y., Sim, S. M., & Todo, Y. (2017) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 111 · see citing works
Self-citationMeet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool
Sasaki, Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21702-9_22 · Cited by 90 · see citing works
Self-citationA 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
Sieve-in-the-Middle: Improved MITM Attacks
Canteaut, A., Naya‐Plasencia, M., & Vayssière, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40041-4_13 · Cited by 71 · see citing works
Preimage Attacks on 3, 4, and 5-Pass HAVAL
Sasaki, Y., & Aoki, K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89255-7_16 · Cited by 69 · see citing works
Self-citationSFN: A new lightweight block cipher
Li, L., Liu, B., Zhou, Y., & Zou, Y. (2018) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2018.04.009 · Cited by 67 · 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
Generic Key Recovery Attack on Feistel Scheme
Isobe, T., & Shibutani, K. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42033-7_24 · Cited by 58 · 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
Sasaki, Y., Wang, L., Wu, S., & Wu, W. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_34 · Cited by 49 · see citing works
Self-citationPreimage Attacks on 3-Pass HAVAL and Step-Reduced MD5
Aumasson, J.-P., Meier, W., & Mendel, F. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04159-4_8 · Cited by 49 · see citing works
Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
Dinur, I., Dunkelman, O., Keller, N., & Adi Shamir, Z. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42033-7_18 · Cited by 45 · see citing works
Automatic Search of Meet-in-the-Middle Preimage Attacks on AES-like Hashing
Bao, Z., Dong, X., Guo, J., Li, Z., Shi, D., Sun, S., & Wang, X. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77870-5_27 · Cited by 46 · see citing works
Preimage Attacks on Reduced Tiger and SHA-2
Isobe, T., & Shibutani, K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03317-9_9 · Cited by 45 · 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
PIPO: A Lightweight Block Cipher with Efficient Higher-Order Masking Software Implementations
Kim, H., Jeon, Y., Kim, G., Kim, J., Sim, B.-Y., Han, D.-G., Seo, H., Kim, S., Hong, S., Sung, J., et al. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-68890-5_6 · Cited by 42 · see citing works
(Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others
Wu, S., Feng, D., Wu, W., Guo, J., Dong, L., & Zou, J. X. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34047-5_8 · Cited by 38 · see citing works
Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys
Dinur, I., Dunkelman, O., Keller, N., & Adi Shamir, Z. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45611-8_23 · Cited by 35 · see citing works
Converting Meet-In-The-Middle Preimage Attack into Pseudo Collision Attack: Application to SHA-2
Ji, L., Isobe, T., & Shibutani, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34047-5_16 · Cited by 34 · see citing works
A review of collisions in cryptographic hash function used in digital forensic tools
Rasjid, Z. E., Soewito, B., Witjaksono, G., & Abdurachman, E. (2017) · Procedia Computer Science · doi:10.1016/j.procs.2017.10.072 · Cited by 36 · see citing works
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 · see citing works
Preimage Attacks on Step-Reduced RIPEMD-128 and RIPEMD-160
Ohtahara, C., Sasaki, Y., & Shimoyama, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21518-6_13 · Cited by 33 · see citing works
Self-citationLoong: A Family of Involutional Lightweight Block Cipher Based on SPN Structure
Liu, B., Li, L., Ruixue, W., Xie, M., & Li, Q. P. (2019) · IEEE Access · doi:10.1109/access.2019.2940330 · Cited by 33 · see citing works
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 32 · see citing works
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 · see citing works
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 · see citing works
Self-citationMeet-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 · see citing works
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 · see citing works
Improved Preimage Attack for 68-Step HAS-160
Hong, D., Koo, B., & Sasaki, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14423-3_22 · Cited by 30 · see citing works
Self-citationPreimage Attacks on Reduced-Round Stribog
AlTawy, R., & Youssef, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06734-6_7 · Cited by 27 · see citing works
Preimage Attacks on 41-Step SHA-256 and 46-Step SHA-512.
Sasaki, Y., Wang, L., & Aoki, K. (2009) · Cited by 27 · see citing works
Self-citationDesign and security analysis of two robust keyed hash functions based on chaotic neural networks
Abdoun, N., Assad, S. E., Olivier Déforges, A., Assaf, R., & Khalil, M. A. (2019) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-019-01244-y · Cited by 25 · see citing works
(Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach
Wang, L., Sasaki, Y., Komatsubara, W., Ohta, K., & Sakiyama, K. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19074-2_14 · Cited by 24 · see citing works
Self-citationBiclique Cryptanalysis of the PRESENT and LED Lightweight Ciphers.
Abed, F., Forler, C., List, E., Lucks, S., & Wenzel, J. (2012) · Cited by 24 · see citing works
Superposition Meet-in-the-Middle Attacks: Updates on Fundamental Security of AES-like Hashing
Bao, Z., Guo, J., Shi, D., & Tu, Y. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15802-5_3 · Cited by 24 · see citing works
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 · see citing works
Continuous Non-malleable Key Derivation and Its Application to Related-Key Security
Qin, B., Liu, S., Yuen, T. H., Deng, R. H., & Chen, K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46447-2_25 · Cited by 24 · see citing works
Sasaki, Y., & Aoki, K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02620-1_15 · Cited by 24 · see citing works
Self-citationNew 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 · see citing works
Boomerang Distinguishers on MD4-Family: First Practical Results on Full 5-Pass HAVAL
Sasaki, Y. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28496-0_1 · Cited by 21 · see citing works
Self-citationBicliques with Minimal Data and Time Complexity for AES
Bogdanov, A., Chang, D., Ghosh, M., & Sanadhya, S. K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-15943-0_10 · Cited by 21 · see citing works
Adaptive Restart and CEGAR-Based Solver for Inverting Cryptographic Hash Functions
Nejati, S., Jia, L., Gebotys, C. H., Czarnecki, K., & Ganesh, V. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72308-2_8 · Cited by 20 · see citing works
A Preimage Attack for 52-Step HAS-160
Sasaki, Y., & Aoki, K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00730-9_19 · Cited by 19 · see citing works
Self-citationHigher-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 · see citing works
Midori: A Block Cipher for Low Energy (Extended Version).Preprint
Banik, S., Bogdanov, A., Isobe, T., Shibutani, K., Hiwatari, H., Akishita, T., & Regazzoni, F. (2015) · IACR Cryptology ePrint Archive · Cited by 19 · see citing works
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 · see citing works
Improved All-Subkeys Recovery Attacks on FOX, KATAN and SHACAL-2 Block Ciphers
Isobe, T., & Shibutani, K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46706-0_6 · Cited by 17 · see citing works
Finding Preimages of Tiger Up to 23 Steps
Wang, L., & Sasaki, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13858-4_7 · Cited by 17 · see citing works
Self-citationThree-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 · see citing works
Self-citationBicliques 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 · see citing works
Key Recovery Attacks on Iterated Even–Mansour Encryption Schemes
Dinur, I., Dunkelman, O., Keller, N., & Adi Shamir, Z. (2015) · Journal of Cryptology · doi:10.1007/s00145-015-9207-3 · Cited by 17 · see citing works
Weakness of lightweight block ciphers mCrypton and LED against biclique cryptanalysis
Jeong, K., Kang, H., Lee, C., Sung, J., Hong, S., & Lim, J. I. (2013) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-013-0208-4 · Cited by 15 · see citing works
Quantum algorithms for hash preimage attacks
Wang, P., Tian, S., Sun, Z., & Xie, N. (2020) · Quantum Engineering · doi:10.1002/que2.36 · Cited by 15 · see citing works
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 · see citing works
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 · see citing works
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 · see citing works
Cryptanalysis of the Round-Reduced GOST Hash Function
Zou, J. X., Wu, W., & Wu, S. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12087-4_20 · Cited by 13 · see citing works
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 · see citing works
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 · see citing works
A Framework for Automated Independent-Biclique Cryptanalysis
Abed, F., Forler, C., List, E., Lucks, S., & Wenzel, J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43933-3_29 · Cited by 11 · see citing works
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 · see citing works
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 · see citing works
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 · see citing works
Sieve-in-the-Middle: Improved MITM Attacks (Full Version)
Canteaut, A., Naya‐Plasencia, M., & Vayssière, B. (2013) · HAL · Cited by 10 · see citing works
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 · see citing works
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 · see citing works
Self-citationYasuda, K., & Sasaki, Y. (2010) · IEICE ESS FUNDAMENTALS REVIEW · doi:10.1587/essfr.4.57 · Cited by 9 · see citing works
Self-citationMind the TWEAKEY Schedule: Cryptanalysis on SKINNYe-64-256
Qin, L., Dong, X., Wang, A., Hua, J., & Wang, X. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22963-3_10 · Cited by 9 · see citing works
Preimage Attacks on Step-Reduced SM3 Hash Function
Zou, J. X., Wu, W., Wu, S., Su, B., & Dong, L. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31912-9_25 · Cited by 8 · see citing works
Differential Fault Analysis on the MD5 Compression Function
Li, W., Tao, Z., Gu, D., Wang, Y., Liu, Z., & Liu, Y. (2013) · Journal of Computers · doi:10.4304/jcp.8.11.2888-2894 · Cited by 8 · see citing works
Second Preimage Analysis of Whirlwind
AlTawy, R., & Youssef, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16745-9_17 · Cited by 8 · see citing works
New Biclique Cryptanalysis on Full-Round PRESENT-80 Block Cipher
Jithendra, K. B., & Shahana, T. K. (2020) · SN Computer Science · doi:10.1007/s42979-020-0103-z · Cited by 8 · see citing works
Security of Encryption Schemes in Weakened Random Oracle Models
Kawachi, A., Numayama, A., Tanaka, K., & Xagawa, K. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13013-7_24 · Cited by 8 · see citing works
Ma, B., Li, B., Hao, R., & Li, X. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22425-1_6 · Cited by 8 · see citing works
Improved meet-in-the-middle attacks on reduced-round Piccolo
Liu, Y., Liang, C., Liu, Z., Li, W., Wang, Q., & Gu, D. (2017) · Science China Information Sciences · doi:10.1007/s11432-016-9157-y · Cited by 8 · see citing works
Meet-in-the-Middle Preimage Attacks Revisited - New Results on MD5 and HAVAL
Sasaki, Y., Komatsubara, W., Sakai, Y., Wang, L., Iwamoto, M., Sakiyama, K., & Ohta, K. (2013) · International Conference on Security and Cryptography · doi:10.5220/0004521101110122 · Cited by 7 · see citing works
Self-citationThe State of Hash Functions and the NIST SHA-3 Competition
Bart Preneel, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01440-6_1 · Cited by 7 · see citing works
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 · see citing works
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 · see citing works
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 · see citing works
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 · see citing works
Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL
Sasaki, Y. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04474-8_7 · Cited by 6 · see citing works
Self-citationPreimage 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 · see citing works
Two Passes of Tiger Are Not One-Way
Mendel, F. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02384-2_3 · Cited by 6 · see citing works
Green Cryptanalysis: Meet-in-the-Middle Key-Recovery for the Full KASUMI Cipher ?
Jia, K., Rechberger, C., & Wang, X. (2013) · Cited by 6 · see citing works
Preimage Attacks on Feistel-SP Functions: Impact of Omitting the Last Network Twist
Sasaki, Y. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38980-1_11 · Cited by 5 · see citing works
Self-citationConstruction of the Initial Structure for Preimage Attack of MD5
Mao, M., Chen, S., & Xu, J. (2009) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/cis.2009.214 · Cited by 5 · see citing works
Cryptanalysis of the Round-Reduced Kupyna Hash Function.
Zou, J. X., & Dong, L. (2015) · Cited by 5 · see citing works
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 · see citing works
Preimage Attacks on Reduced Steps of ARIRANG and PKC98-Hash
Hong, D., Koo, B., Kim, W.-H., & Kwon, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14423-3_21 · Cited by 5 · see citing works
- Authors
- Aoki, K., & Sasaki, Y.
- Affiliations
- NTT (Japan) (JP)
- ORCID
- Sasaki, Yu
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 103-119
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1814882979
- Cited by
- 182
- References
- 23
- Citations by year
- 2026: 7 · 2025: 10 · 2024: 5 · 2023: 8 · 2022: 4 · 2021: 5 · 2020: 4 · 2019: 7 · 2018: 5 · 2017: 6 · 2016: 2 · 2015: 20 · 2014: 13 · 2013: 19 · 2012: 24
- FWCI
- 15.49
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- 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
- preimage attack, MD4, MD5, meet-in-the-middle attack, reduced-round attacks, compression function, cryptographic hash functions
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
