{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:32:58Z","timestamp":1744173178817,"version":"3.40.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s12095-024-00755-6","type":"journal-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T09:10:51Z","timestamp":1733217051000},"page":"621-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pseudo-random walk on ideals: Practical speed-up in relation collection for class group computation"],"prefix":"10.1007","volume":"17","author":[{"given":"Madhurima","family":"Mukhopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Palash","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"issue":"191","key":"755_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"E Bach","year":"1990","unstructured":"Bach, E.: Explicit bounds for primality testing and related problems. Math. Comput. 55(191), 355\u2013380 (1990)","journal-title":"Math. Comput."},{"issue":"288","key":"755_CR2","doi-asserted-by":"publisher","first-page":"2005","DOI":"10.1090\/S0025-5718-2014-02651-3","volume":"83","author":"JF Biasse","year":"2014","unstructured":"Biasse, J.F.: An $$L(1\/3)$$ algorithm for ideal class group and regulator computation in certain number fields. Math. Comput. 83(288), 2005\u20132031 (2014)","journal-title":"Math. Comput."},{"key":"755_CR3","doi-asserted-by":"crossref","unstructured":"Biasse, J.F., Fieker, C.: Subexponential class group and unit group computation in large degree number fields. LMS Journal of Computation and Mathematics. 17(A),385\u2013403. (2014)","DOI":"10.1112\/S1461157014000345"},{"key":"755_CR4","doi-asserted-by":"crossref","unstructured":"Biasse, J.F., Iezzi, A., Jacobson, Jr M.J.: A note on the security of CSIDH (2018). arXiv:1806.03656","DOI":"10.1007\/978-3-030-05378-9_9"},{"key":"755_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In Alexandra Boldyreva and Daniele Micciancio, editors, Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I, volume 11692 of Lecture Notes in Computer Science, pages 561\u2013586. Springer (2019)","DOI":"10.1007\/978-3-030-26948-7_20"},{"issue":"1990","key":"755_CR6","first-page":"27","volume":"1989","author":"J Buchmann","year":"1988","unstructured":"Buchmann, J.: A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. S\u00e9minaire de th\u00e9orie des nombres, Paris. 1989(1990), 27\u201341 (1988)","journal-title":"S\u00e9minaire de th\u00e9orie des nombres, Paris."},{"key":"755_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In Anne Canteaut and Yuval Ishai, editors, Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part I, volume 12105 of Lecture Notes in Computer Science, pages 677\u2013706. Springer (2020)","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"755_CR8","doi-asserted-by":"crossref","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In Thomas Peyrin and Steven\u00a0D. Galbraith, editors, Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III, volume 11274 of Lecture Notes in Computer Science, pages 395\u2013427. Springer (2018)","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"755_CR9","unstructured":"Cohen, H.: A course in computational algebraic number theory. Springer (1996)"},{"key":"755_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, H., Diaz, F.D.y., Olivier, M.: Subexponential algorithms for class group and unit computations. Journal of Symbolic Computation. 24(3\u20134),433\u2013441 (1997)","DOI":"10.1006\/jsco.1996.0143"},{"key":"755_CR11","unstructured":"Dobson, S., Galbraith, S.D., Smith, B.: Trustless unknown-order groups. Mathematical Cryptology. 1(2) (2022). https:\/\/journals.flvc.org\/mathcryptology\/article\/view\/130579"},{"key":"755_CR12","unstructured":"G\u00e9lin, A.: On the complexity of class group computations for large degree number fields (2018). arXiv:1810.11396"},{"key":"755_CR13","unstructured":"G\u00e9lin, A.: Reducing the complexity for class group computations using small defining polynomials (2018). arXiv:1810.12010"},{"key":"755_CR14","doi-asserted-by":"crossref","unstructured":"G\u00e9lin, A., Joux, A.: Reducing number field defining polynomials: an application to class group computations. LMS Journal of Computation and Mathematics. 19(A), 315\u2013331 (2016)","DOI":"10.1112\/S1461157016000255"},{"issue":"4","key":"755_CR15","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"JL Hafner","year":"1989","unstructured":"Hafner, J.L., McCurley, K.S.: A rigorous subexponential algorithm for computation of class groups. J. Am. Math. Soc. 2(4), 839\u2013850 (1989)","journal-title":"J. Am. Math. Soc."},{"issue":"1","key":"755_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1112\/S1461157014000424","volume":"17","author":"JW Jones","year":"2014","unstructured":"Jones, J.W., Roberts, D.P.: A database of number fields. LMS J. Comput. Math. 17(1), 595\u2013618 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"755_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1090\/pspum\/020\/0316385","volume":"20","author":"D Shanks","year":"1969","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In Proceedings of Symposium of Pure Mathematics 20, 415\u2013440 (1969)","journal-title":"In Proceedings of Symposium of Pure Mathematics"},{"key":"755_CR18","unstructured":"Shanks, D.: The infrastructure of a real quadratic field and its applications. In Proceedings of the 1972 Number Theory Conference, pages 217\u2013224 (1972)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00755-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00755-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00755-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T02:30:54Z","timestamp":1744165854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00755-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["755"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00755-6","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"22 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}