{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T09:44:17Z","timestamp":1743500657313},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,30]],"date-time":"2012-11-30T00:00:00Z","timestamp":1354233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00200-012-0181-9","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T10:19:58Z","timestamp":1354184398000},"page":"17-36","source":"Crossref","is-referenced-by-count":4,"title":["RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems"],"prefix":"10.1007","volume":"24","author":[{"given":"G\u00fcnther","family":"Brandner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,30]]},"reference":[{"key":"181_CR1","unstructured":"Aly, H., M\u00fcller, W.: Public-key cryptosystems based on Dickson polynomials. In: Proceedings of Pragocrypt, pp. 493\u2013504 (1996)"},{"key":"181_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: Advances in Cryptology\u2014Eurocrypt \u201994, Lecture Notes in Computer Science, vol. 950, pp. 92\u2013111. Springer (1994)","DOI":"10.1007\/BFb0053428"},{"key":"181_CR3","unstructured":"Bernstein, D.: Pippenger\u2019s Exponentiation Algorithm. http:\/\/cr.yp.to\/papers\/pippenger.pdf (2002). Accessed 16 Sept 2012"},{"key":"181_CR4","doi-asserted-by":"crossref","unstructured":"Bleichenbacher, D., Joye, M., Quisquater, J.J.: A new and optimal chosen-message attack on RSA-type cryptosystems. In: Information and Communications Security, Lecture Notes in Computer Science, vol. 1334, pp. 302\u2013313. Springer (1997)","DOI":"10.1007\/BFb0028486"},{"key":"181_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Venkatesan, R.: Breaking RSA may not be equivalent to factoring. In: Advances in Cryptology, Eucrocrypt 98, Lecture Notes in Computer Science, vol. 1403, pp. 59\u201371. Springer (1998)","DOI":"10.1007\/BFb0054117"},{"key":"181_CR6","unstructured":"Intel: Intel(R) 64 and IA-32 architectures optimization reference manual. Technical report, Intel Corporation (2011)"},{"key":"181_CR7","doi-asserted-by":"crossref","unstructured":"Joye, M., Lenstra, A., Quisquater, J.J.: Protocol failures for RSA-like functions using lucas sequences and elliptic curves. In: Security Protocols, Lecture Notes in Computer Science, vol. 1189, pp. 93\u2013100. Springer (1997)","DOI":"10.1007\/3-540-62494-5_8"},{"key":"181_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1431-2","volume-title":"Recent Advances in RSA Cryptography","author":"S Katzenbeisser","year":"2001","unstructured":"Katzenbeisser, S.: Recent Advances in RSA Cryptography. Springer, Berlin (2001)"},{"key":"181_CR9","volume-title":"The Art of Computer Programming: Seminumerical Algorithms","author":"D Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming: Seminumerical Algorithms. Addison-Wesely, Reading (1998)"},{"key":"181_CR10","volume-title":"A Course in Number Theory and Cryptography","author":"N Koblitz","year":"2006","unstructured":"Koblitz, N.: A Course in Number Theory and Cryptography. Springer, Berlin (2006)"},{"key":"181_CR11","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"C Koc","year":"1996","unstructured":"Koc, C., Acar, T.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro. 16, 26\u201333 (1996)","journal-title":"IEEE Micro."},{"issue":"4","key":"181_CR12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.2307\/2302607","volume":"45","author":"D Lehmer","year":"1938","unstructured":"Lehmer, D.: Euclid\u2019s algorithm for large numbers. Am. Math. Mon. 45(4), 7 (1938)","journal-title":"Am. Math. Mon."},{"key":"181_CR13","volume-title":"Dickson Polynomials. Pitman Monographs and Surveys in Pure and Applied Mathematics","author":"R Lidl","year":"1993","unstructured":"Lidl, R., Mullen, G., Turnwald, G.: Dickson Polynomials. Pitman Monographs and Surveys in Pure and Applied Mathematics, vol. 65. Longman Scientific & Technical, London (1993)"},{"key":"181_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01810848","volume":"1","author":"R Lidl","year":"1990","unstructured":"Lidl, R., M\u00fcller, W., Oswald, A.: Some remarks on strong Fibonacci pseudoprimes. Appl. Algebra Eng. Commun. Comput. 1, 59\u201365 (1990)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"181_CR15","unstructured":"Menezes, A., van Oorshot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (2001)"},{"key":"181_CR16","unstructured":"Montgomery, P.: Evaluating Recurrences of the Form $$X_{m+n}=f(X_m, X_n, X_{m-n})$$ via Lucas Chains. http:\/\/research.microsoft.com\/en-us\/um\/people\/petmon\/Lucas.pdf (1983). Unpublished, Accessed 16 Sept 2012"},{"key":"181_CR17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P Montgomery","year":"1985","unstructured":"Montgomery, P.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"181_CR18","doi-asserted-by":"crossref","unstructured":"M\u00fcller, S.: On the security of a Williams based public key encryption scheme. In: Public Key Cryptography, Lecture Notes in Computer Science, vol. 1992, pp. 1\u201318. Springer (2001)","DOI":"10.1007\/3-540-44586-2_1"},{"key":"181_CR19","first-page":"71","volume":"16","author":"W M\u00fcller","year":"1981","unstructured":"M\u00fcller, W., N\u00f6bauer, W.: Some remarks on public-key cryptosystems. Stud. Sci. Math. Hung. 16, 71\u201376 (1981)","journal-title":"Stud. Sci. Math. Hung."},{"key":"181_CR20","unstructured":"Postl, H.: Fast evaluation of Dickson polynomials. In: Contributions to General Algebra 6, pp. 223\u2013225. Verlag H\u00f6lder-Pichler-Tempsky, Vienna (1988)"},{"key":"181_CR21","unstructured":"Quisquater, J.J., Couvreur, C.: Fast decipherment algorithm for RSA public-key cryptosystem. Electron. Lett. 18(21), 905\u2013907 (1982)"},{"key":"181_CR22","doi-asserted-by":"crossref","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120\u2013126 (1978)","DOI":"10.1145\/359340.359342"},{"key":"181_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03269-5","volume-title":"Public-Key Cryptography","author":"A Salomaa","year":"1996","unstructured":"Salomaa, A.: Public-Key Cryptography, 2nd edn. Springer, Berlin (1996)","edition":"2"},{"key":"181_CR24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/152379.152384","volume":"27","author":"J Shallit","year":"1993","unstructured":"Shallit, J., Sorenson, J.: A binary algorithm for the Jacobi symbol. ACM SIGSAM Bull. 27, 4\u201311 (1993)","journal-title":"ACM SIGSAM Bull."},{"key":"181_CR25","unstructured":"Smith., P., Lennon, M.: LUC: A new public key system. In: Proceedings of IFIP International Symposium on Computer Security, pp. 97\u2013111 (1993)"},{"key":"181_CR26","unstructured":"The GNU Multiple Precision Arithmetic Library. http:\/\/gmplib.org\/ . Accessed 16 Sept 2012"},{"key":"181_CR27","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1017\/S1446788700038349","volume":"58","author":"G Turnwald","year":"1995","unstructured":"Turnwald, G.: On Shur\u2019s conjecture. J. Aust. Math. Soc. 58, 312\u2013357 (1995)","journal-title":"J. Aust. Math. Soc."},{"key":"181_CR28","doi-asserted-by":"crossref","unstructured":"Welschenbach, M.: Kryptographie in C und C++. Springer, Berlin (2001)","DOI":"10.1007\/978-3-642-56445-1"},{"key":"181_CR29","doi-asserted-by":"crossref","unstructured":"Williams, H.: Some public key crypto-functions as intractable as factorization. In: Proceedings of Crypto, pp. 66\u201370 (1984)","DOI":"10.1007\/3-540-39568-7_7"},{"key":"181_CR30","volume-title":"\u00c9douard Lucas and Primality Testing","author":"H Williams","year":"1998","unstructured":"Williams, H.: \u00c9douard Lucas and Primality Testing. Wiley, London (1998)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-012-0181-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-012-0181-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-012-0181-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T02:40:58Z","timestamp":1562380858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-012-0181-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,30]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["181"],"URL":"https:\/\/doi.org\/10.1007\/s00200-012-0181-9","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,30]]}}}