{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T13:40:22Z","timestamp":1661521222654},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T00:00:00Z","timestamp":1530057600000},"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":["Math.Comput.Sci."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s11786-018-0348-2","type":"journal-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T04:40:33Z","timestamp":1530074433000},"page":"319-337","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Smoothness Test for Polynomials Defined Over Small Characteristic Finite Fields"],"prefix":"10.1007","volume":"12","author":[{"given":"Gora","family":"Adj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isaac","family":"Canales-Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Rivera-Zamarripa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Rodr\u00edguez-Henr\u00edquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"key":"348_CR1","unstructured":"Adj, G., Canales-Mart\u00ednez, I., Cruz-Cort\u00e9s, N., Menezes, A., Oliveira, T., Rivera-Zamarripa, L., Rodr\u00edguez-Henr\u00edquez, F.: Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields. Cryptology ePrint Archive, Report 2016\/914, (2016). http:\/\/eprint.iacr.org\/2016\/914"},{"key":"348_CR2","unstructured":"Adj, G.: Logaritmo discreto en campos finitos de caracter\u00edstica peque\u00f1a: atacando la criptograf\u00eda basada en emparejamientos de Tipo 1. PhD thesis, CINVESTAV-IPN, 7 (2016). http:\/\/tinyurl.com\/yan2ukwa"},{"key":"348_CR3","first-page":"20","volume-title":"Pairing-Based Cryptography\u2014Pairing 2013, vol. 8365 of Lecture Notes in Computer Science","author":"G Adj","year":"2014","unstructured":"Adj, G., Menezes, A., Oliveira, T., Rodr\u00edguez-Henr\u00edquez, F.: Weakness of $$\\mathbb{F}_{3^{6 \\cdot 509}}$$ F 3 6 \u00b7 509 for discrete logarithm cryptography. In: Cao, Z., Zhang, F. (eds.) Pairing-Based Cryptography\u2014Pairing 2013, vol. 8365 of Lecture Notes in Computer Science, pp. 20\u201344. Springer International Publishing, New York (2014)"},{"key":"348_CR4","first-page":"3","volume-title":"Arithmetic of Finite Fields, volume 9061 of Lecture Notes in Computer Science","author":"G Adj","year":"2015","unstructured":"Adj, G., Menezes, A., Oliveira, T., Rodr\u00edguez-Henr\u00edquez, F.: Computing discrete logarithms in $${\\mathbb{F}}_{3^{6 \\cdot 137}}$$ F 3 6 \u00b7 137 and $${\\mathbb{F}}_{3^{6 \\cdot 163}}$$ F 3 6 \u00b7 163 using magma. In: Ko\u00e7, C.K., Mesnager, S., Sava\u015f, E. (eds.) Arithmetic of Finite Fields, volume 9061 of Lecture Notes in Computer Science, pp. 3\u201322. Springer International Publishing, New York (2015)"},{"key":"348_CR5","doi-asserted-by":"crossref","unstructured":"Adleman, L.: A Subexponential algorithm for the discrete logarithm problem with applications to cryptography. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pp. 55\u201360 (1979)","DOI":"10.1109\/SFCS.1979.2"},{"key":"348_CR6","unstructured":"Canales-Mart\u00ednez. I.\u00a0A.: Implementaci\u00f3n eficiente de prueba de suavidad para polinomios. Master\u2019s thesis, CINVESTAV-IPN, 12 2015. http:\/\/tinyurl.com\/y9p6xk7s"},{"issue":"4","key":"348_CR7","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"30","author":"D Coppersmith","year":"1984","unstructured":"Coppersmith, D.: Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inf. Theory 30(4), 587\u2013594 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"348_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jagm.2001.1158","volume":"40","author":"P Flajolet","year":"2001","unstructured":"Flajolet, P., Gourdon, X., Panario, D.: The complete analysis of a polynomial factorization algorithm over finite fields. J. Algorithms 40(1), 37\u2013812 (2001)","journal-title":"J. Algorithms"},{"key":"348_CR9","doi-asserted-by":"crossref","unstructured":"G\u00f6loglu, F., \u00a0Granger, R., McGuire, G., \u00a0Zumbr\u00e4gel, J.: On the function field sieve and the impact of higher splitting probabilities\u2014application to discrete logarithms. In: Canetti, R., Garay, J.A. (eds) Advances in Cryptology\u2014CRYPTO 2013\u201433rd Annual Cryptology Conference, volume 8043 of Lecture Notes in Computer Science. Springer, pp. 109\u2013128 (2013)","DOI":"10.1007\/978-3-642-40084-1_7"},{"key":"348_CR10","unstructured":"Granger, R., Kleinjung, T., Zumbr\u00e4gel, J.: Breaking \u2018128-bit Secure\u2019 supersingular binary curves (or how to solve discrete logarithms in $${\\mathbb{F}}_{2^{4 \\cdot 1223}}$$ F 2 4 \u00b7 1223 and $${\\mathbb{F}}_{2^{12 \\cdot 367}}$$ F 2 12 \u00b7 367 ). Cryptology. ePrint Archive, Report 2014\/119, (2014). http:\/\/eprint.iacr.org\/2014\/119"},{"key":"348_CR11","first-page":"126","volume-title":"Advances in Cryptology\u2014CRYPTO 2014, volume 8617 of Lecture Notes in Computer Science","author":"R Granger","year":"2014","unstructured":"Granger, R., Kleinjung, T., Zumbr\u00e4gel, J.: Breaking \u2018128-bit Secure\u2019 Supersingular Binary Curves (Or How to Solve Discrete Logarithms in $${\\mathbb{F}}_{2^{4 \\cdot 1223}}$$ F 2 4 \u00b7 1223 and $${\\mathbb{F}}_{2^{12 \\cdot 367}}$$ F 2 12 \u00b7 367 ). In: Garay, Juan A., Gennaro, Rosario (eds.) Advances in Cryptology\u2014CRYPTO 2014, volume 8617 of Lecture Notes in Computer Science, pp. 126\u2013145. Springer, Berlin, Heidelberg (2014)"},{"key":"348_CR12","doi-asserted-by":"crossref","unstructured":"Hellman, M., Reyneri, J.: Fast computation of discrete logarithms in $$GF(q)$$ G F ( q ) . In: Chaum, D., Rivest, R., Sherman, A. (eds) Advances in Cryptology: Proceedings of CRYPTO \u201982. Springer US, pp. 3\u201313 (1983)","DOI":"10.1007\/978-1-4757-0602-4_1"},{"key":"348_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1515\/crll.1846.30.166","volume":"30","author":"CG Jacobi","year":"1846","unstructured":"Jacobi, C.G.: \u00dcber die Kreistheilung und ihre Anwendung auf die Zahlentheorie. J. Reine Angew. Math. 30, 166\u2013182 (1846)","journal-title":"J. Reine Angew. Math."},{"key":"348_CR14","doi-asserted-by":"crossref","unstructured":"Joux, A.: A new index calculus algorithm with complexity $${L}(\\frac{1}{4} + o(1))$$ L ( 1 4 + o ( 1 ) ) in small characteristic. In: Lange, T., Lauter, K., Lison\u0115k, P. (eds.) Selected Areas in Cryptography\u2014SAC 2013. Lecture Notes in Computer Science, pp. 355\u2013379. Springer, Berlin Heidelberg (May 2014)","DOI":"10.1007\/978-3-662-43414-7_18"},{"key":"348_CR15","first-page":"595","volume":"7","author":"AA Karatsuba","year":"1963","unstructured":"Karatsuba, A.A., Ofman, Y.: Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. 7, 595\u20137596 (1963)","journal-title":"Sov. Phys. Dokl."},{"key":"348_CR16","volume-title":"Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications, 2nd edn. Cambridge University Press, Cambridge (1997)","edition":"2"},{"key":"348_CR17","doi-asserted-by":"crossref","DOI":"10.1201\/b15006","volume-title":"Handbook of Finite Fields. Discrete Mathematics and Its Applications","author":"GL Mullen","year":"2013","unstructured":"Mullen, G.L., Panario, D.: Handbook of Finite Fields. Discrete Mathematics and Its Applications. CRC Press, Boca Raton (2013)"},{"key":"348_CR18","first-page":"405","volume-title":"International Conference on Computer Science and Technology","author":"F Rodr\u00edguez-Henr\u00edquez","year":"2003","unstructured":"Rodr\u00edguez-Henr\u00edquez, F., Ko\u00e7, \u00c7.K.: On fully parallel Karatsuba multipliers for GF( $$2^m$$ 2 m ). In: Tria, A., Choi, D. (eds.) International Conference on Computer Science and Technology, pp. 405\u2013410. ACTA Press, Calgary (2003)"},{"key":"348_CR19","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2009","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge University Press, Cambridge (2009)","edition":"2"},{"key":"348_CR20","doi-asserted-by":"crossref","unstructured":"von zur Gathen J, Gerhard J, : Modern computer algebra, 3rd edn. Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9781139856065"},{"key":"348_CR21","unstructured":"Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba algorithm for efficient implementations. Cryptology. ePrint Archive, Report 2006\/224, (2006). http:\/\/eprint.iacr.org\/"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-018-0348-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0348-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0348-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T13:20:11Z","timestamp":1661520011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-018-0348-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["348"],"URL":"https:\/\/doi.org\/10.1007\/s11786-018-0348-2","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,27]]},"assertion":[{"value":"6 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}