{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T04:29:23Z","timestamp":1772166563025,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-107274RB-1000 and PID2023-148649OB-I00"],"award-info":[{"award-number":["PID2019-107274RB-1000 and PID2023-148649OB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-107274RB-1000 and PID2023-148649OB-I00"],"award-info":[{"award-number":["PID2019-107274RB-1000 and PID2023-148649OB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. on Info. Security"],"DOI":"10.1186\/s13635-025-00218-2","type":"journal-article","created":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T09:15:21Z","timestamp":1761297321000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A fast method for finding separable Goppa polynomials used in post-quantum McEliece-based cryptography"],"prefix":"10.1186","volume":"2025","author":[{"given":"Mariano","family":"Lopez-Garcia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Canto-Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,24]]},"reference":[{"key":"218_CR1","first-page":"24","volume":"6","author":"V Goppa","year":"1970","unstructured":"V. Goppa, A new class of linear error-correcting codes. Probl. Peredachi Inf. 6, 24\u201360 (1970)","journal-title":"Probl. Peredachi Inf."},{"key":"218_CR2","unstructured":"R.J. McEliece. A public-key cryptosystem based on algebraic coding theory. (1978). Preprint at https:\/\/tmo.jpl.nasa.gov\/progress_report\/42-44\/44N.PDF"},{"key":"218_CR3","doi-asserted-by":"crossref","unstructured":"N.\u00a0Sendrier, in Encyclopedia of Cryptography and Security, ed. by H.C.A. Van\u00a0Tilborg. McEliece public key cryptosystem (Springer US, Boston, 2011), pp. 767\u2013768","DOI":"10.1007\/978-1-4419-5906-5_384"},{"key":"218_CR4","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory prob. Contr. Inform. Theory 15, 159\u2013166 (1986)","journal-title":"Contr. Inform. Theory"},{"issue":"4","key":"218_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1515\/dma.1992.2.4.439","volume":"2","author":"VM Sidelnikov","year":"1992","unstructured":"V.M. Sidelnikov, O. Shestakov, On insecurity of cryptosystems based on generalized reed-solomon codes. J. Discret. Math. Appl. 2(4), 439\u2013444 (1992). https:\/\/doi.org\/10.1515\/dma.1992.2.4.439","journal-title":"J. Discret. Math. Appl."},{"key":"218_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H Janwa","year":"1996","unstructured":"H. Janwa, O. Moreno, Mceliece public key cryptosystems using algebraic-geometric codes. Des. Codes Crypt. 8, 293\u2013307 (1996). https:\/\/doi.org\/10.1023\/A:1027351723034","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"218_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"V.M. Sidelnikov, A public-key cryptosystem based on binary reed-muller codes. J. Discret. Math. Appl. 4(3), 191\u2013208 (1994). https:\/\/doi.org\/10.1515\/dma.1994.4.3.191","journal-title":"J. Discret. Math. Appl."},{"key":"218_CR8","doi-asserted-by":"publisher","unstructured":"K.\u00a0Gibson, The security of the Gabidulin public key cryptosystem. Advances in Cryptology \u2014 EUROCRYPT \u201996 (1996), pp. 212\u2013223. https:\/\/doi.org\/10.1007\/3-540-68339-9_19","DOI":"10.1007\/3-540-68339-9_19"},{"issue":"3","key":"218_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1049\/iet-ifs.2012.0127","volume":"7","author":"M Baldi","year":"2013","unstructured":"M. Baldi, M. Bianchi, F. Chiaraluce, Security and complexity of the McEliece cryptosystem based on quasi-cyclic low-density parity-check codes. IET Inf. Secur. 7(3), 212\u2013220 (2013). https:\/\/doi.org\/10.1049\/iet-ifs.2012.0127","journal-title":"IET Inf. Secur."},{"issue":"8","key":"218_CR10","doi-asserted-by":"publisher","first-page":"5405","DOI":"10.1109\/TIT.2017.2712636","volume":"63","author":"A Couvreur","year":"2017","unstructured":"A. Couvreur, I. Marquez-Corbella, R. Pellikaan, Cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes. IEEE Trans. Inf. Theory 63(8), 5405\u20135418 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2712636","journal-title":"IEEE Trans. Inf. Theory"},{"key":"218_CR11","doi-asserted-by":"publisher","unstructured":"L.\u00a0Minder, A.\u00a0Shokrollahi, Advances in Cryptology - EUROCRYPT 2007, Cryptanalysis of the Sidelnikov cryptosystem (2007), pp. 347\u2013360. https:\/\/doi.org\/10.1007\/978-3-540-72540-4_20","DOI":"10.1007\/978-3-540-72540-4_20"},{"issue":"5","key":"218_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1515\/dma-2014-0024","volume":"24","author":"MA Borodin","year":"2014","unstructured":"M.A. Borodin, I.V. Chizhov, Effective attack on the mceliece cryptosystem based on reed-muller codes. Discret. Math. Appl. 24(5), 273\u2013280 (2014). https:\/\/doi.org\/10.1515\/dma-2014-0024","journal-title":"Discret. Math. Appl."},{"key":"218_CR13","doi-asserted-by":"publisher","unstructured":"T.\u00a0Fab\u0161i\u010d, V.\u00a0Hromada, International Workshop on Post-Quantum Cryptography, A reaction attack on the QC-LDPC McEliece cryptosystem (2017), pp. 51\u201368. https:\/\/doi.org\/10.1007\/978-3-319-5","DOI":"10.1007\/978-3-319-5"},{"key":"218_CR14","unstructured":"M.\u00a0Albrecht, D.\u00a0Bernstein, Classic McEliece: conservative code-based cryptography. (2020). Preprint at https:\/\/classic.mceliece.org\/nist\/mceliece-20201010.pdf"},{"key":"218_CR15","unstructured":"NIST, Post-quantum cryptography standardization: call for proposals. (2016). Preprint at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/call-for-proposals"},{"key":"218_CR16","unstructured":"M.\u00a0Baldi, A.\u00a0Barenghi, F.\u00a0Chiaraluce, G.\u00a0Pelosi, P.\u00a0Santini, Ledacrypt specification v3.0. (2020). Preprint at https:\/\/nts-kem.io\/"},{"key":"218_CR17","unstructured":"M.\u00a0Albrecht, C.\u00a0Cid, K.G. Paterson, C.\u00a0Tjhai, M.\u00a0Tomlinson, Nts-kem a code-based key-encapsulation mechanism submitted to NIST post-quantum cryptography standardization process. (2019). Preprint at https:\/\/nts-kem.io\/"},{"key":"218_CR18","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866","author":"LK Grover","year":"1996","unstructured":"L.K. Grover, A fast quantum mechanical algorithm for database search (1996). https:\/\/doi.org\/10.1145\/237814.237866","journal-title":"A fast quantum mechanical algorithm for database search"},{"key":"218_CR19","doi-asserted-by":"publisher","unstructured":"D.\u00a0Bernstein, Grover vs. McEliece, International Workshop on Post-Quantum Cryptography (2010), pp. 73\u201380. https:\/\/doi.org\/10.1007\/978-3-642-12929-2_6","DOI":"10.1007\/978-3-642-12929-2_6"},{"key":"218_CR20","doi-asserted-by":"publisher","unstructured":"R.\u00a0Arjona, P.\u00a0L\u00f3pez-Gonz\u00e1lez, P.\u00a0Rom\u00e1n, I.\u00a0Baturone, Post-quantum biometric authentication based on homomorphic encryption and classic McEliece. Appl. Sci. 13(2:757), 1\u201319 (2023). https:\/\/doi.org\/10.3390\/app13020757","DOI":"10.3390\/app13020757"},{"key":"218_CR21","doi-asserted-by":"publisher","unstructured":"E.\u00a0Cant\u00f3-Navarro, M.\u00a0L\u00f3pez-Garc\u00eda, AXI hardware accelerator for McEliece on FPGA embedded systems. IEEE Trans. Dependable Secure Comput. 1\u201314 (2024). https:\/\/doi.org\/10.1109\/TDSC.2024.3445181","DOI":"10.1109\/TDSC.2024.3445181"},{"key":"218_CR22","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1007\/978-3-030-39442-4_60","volume":"3","author":"M L\u00f3pez-Garc\u00eda","year":"2020","unstructured":"M. L\u00f3pez-Garc\u00eda, E. Cant\u00f3-Navarro, Proceedings of the 2020 future of information and communication conference (ficc). Hardware-Software Implementation of a McEliece Cryptosystem for Post-quantum Cryptography. 3, 814\u2013825 (2020). https:\/\/doi.org\/10.1007\/978-3-030-39442-4_60","journal-title":"Hardware-Software Implementation of a McEliece Cryptosystem for Post-quantum Cryptography."},{"key":"218_CR23","unstructured":"E.\u00a0Jochemsz, Goppa codes and the McEliece cryptosystem, Vrije Universiteit Amsterdam. (2002). Preprint at https:\/\/pdfcoffee.com\/goppa-codes-and-the-mceliece-cryptosystem-pdf-free.html"},{"key":"218_CR24","unstructured":"R.\u00a0Safieddine, A.\u00a0Desmarais, Comparison of different decoding algorithms for binary Boppa codes (University of Lyon, Hubert Curien Laboratory. pp. 1\u201319 (2014). Preprint at https:\/\/www.cayrel.net\/?Implementation-of-Goppa-codes"},{"key":"218_CR25","unstructured":"Flexiprovider: JCryptool Cryptogtaphy for everybody. (2016). Preprint at https:\/\/www.cryptool.org\/en\/"},{"issue":"11","key":"218_CR26","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1109\/TC.2010.115","volume":"59","author":"A Shoufan","year":"2010","unstructured":"A. Shoufan, T. Wink, H.G. Molter, S.A. Huss, E. Kohnert, A novel cryptoprocessor architecture for the mceliece public-key cryptosystem. IEEE Trans. Comput. 59(11), 1533\u20131546 (2010). https:\/\/doi.org\/10.1109\/TC.2010.115","journal-title":"IEEE Trans. Comput."},{"key":"218_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/IEEESTD.2000.92292","volume":"1363\u20132000","author":"IEEE Standard Specifications for Public-Key Cryptography","year":"2000","unstructured":"IEEE Standard Specifications for Public-Key Cryptography, IEEE Std 1363\u20132000, 1\u2013228 (2000). https:\/\/doi.org\/10.1109\/IEEESTD.2000.92292","journal-title":"IEEE Std"},{"key":"218_CR28","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"E.R. Berlekamp, Algebraic Coding Theory (McGraw-Hill, New York, 1968)"},{"issue":"5","key":"218_CR29","doi-asserted-by":"publisher","first-page":"369","DOI":"10.4169\/math.mag.84.5.369","volume":"84","author":"KC Sunil","year":"2011","unstructured":"K.C. Sunil, J. Minac, Counting irreducible polynomials over finite fields using the inclusion-exclusion principle. Math. Mag. 84(5), 369\u2013371 (2011). arXiv:1001.0409","journal-title":"Math. Mag."},{"key":"218_CR30","doi-asserted-by":"crossref","unstructured":"W. Wang, J. Szefer, R. Niederhagen, FPGA-based Key Generator for the Niederreiter Cryptosystem Using Binary Goppa Codes, in Cryptographic Hardware and Embedded Systems - CHES 2017. ed. by W. Fischer, N. Homma (Springer International Publishing, Cham, 2017), pp.253\u2013274","DOI":"10.1007\/978-3-319-66787-4_13"},{"key":"218_CR31","doi-asserted-by":"crossref","unstructured":"W. Wang, J. Szefer, R. Niederhagen, FPGA-Based Niederreiter Cryptosystem Using Binary Goppa Codes, in Post-Quantum Cryptography. ed. by T. Lange (Springer International Publishing, Cham, 2018), pp.77\u201398","DOI":"10.1007\/978-3-319-79063-3_4"},{"key":"218_CR32","doi-asserted-by":"publisher","unstructured":"M. Chen, T. Chou, Classic McEliece on the ARM Cortex-M4. IACR Trans. Cryptographic Hardw. Embed. Syst. 2021(3), 125\u2013148 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i3.125-148","DOI":"10.46586\/tches.v2021.i3.125-148"},{"key":"218_CR33","doi-asserted-by":"publisher","unstructured":"P.\u00a0Chen, T.\u00a0Chou, S.\u00a0Deshpande, N.\u00a0Lahr, R.\u00a0Niederhagen, J.\u00a0Szefer, W.\u00a0Wang, Complete improved FPGA implementation of classic McEliece. IACR Trans. Cryptographic Hardw. Embed. Syst. 2022(3), 71\u2013113 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i3.71-113","DOI":"10.46586\/tches.v2022.i3.71-113"},{"key":"218_CR34","unstructured":"Classic McEliece vs NTS-KEM Classic McEliece Comparison Task Force. (2018). Preprint at https:\/\/classic.mceliece.org\/nist\/vsntskem-20180629.pdf"},{"issue":"12","key":"218_CR35","doi-asserted-by":"publisher","first-page":"6265","DOI":"10.1109\/TIT.2010.2079016","volume":"56","author":"S Gao","year":"2010","unstructured":"S. Gao, M. Todd, Complete improved fpga implementation of classic mceliece. Addit. Fast Fourier Transforms Over Finite Fields 56(12), 6265\u20136272 (2010). https:\/\/doi.org\/10.1109\/TIT.2010.2079016","journal-title":"Addit. Fast Fourier Transforms Over Finite Fields"},{"key":"218_CR36","doi-asserted-by":"crossref","unstructured":"D. Bernstein, T. Chou, P. schwabe, in Cryptographic Hardware and Embedded Systems - CHES 2013, ed. by G. Bertoni, J.S. Coron. McBits: fast constant-time code-based sryptography, (Springer, Berlin Heidelberg, Berlin, Heidelberg, 2013), pp.250\u2013272","DOI":"10.1007\/978-3-642-40349-1_15"},{"key":"218_CR37","unstructured":"G.\u00a0Seroussi, Table of low-weight binary irreducible polynomials. (1998). Preprint at https:\/\/api.semanticscholar.org\/CorpusID:18027797"},{"key":"218_CR38","volume-title":"Untersuchungen \u00fcber h\u00f6here Arithmetik","author":"C Gauss","year":"1981","unstructured":"C. Gauss, Untersuchungen \u00fcber h\u00f6here Arithmetik (Chelsea Publishing Company, New York, 1981)"},{"issue":"6","key":"218_CR39","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1109\/TCSI.2024.3384414","volume":"71","author":"D Owens","year":"2024","unstructured":"D. Owens, R. Khatib, M. Bisheh-Niasar, R. Azarderakhsh, M.M. Kermani, Efficient and side-channel resistant ed25519 on arm cortex-m4. IEEE Trans. Circuits Syst. I Regul. Pap. 71(6), 2674\u20132686 (2024). https:\/\/doi.org\/10.1109\/TCSI.2024.3384414","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"2","key":"218_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3584919","volume":"23","author":"R Elkhatib","year":"2024","unstructured":"R. Elkhatib, B. Koziel, R. Azarderakhsh, M.M. Kermani, Cryptographic engineering a fast and efficient SIKE in FPGA. ACM Trans. Embed. Comput. Syst. 23(2), 1\u201325 (2024). https:\/\/doi.org\/10.1145\/3584919","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"218_CR41","unstructured":"P.\u00a0S., J.\u00a0Geier, J.\u00a0Danner, D.\u00a0Mueller-Gritschneder, A.\u00a0Wachter-Zeh, Key-recovery fault injection attack on the classic McEliece KEM. (2022). Preprint at https:\/\/eprint.iacr.org\/2022\/1529"},{"key":"218_CR42","unstructured":"S.\u00a0Bitzer, J.\u00a0Delvaux, E.\u00a0Kirshanova, A.\u00a0Maa\u00dfen, S.\u00a0May, A.\u00a0Wachter-Zeh, How to lose some weight - a practical template syndrome decoding attack. (2024). Preprint at https:\/\/eprint.iacr.org\/2024\/621"},{"key":"218_CR43","unstructured":"M.\u00a0Brinkmann, C.\u00a0Chuengsatiansup, A.\u00a0May, J.\u00a0Nowakowski, J.\u00a0Yarom, Leaky McEliece: secret key recovery from highly erroneous side-channel information. (2023). Preprint at https:\/\/eprint.iacr.org\/2023\/1536"},{"key":"218_CR44","doi-asserted-by":"crossref","unstructured":"P.\u00a0Cayrel, B.\u00a0Colombier, V.\u00a0Dragoi, A.\u00a0Menu, L.\u00a0Bossuet, Message-recovery laser fault injection attack on the classic McEliece cryptosystem. (2020). Preprint at https:\/\/eprint.iacr.org\/2020\/900","DOI":"10.1007\/978-3-030-77886-6_15"},{"key":"218_CR45","doi-asserted-by":"publisher","first-page":"3407","DOI":"10.1109\/TIFS.2022.3198277","volume":"17","author":"B Colombier","year":"2022","unstructured":"B. Colombier, V. Dragoi, P. Cayrel, V. Grosso, Profiled side-channel attack on cryptosystems based on the binary syndrome decoding problem. IEEE Trans. Inf. Forensics Secur. 17, 3407\u20133420 (2022). https:\/\/doi.org\/10.1109\/TIFS.2022.3198277","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"218_CR46","unstructured":"N.\u00a0Lahr, R.\u00a0Niederhagen, R.\u00a0Petri, S.\u00a0Samardjiska, Side channel information set decoding using iterative chunking. (2019). Preprint at https:\/\/eprint.iacr.org\/2019\/1459"},{"key":"218_CR47","doi-asserted-by":"publisher","unstructured":"Q.\u00a0Guo, A.\u00a0Johansson, T.\u00a0Johansson, A key-recovery side-channel attack on classic McEliece implementations. IACR Trans. Cryptographic Hardw. Embed. Syst. 2022(4), 800\u2013\u2013827 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i4.800-827","DOI":"10.46586\/tches.v2022.i4.800-827"},{"key":"218_CR48","doi-asserted-by":"crossref","unstructured":"P.\u00a0Gan, P.\u00a0Ravi, K.\u00a0Raj, A.\u00a0Baksi, A.\u00a0Chattopadhyay, Classic McEliece hardware implementation with enhanced side-channel and fault resistance. (2024). Preprint at https:\/\/eprint.iacr.org\/2024\/1828","DOI":"10.36227\/techrxiv.171925242.26878384\/v1"},{"key":"218_CR49","doi-asserted-by":"crossref","unstructured":"A.\u00a0Juels, A.\u00a0Wattenberg, in Proceedings of the 6th ACM Conference on Computer and Communications Security, A fuzzy commitment scheme (Association for Computing Machinery, New York, 1999), pp. 28\u201336","DOI":"10.1145\/319709.319714"},{"issue":"9","key":"218_CR50","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1109\/TC.2006.138","volume":"55","author":"F Hao","year":"2006","unstructured":"F. Hao, R. Anderson, J. Daugman, Combining crypto with biometrics effectively. IEEE Trans. Comput. 55(9), 1081\u20131088 (2006). https:\/\/doi.org\/10.1109\/TC.2006.138","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"218_CR51","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1109\/34.244676","volume":"15","author":"J Daugman","year":"1993","unstructured":"J. Daugman, High confidence visual recognition of persons by a test of statistical independence. IEEE Trans. Pattern Anal. Mach. Intell. 15(11), 1148\u20131161 (1993). https:\/\/doi.org\/10.1109\/34.244676","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"218_CR52","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0031-3203(02)00030-4","volume":"36","author":"J Daugman","year":"2003","unstructured":"J. Daugman, The importance of being random: statistical principles of iris recognition. Pattern Recogn. 36(2), 279\u2013291 (2003). https:\/\/doi.org\/10.1016\/S0031-3203(02)00030-4","journal-title":"Pattern Recogn."},{"issue":"5","key":"218_CR53","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TSMCB.2007.903540","volume":"37","author":"J Daugman","year":"2007","unstructured":"J. Daugman, New methods in iris recognition. IEEE Trans. Syst. Man Cybern. B. 37(5), 1167\u20131175 (2007). https:\/\/doi.org\/10.1109\/TSMCB.2007.903540","journal-title":"IEEE Trans. Syst. Man Cybern. B."},{"issue":"1","key":"218_CR54","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1049\/iet-ifs.2009.0267","volume":"5","author":"M L\u00f3pez-Garc\u00eda","year":"2011","unstructured":"M. L\u00f3pez-Garc\u00eda, J. Daugman, E. Cant\u00f3-Navarro, Hardware\u2013software co-design of an iris recognition algorithm. IET Inf. Secur. 5(1), 60\u201368 (2011). https:\/\/doi.org\/10.1049\/iet-ifs.2009.0267","journal-title":"IET Inf. Secur."},{"issue":"2","key":"218_CR55","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/TIFS.2015.2500196","volume":"11","author":"J Daugman","year":"2016","unstructured":"J. Daugman, Information theory and the iriscode. IEEE Trans. Inf. Forensics Secur. 11(2), 400\u2013409 (2016). https:\/\/doi.org\/10.1109\/TIFS.2015.2500196","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"container-title":["EURASIP Journal on Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-025-00218-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13635-025-00218-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-025-00218-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T21:02:28Z","timestamp":1761339748000},"score":1,"resource":{"primary":{"URL":"https:\/\/jis-eurasipjournals.springeropen.com\/articles\/10.1186\/s13635-025-00218-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,24]]},"references-count":55,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["218"],"URL":"https:\/\/doi.org\/10.1186\/s13635-025-00218-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-6511517\/v1","asserted-by":"object"}]},"ISSN":["2510-523X"],"issn-type":[{"value":"2510-523X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,24]]},"assertion":[{"value":"23 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2025","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 that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"30"}}