{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:33:12Z","timestamp":1761895992962},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T00:00:00Z","timestamp":1417478400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00200-014-0237-0","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T14:25:56Z","timestamp":1417443956000},"page":"251-275","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The Rabin cryptosystem revisited"],"prefix":"10.1007","volume":"26","author":[{"given":"Michele","family":"Elia","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Piva","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Schipani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,2]]},"reference":[{"key":"237_CR1","volume-title":"Introduction to analytic number theory","author":"TM Apostol","year":"1976","unstructured":"Apostol, T.M.: Introduction to analytic number theory. Springer, New York (1976)"},{"key":"237_CR2","volume-title":"Algorithmic number theory","author":"E Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic number theory. Cambridge Mass, MIT (1996)"},{"key":"237_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Proving tight security for Rabin\u2013Williams signatures. In: Smart, NP. (ed.), EUROCRYPT 2008, LNCS, vol. 4965, pp. 70\u201387. Springer, New York (2008)","DOI":"10.1007\/978-3-540-78967-3_5"},{"key":"237_CR4","volume-title":"Introduction to cryptography","author":"JA Buchmann","year":"1999","unstructured":"Buchmann, J.A.: Introduction to cryptography. Springer, New York (1999)"},{"issue":"154","key":"237_CR5","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"DG Cantor","year":"1981","unstructured":"Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comp. 36(154), 587\u2013592 (1981)","journal-title":"Math. Comp."},{"key":"237_CR6","first-page":"265","volume":"83","author":"R Dedekind","year":"1877","unstructured":"Dedekind, R.: Schreiben an Herrn Borchardt. J. Reine Angew. Math. 83, 265\u2013292 (1877)","journal-title":"J. Reine Angew. Math."},{"issue":"224\u2013274","key":"237_CR7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1515\/crll.1850.39.275","volume":"39","author":"G Eisenstein","year":"1850","unstructured":"Eisenstein, G.: \u00dcber einige allgemeine Eigenschaften der Gleichung, von welcher die Theilung der ganzen Lemniscate abh\u00e4ngt, nebst Anwendungen derselben auf die Zahlentheorie. J. Reine Angew. Math. 39(224\u2013274), 275\u2013287 (1850)","journal-title":"J. Reine Angew. Math."},{"issue":"6","key":"237_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1080\/09720529.2013.858478","volume":"16","author":"M Elia","year":"2013","unstructured":"Elia, M., Schipani, D.: On the Rabin signature. J. Discrete Math. Sci. Cryptogr. 16(6), 367\u2013378 (2013)","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"237_CR9","unstructured":"Elia, M., Schipani, D.: Improvements on the Cantor\u2013Zassenhaus factorization algorithm, to appear in Math. Bohem"},{"key":"237_CR10","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More constructions of lossy and correlation-secure trapdoor functions, PKC 2010, Springer LNCS 6056, 279\u2013295 (2010)"},{"key":"237_CR11","volume-title":"Algebraic number theory","author":"A Fr\u00f6hlich","year":"1994","unstructured":"Fr\u00f6hlich, A., Taylor, M.J.: Algebraic number theory. Cambridge Univ. Press, Cambridge (1994)"},{"key":"237_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139012843","volume-title":"The mathematics of public key cryptography","author":"S Galbraith","year":"2012","unstructured":"Galbraith, S.: The mathematics of public key cryptography. Cambridge Univ. Press, Cambridge (2012)"},{"key":"237_CR13","volume-title":"Topics from the theory of numbers","author":"E Grosswald","year":"2009","unstructured":"Grosswald, E.: Topics from the theory of numbers. Birkh\u00e4user, Basel (2009)"},{"key":"237_CR14","volume-title":"An introduction to the theory of numbers","author":"GH Hardy","year":"1971","unstructured":"Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford at the Clarendon Press, Oxford (1971)"},{"key":"237_CR15","volume-title":"An introduction to mathematical cryptography","author":"J Hoffstein","year":"2008","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: An introduction to mathematical cryptography. Springer, New York (2008)"},{"key":"237_CR16","volume-title":"A classical introduction to modern number theory","author":"K Ireland","year":"1998","unstructured":"Ireland, K., Rosen, M.: A classical introduction to modern number theory. Springer, New York (1998)"},{"issue":"1","key":"237_CR17","first-page":"61","volume":"23","author":"N Kaiblinger","year":"2011","unstructured":"Kaiblinger, N.: Cyclotomic rings with simple Euclidean algorithm. JP J. Algebra Number Theory Appl. 23(1), 61\u201376 (2011)","journal-title":"JP J. Algebra Number Theory Appl."},{"key":"237_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/0161-118891862972","volume":"XII","author":"K Kurosawa","year":"1988","unstructured":"Kurosawa, K., Itoh, T., Takeuchi, M.: Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number. CRYPTOLOGIA XII, 225\u2013233 (1988)","journal-title":"CRYPTOLOGIA"},{"issue":"9","key":"237_CR19","doi-asserted-by":"crossref","first-page":"4249","DOI":"10.1109\/TIT.2009.2025532","volume":"55","author":"K Kurosawa","year":"2009","unstructured":"Kurosawa, K., Takagi, T.: One-wayness equivalent to general factoring. IEEE Trans. on Inform. Theory 55(9), 4249\u20134262 (2009)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"237_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12893-0","volume-title":"Reciprocity laws","author":"F Lemmermeyer","year":"2000","unstructured":"Lemmermeyer, F.: Reciprocity laws. Springer, New York (2000)"},{"key":"237_CR21","volume-title":"Handbook of applied cryptography","author":"AJ Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Boca Raton (1997)"},{"issue":"1","key":"237_CR22","first-page":"121","volume":"8","author":"C Monico","year":"2007","unstructured":"Monico, C., Elia, M.: On the representation of primes in $$\\mathbb{Q}(\\sqrt{2})$$ Q ( 2 ) as sums of squares. JP J. Algebra Number Theory Appl. 8(1), 121\u2013133 (2007)","journal-title":"JP J. Algebra Number Theory Appl."},{"key":"237_CR23","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern J (ed) Advances in Cryptology\u2014EUROCRYPT \u201999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, pp 223\u2013238 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"237_CR24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-48000-6_14","volume":"1716","author":"P Paillier","year":"1999","unstructured":"Paillier, P., Pointcheval, D.: Efficient public-key cryptosystems provably secure against active adversaries, advances in cryptology\u2014ASIACRYPT99. Lect. Notes Comput. Sci. 1716, 165\u2013179 (1999)","journal-title":"Lect. Notes Comput. Sci."},{"key":"237_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07324-7","volume-title":"Fundamentals of computer security","author":"J Pieprzyk","year":"2003","unstructured":"Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamentals of computer security. Springer, New York (2003)"},{"key":"237_CR26","unstructured":"Rabin, M.: Digitalized signature as intractable as factorization, technical report MIT\/LCS\/TR-212, MIT Laboratory for Computer Science, January (1978)"},{"key":"237_CR27","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440161","volume-title":"Dedekind sums","author":"H Rademacher","year":"1972","unstructured":"Rademacher, H., Grosswald, E.: Dedekind sums. MAA, New York (1972)"},{"key":"237_CR28","unstructured":"Schneier, B.: Applied cryptography. Wiley, New York (1996)"},{"issue":"4","key":"237_CR29","first-page":"753","volume":"E80\u2013A","author":"T Takagi","year":"1997","unstructured":"Takagi, T., Naito, S.: Extension of Rabin cryptosystem to Eisenstein and Gauss Fields. IEICE Trans. Fundam. E80\u2013A(4), 753\u2013760 (1997)","journal-title":"IEICE Trans. Fundam."},{"key":"237_CR30","volume-title":"Modern computer algebra","author":"J von zur Gathen","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge Univ. Press, Cambridge (1999)"},{"issue":"6","key":"237_CR31","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"IT\u201326","author":"HC Williams","year":"1980","unstructured":"Williams, H.C.: A modification of the RSA public-key encryption procedure. IEEE Trans. Inf. Th. IT\u201326(6), 726\u2013729 (1980)","journal-title":"IEEE Trans. Inf. Th."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-014-0237-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-014-0237-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-014-0237-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T10:58:57Z","timestamp":1598525937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-014-0237-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,2]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["237"],"URL":"https:\/\/doi.org\/10.1007\/s00200-014-0237-0","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,2]]}}}