{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T15:07:24Z","timestamp":1778944044270,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s13389-026-00391-1","type":"journal-article","created":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T02:13:00Z","timestamp":1776996780000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ascending stepped cryptanalytic time-memory trade-off"],"prefix":"10.1007","volume":"16","author":[{"given":"Gildas","family":"Avoine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Carpent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diane","family":"Leblanc-Albarel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,24]]},"reference":[{"issue":"4","key":"391_CR1","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"ME Hellman","year":"1980","unstructured":"Hellman, M.E.: A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26(4), 401\u2013406 (1980). https:\/\/doi.org\/10.1109\/TIT.1980.1056220","journal-title":"IEEE Trans. Inf. Theory"},{"key":"391_CR2","doi-asserted-by":"publisher","unstructured":"Standaert, F., Rouvroy, G., Quisquater, J., Legat, J.: (2002) A time-memory tradeoff using distinguished points: New analysis & FPGA results. In: Jr., B.S.K., Ko\u00e7, \u00c7.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2002, 4th International Workshop, Redwood Shores, CA, USA, August 13\u201315, 2002, Revised Papers. Lecture Notes in Computer Science, vol. 2523, pp. 593\u2013609. Springer, Berlin, Heidelberg . https:\/\/doi.org\/10.1007\/3-540-36400-5_43","DOI":"10.1007\/3-540-36400-5_43"},{"key":"391_CR3","doi-asserted-by":"publisher","unstructured":"Biryukov, A., Shamir, A.: Cryptanalytic time\/memory\/data tradeoffs for stream ciphers. In: Okamoto, T. (ed.) Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3\u20137, 2000, Proceedings. Lecture Notes in Computer Science, vol. 1976, pp. 1\u201313. Springer, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_1","DOI":"10.1007\/3-540-44448-3_1"},{"key":"391_CR4","unstructured":"Borst, J., Preneel, B., Vandewalle, J.: On the time-memory tradeoff between exhaustive key search and table precomputation. In: 19th Symposium on Information Theory in the Benelux, Louvain-la-Neuve, Belgium, May 27\u201328, 1998, pp. 111\u2013118. Werkgemeenschap voor Informatie- en Communicatietheorie (WIC), Louvain-la-Neuve, Belgium (1998)"},{"key":"391_CR5","doi-asserted-by":"publisher","unstructured":"Barkan, E., Biham, E., Shamir, A.: Rigorous bounds on cryptanalytic time\/memory tradeoffs. In: Dwork, C. (ed.) Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20\u201324, 2006, Proceedings. Lecture Notes in Computer Science, vol. 4117, pp. 1\u201321. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_1","DOI":"10.1007\/11818175_1"},{"key":"391_CR6","doi-asserted-by":"publisher","unstructured":"Broek, F., Poll, E.: A comparison of time-memory trade-off attacks on stream ciphers. In: Progress in Cryptology - AFRICACRYPT 2013, 6th International Conference on Cryptology in Africa, Cairo, Egypt, June 22\u201324, 2013, Proceedings. Lecture Notes in Computer Science, vol. 7918, pp. 406\u2013423. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38553-7_23","DOI":"10.1007\/978-3-642-38553-7_23"},{"issue":"1","key":"391_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10623-023-01300-x","volume":"92","author":"O Dunkelman","year":"2024","unstructured":"Dunkelman, O., Keller, N., Ronen, E., Shamir, A.: Quantum time\/memory\/data tradeoff attacks. Des. Codes Crypt. 92(1), 159\u2013177 (2024). https:\/\/doi.org\/10.1007\/s10623-023-01300-x","journal-title":"Des. Codes Crypt."},{"key":"391_CR8","doi-asserted-by":"publisher","unstructured":"Hong, J., Jeong, K.C., Kwon, E.Y., Lee, I.-S., Ma, D.: Variants of the distinguished point method for cryptanalytic time memory trade-offs. In: Chen, L., Mu, Y., Susilo, W. (eds.) Information Security Practice and Experience \u2013 4th International Conference, ISPEC 2008, Sydney, Australia, April 21\u201323, 2008, Proceedings. Lecture Notes in Computer Science, vol. 4991, pp. 131\u2013145. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79104-1_10","DOI":"10.1007\/978-3-540-79104-1_10"},{"key":"391_CR9","doi-asserted-by":"publisher","unstructured":"Oechslin, P.: Making a faster cryptanalytic time-memory trade-off. In: Boneh, D. (ed.) Advances in Cryptology - CRYPTO 2003. Lecture Notes in Computer Science, vol. 2729, pp. 617\u2013630. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_36","DOI":"10.1007\/978-3-540-45146-4_36"},{"issue":"4","key":"391_CR10","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00145-012-9128-3","volume":"26","author":"J Hong","year":"2013","unstructured":"Hong, J., Moon, S.: A comparison of cryptanalytic tradeoff algorithms. J. Cryptol. 26(4), 559\u2013637 (2013). https:\/\/doi.org\/10.1007\/s00145-012-9128-3","journal-title":"J. Cryptol."},{"key":"391_CR11","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10623-015-0116-0","volume":"80","author":"GW Lee","year":"2016","unstructured":"Lee, G.W., Hong, J.: Comparison of perfect table cryptanalytic tradeoff algorithms. Des. Codes Crypt. 80, 473\u2013523 (2016). https:\/\/doi.org\/10.1007\/s10623-015-0116-0","journal-title":"Des. Codes Crypt."},{"key":"391_CR12","doi-asserted-by":"publisher","unstructured":"Biryukov, A., Shamir, A., Wagner, D.: Real time cryptanalysis of a5\/1 on a pc. In: Fast Software Encryption, FSE 2000. Lecture Notes in Computer Science, vol. 1978, pp. 1\u201318. Springer, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44706-7_1","DOI":"10.1007\/3-540-44706-7_1"},{"key":"391_CR13","doi-asserted-by":"publisher","unstructured":"Biham, E., Dunkelman, O.: Cryptanalysis of the A5\/1 GSM stream cipher. In: Roy, B.K., Okamoto, E. (eds.) Progress in Cryptology - INDOCRYPT 2000. Lecture Notes in Computer Science, vol. 1977, pp. 43\u201351. Springer, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44495-5_5","DOI":"10.1007\/3-540-44495-5_5"},{"issue":"6","key":"391_CR14","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1002\/spe.2257","volume":"45","author":"JW Kim","year":"2015","unstructured":"Kim, J.W., Seo, J., Hong, J., Park, K., Kim, S.: High-speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous system. Softw. Pract. Exp. 45(6), 837\u2013855 (2015). https:\/\/doi.org\/10.1002\/spe.2257","journal-title":"Softw. Pract. Exp."},{"key":"391_CR15","doi-asserted-by":"publisher","unstructured":"Golic, J.D.: Cryptanalysis of alleged a5 stream cipher. In: Advances in Cryptology - EUROCRYPT 1997. Lecture Notes in Computer Science, vol. 1233, pp. 239\u2013255. Springer, Berlin, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_17","DOI":"10.1007\/3-540-69053-0_17"},{"key":"391_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxac147","author":"G Avoine","year":"2022","unstructured":"Avoine, G., Carpent, X., Leblanc-Albarel, D.: Rainbow tables: How far can cpu go? Comput. J. (2022). https:\/\/doi.org\/10.1093\/comjnl\/bxac147","journal-title":"Comput. J."},{"key":"391_CR17","doi-asserted-by":"publisher","unstructured":"Vanhoef, M.: A time-memory trade-off attack on WPA3\u2019s SAE-PK. In: Cruz, J.P., Yanai, N. (eds.) APKC@AsiaCCS 2022, pp. 27\u201337. ACM, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3494105.3526235","DOI":"10.1145\/3494105.3526235"},{"key":"391_CR18","doi-asserted-by":"publisher","unstructured":"Mentens, N., Batina, L., Preneel, B., Verbauwhede, I.: Time-memory trade-off attack on fpga platforms: Unix password cracking. In: Reconfigurable Computing: Architectures and Applications, ARC 2006. Lecture Notes in Computer Science, vol. 3985, pp. 323\u2013334. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11802839_41","DOI":"10.1007\/11802839_41"},{"key":"391_CR19","doi-asserted-by":"publisher","unstructured":"Avoine, G., Carpent, X., Claverie, T., Devine, C., Leblanc-Albarel, D.: Time-memory trade-offs sound the death knell for GPRS and GSM. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024, 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2024, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 14923, pp. 206\u2013240. Springer, Berlin, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68385-5_7","DOI":"10.1007\/978-3-031-68385-5_7"},{"issue":"1","key":"391_CR20","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1008908.1008914","volume":"15","author":"ME Hellman","year":"1983","unstructured":"Hellman, M.E., Karnin, E.D., Reyneri, J.M.: On the necessity of cryptanalytic exhaustive search. SIGACT News 15(1), 40\u201344 (1983). https:\/\/doi.org\/10.1145\/1008908.1008914","journal-title":"SIGACT News"},{"key":"391_CR21","doi-asserted-by":"publisher","unstructured":"Avoine, G., Carpent, X., Leblanc-Albarel, D.: Precomputation for rainbow tables has never been so fast. In: Bertino, E., Shulman, H., Waidner, M. (eds.) Computer Security \u2013 ESORICS 2021. Lecture Notes in Computer Science, vol. 12973, pp. 215\u2013234. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_11","DOI":"10.1007\/978-3-030-88428-4_11"},{"key":"391_CR22","doi-asserted-by":"publisher","unstructured":"Wang, W., Lin, D.: Analysis of multiple checkpoints in non-perfect and perfect rainbow tradeoff revisited. In: Qing, S., Zhou, J., Liu, D. (eds.) ICICS 2013. Lecture Notes in Computer Science, vol. 8233, pp. 288\u2013301. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-319-02726-5_21","DOI":"10.1007\/978-3-319-02726-5_21"},{"key":"391_CR23","doi-asserted-by":"publisher","unstructured":"Avoine, G., Junod, P., Oechslin, P.: Time-memory trade-offs: False alarm detection using checkpoints. In: Maitra, S., Madhavan, C.E.V., Venkatesan, R. (eds.) Progress in Cryptology - INDOCRYPT 2005. Lecture Notes in Computer Science, vol. 3797, pp. 183\u2013196. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11596219_15","DOI":"10.1007\/11596219_15"},{"key":"391_CR24","doi-asserted-by":"publisher","unstructured":"Avoine, G., Bourgeois, A., Carpent, X.: Analysis of rainbow tables with fingerprints. In: Foo, E., Stebila, D. (eds.) Information Security and Privacy - 20th Australasian Conference, ACISP 2015. Lecture Notes in Computer Science, vol. 9144, pp. 356\u2013374. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-19962-7_21","DOI":"10.1007\/978-3-319-19962-7_21"},{"key":"391_CR25","doi-asserted-by":"publisher","unstructured":"Kim, B., Hong, J.: Analysis of the non-perfect table fuzzy rainbow tradeoff. In: Boyd, C., Simpson, L. (eds.) Information Security and Privacy - 18th Australasian Conference, ACISP 2013. Lecture Notes in Computer Science, vol. 7959, pp. 347\u2013362. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39059-3_24","DOI":"10.1007\/978-3-642-39059-3_24"},{"key":"391_CR26","doi-asserted-by":"publisher","unstructured":"Avoine, G., Carpent, X.: Heterogeneous rainbow table widths provide faster cryptanalyses. In: Karri, R., Sinanoglu, O., Sadeghi, A., Yi, X. (eds.) Proceedings of the 2017 ACM Asia Conference on Computer and Communications Security, AsiaCCS 2017, pp. 815\u2013822. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3052973.3053030","DOI":"10.1145\/3052973.3053030"},{"key":"391_CR27","doi-asserted-by":"publisher","unstructured":"Biryukov, A., Mukhopadhyay, S., Sarkar, P.: Improved time-memory trade-offs with multiple data. In: Preneel, B., Tavares, S.E. (eds.) Selected Areas in Cryptography, SAC 2005. Lecture Notes in Computer Science, vol. 3897, pp. 110\u2013127. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11693383_8","DOI":"10.1007\/11693383_8"},{"key":"391_CR28","doi-asserted-by":"publisher","unstructured":"Avoine, G., Carpent, X.: Optimal storage for rainbow tables. In: Lee, H., Han, D. (eds.) Information Security and Cryptology - ICISC 2013. Lecture Notes in Computer Science, vol. 8565, pp. 144\u2013157. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-12160-4_9","DOI":"10.1007\/978-3-319-12160-4_9"},{"key":"391_CR29","doi-asserted-by":"publisher","unstructured":"Avoine, G., Carpent, X., Kordy, B., Tardif, F.: How to handle rainbow tables with external memory. In: Pieprzyk, J., Suriadi, S. (eds.) Information Security and Privacy - 22nd Australasian Conference, ACISP 2017. Lecture Notes in Computer Science, vol. 10342, pp. 306\u2013323. Springer, Berlin, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-60055-0_16","DOI":"10.1007\/978-3-319-60055-0_16"},{"key":"391_CR30","doi-asserted-by":"publisher","unstructured":"Avoine, G., Carpent, X., Leblanc-Albarel, D.: Stairway to rainbow. In: Liu, J.K., Xiang, Y., Nepal, S., Tsudik, G. (eds.) Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, ASIA CCS 2023, pp. 286\u2013299. ACM, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3579856.3582825","DOI":"10.1145\/3579856.3582825"},{"key":"391_CR31","doi-asserted-by":"publisher","unstructured":"Avoine, G., Junod, P., Oechslin, P.: Characterization and improvement of time-memory trade-off based on perfect tables. ACM Transactions on Information and System Security 11(4), 17\u201311722 (2008). https:\/\/doi.org\/10.1145\/1380564.1380565","DOI":"10.1145\/1380564.1380565"},{"key":"391_CR32","unstructured":"Leblanc-Albarel, D.: Cryptanalytic time-memory trade-off. PhD thesis, INSA de Rennes (2023)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-026-00391-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13389-026-00391-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-026-00391-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T14:13:49Z","timestamp":1778940829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13389-026-00391-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["391"],"URL":"https:\/\/doi.org\/10.1007\/s13389-026-00391-1","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"16 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"5"}}