{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:54Z","timestamp":1774449114445,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T00:00:00Z","timestamp":1774396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T00:00:00Z","timestamp":1774396800000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-026-08428-2","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T13:11:59Z","timestamp":1774444319000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FPGA-based true random number generation and its application"],"prefix":"10.1007","volume":"82","author":[{"given":"Aditi","family":"Roy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Kokila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Shameedha","family":"Begum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Ramasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,25]]},"reference":[{"key":"8428_CR1","unstructured":"Juniper (2022) Industrial IOT Connections to reach 37 billion globally by 2025. https:\/\/insidehpc.com\/2020\/11\/juniper-research-industrial-iot-connections-to-reach-37b-by-2025\/. Accessed 23 April 2024"},{"key":"8428_CR2","doi-asserted-by":"crossref","unstructured":"Aman MN, Chua KC, Sikdar B (2017) A light-weight mutual authentication protocol for IoT systems. In: GLOBECOM 2017-2017 IEEE Global Communications Conference. IEEE, pp 1\u20136","DOI":"10.1109\/GLOCOM.2017.8253991"},{"key":"8428_CR3","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair U, S\u00f6lter J (2014) Puf modeling attacks: an introduction and overview. In: 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, pp 1\u20136","DOI":"10.7873\/DATE.2014.361"},{"key":"8428_CR4","doi-asserted-by":"crossref","unstructured":"Rupani A, Whig P, Sujediya G, Vyas P (2017) A robust technique for image processing based on interfacing of raspberry-pi and fpga using IoT. In: 2017 International Conference on Computer, Communications and Electronics (Comptelix). IEEE, pp 350\u2013353","DOI":"10.1109\/COMPTELIX.2017.8003992"},{"key":"8428_CR5","doi-asserted-by":"crossref","unstructured":"Alkatheiri MS, Zhuang Y (2017) Towards fast and accurate machine learning attacks of feed-forward arbiter pufs. In: 2017 IEEE Conference on Dependable and Secure Computing. IEEE, pp 181\u2013187","DOI":"10.1109\/DESEC.2017.8073845"},{"key":"8428_CR6","doi-asserted-by":"crossref","unstructured":"Khalafalla M, Gebotys C (2019) Pufs deep attacks: Enhanced modeling attacks using deep learning techniques to break the security of double arbiter pufs. In: 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, pp 204\u2013209","DOI":"10.23919\/DATE.2019.8714862"},{"issue":"10","key":"8428_CR7","doi-asserted-by":"publisher","first-page":"2284","DOI":"10.1109\/TVLSI.2019.2926788","volume":"27","author":"J Kokila","year":"2019","unstructured":"Kokila J, Ramasubramanian N, Naganathan N (2019) Resource efficient metering scheme for protecting soc fpga device and ips in iot applications. IEEE Trans Very Large Scale Integr VLSI Syst 27(10):2284\u20132295","journal-title":"IEEE Trans Very Large Scale Integr VLSI Syst"},{"issue":"1","key":"8428_CR8","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TCSI.2020.3028508","volume":"68","author":"J Zhang","year":"2020","unstructured":"Zhang J, Shen C (2020) Set-based obfuscation for strong pufs against machine learning attacks. IEEE Trans Circuits Syst I Regul Pap 68(1):288\u2013300","journal-title":"IEEE Trans Circuits Syst I Regul Pap"},{"issue":"3","key":"8428_CR9","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.14419\/ijet.v7i3.16586","volume":"7","author":"R Gupta","year":"2018","unstructured":"Gupta R, Pandey A, Baghel R (2018) Efficient design of chaos based 4 bit true random number generator on fpga. Int J Eng Technol 7(3):1783\u20131785","journal-title":"Int J Eng Technol"},{"key":"8428_CR10","doi-asserted-by":"crossref","unstructured":"Roy A, Kokila J, Ramasubramanian N, Begum SB (2022) Random number generation for pki using controlled anderson puf. In: 2022 IEEE International Conference on Public Key Infrastructure and Its Applications (PKIA). IEEE, pp 1\u20136","DOI":"10.1109\/PKIA56009.2022.9952259"},{"key":"8428_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.micpro.2018.02.001","volume":"59","author":"S Chen","year":"2018","unstructured":"Chen S, Li B, Zhou C (2018) Fpga implementation of sram pufs based cryptographically secure pseudo-random number generator. Microprocess Microsyst 59:57\u201368","journal-title":"Microprocess Microsyst"},{"issue":"8","key":"8428_CR12","doi-asserted-by":"publisher","first-page":"3330","DOI":"10.3390\/app11083330","volume":"11","author":"P Nannipieri","year":"2021","unstructured":"Nannipieri P, Di Matteo S, Baldanzi L, Crocetti L, Belli J, Fanucci L, Saponara S (2021) True random number generator based on fibonacci-galois ring oscillators for fpga. Appl Sci 11(8):3330","journal-title":"Appl Sci"},{"key":"8428_CR13","doi-asserted-by":"crossref","unstructured":"Meka PS, Sivaraman R, Rengarajan A, Rajagopalan S (2020) Metastability influenced puf for cryptographic key generation: a fpga approach. In: 2020 International Conference on Computer Communication and Informatics (ICCCI). IEEE, pp 1\u20136","DOI":"10.1109\/ICCCI48352.2020.9104146"},{"key":"8428_CR14","doi-asserted-by":"crossref","unstructured":"Maiti A, Nagesh R, Reddy A, Schaumont P (2009) Physical unclonable function and true random number generator: a compact and scalable implementation. In: Proceedings of the 19th ACM Great Lakes Symposium on VLSI, pp 425\u2013428","DOI":"10.1145\/1531542.1531639"},{"key":"8428_CR15","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10470-019-01474-2","volume":"102","author":"T Kaya","year":"2020","unstructured":"Kaya T (2020) A true random number generator based on a chua and ro-puf: design, implementation and statistical analysis. Analog Integr Circuits Sig Process 102:415\u2013426","journal-title":"Analog Integr Circuits Sig Process"},{"issue":"1\u20133","key":"8428_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cnsns.2015.03.003","volume":"27","author":"E Tlelo-Cuautle","year":"2015","unstructured":"Tlelo-Cuautle E, Rangel-Magdaleno J, Pano-Azucena AD, Obeso-Rodelo P, Nu\u00f1ez-Perez JC (2015) Fpga realization of multi-scroll chaotic oscillators. Commun Nonlinear Sci Numer Simul 27(1\u20133):66\u201380","journal-title":"Commun Nonlinear Sci Numer Simul"},{"issue":"7","key":"8428_CR17","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1109\/TVLSI.2020.2979269","volume":"28","author":"S Kalanadhabhatta","year":"2020","unstructured":"Kalanadhabhatta S, Kumar D, Anumandla KK, Reddy SA, Acharyya A (2020) Puf-based secure chaotic random number generator design methodology. IEEE Trans Very Large Scale Integr VLSI Syst 28(7):1740\u20131744","journal-title":"IEEE Trans Very Large Scale Integr VLSI Syst"},{"issue":"1","key":"8428_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1109\/TIM.2018.2877859","volume":"68","author":"M Garcia-Bosque","year":"2018","unstructured":"Garcia-Bosque M, P\u00e9rez-Resa A, S\u00e1nchez-Azqueta C, Aldea C, Celma S (2018) Chaos-based bitwise dynamical pseudorandom number generator on fpga. IEEE Trans Instrum Meas 68(1):291\u2013293","journal-title":"IEEE Trans Instrum Meas"},{"issue":"2","key":"8428_CR19","first-page":"121","volume":"48","author":"SA Tuncer","year":"2018","unstructured":"Tuncer SA (2018) Real-time random number generation with ro-based double puf. Informacije MIDEM 48(2):121\u2013128","journal-title":"Informacije MIDEM"},{"issue":"6","key":"8428_CR20","first-page":"608","volume":"63","author":"D Liu","year":"2016","unstructured":"Liu D, Liu Z, Li L, Zou X (2016) A low-cost low-power ring oscillator-based truly random number generator for encryption on smart cards. IEEE Trans Circuits Syst II Express Briefs 63(6):608\u2013612","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"key":"8428_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.micpro.2017.06.021","volume":"53","author":"S Buchoveck\u00e1","year":"2017","unstructured":"Buchoveck\u00e1 S, L\u00f3rencz R, Kod\u1ef3tek F, Bu\u010dek J (2017) True random number generator based on ring oscillator puf circuit. Microprocess Microsyst 53:33\u201341","journal-title":"Microprocess Microsyst"},{"key":"8428_CR22","doi-asserted-by":"crossref","unstructured":"Anderson JH (2010) A puf design for secure fpga-based embedded systems. In: 2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC). IEEE, pp 1\u20136","DOI":"10.1109\/ASPDAC.2010.5419927"},{"key":"8428_CR23","doi-asserted-by":"crossref","unstructured":"Zhang J, Wu Q, Lyu Y, Zhou Q, Cai Y, Lin Y, Qu G (2013) Design and implementation of a delay-based puf for fpga ip protection. In: 2013 International Conference on Computer-Aided Design and Computer Graphics. IEEE, pp 107\u2013114","DOI":"10.1109\/CADGraphics.2013.22"},{"key":"8428_CR24","doi-asserted-by":"crossref","unstructured":"Barbareschi M (2017) Notions on silicon physically unclonable functions. In: Hardware Security and Trust: Design and Deployment of Integrated Circuits in a Threatened Environment, pp 189\u2013209","DOI":"10.1007\/978-3-319-44318-8_10"},{"key":"8428_CR25","doi-asserted-by":"crossref","unstructured":"Huang M, Li S (2013) A delay-based puf design using multiplexer chains. In: 2013 International Conference on Reconfigurable Computing and FPGAs (ReConFig). IEEE, pp 1\u20136","DOI":"10.1109\/ReConFig.2013.6732258"},{"key":"8428_CR26","doi-asserted-by":"crossref","unstructured":"Zhou Z, Li G, Wang P, Ye M (2021) Matrix encryption based anti-machine learning attack algorithm for strong puf. In: 2021 IEEE 14th International Conference on ASIC (ASICON). IEEE, pp 1\u20134","DOI":"10.1109\/ASICON52560.2021.9620491"},{"key":"8428_CR27","doi-asserted-by":"crossref","unstructured":"Gu C, Murphy J, O\u2019Neill M (2014) A unique and robust single slice fpga identification generator. In: 2014 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, pp 1223\u20131226","DOI":"10.1109\/ISCAS.2014.6865362"},{"key":"8428_CR28","doi-asserted-by":"crossref","unstructured":"Aravindan M et al (2022) Practical challenges in simulating strong pufs. In: 2022 IEEE IAS Global Conference on Emerging Technologies (GlobConET). IEEE, pp 471\u2013476","DOI":"10.1109\/GlobConET53749.2022.9872369"},{"key":"8428_CR29","unstructured":"xilinx 7 series FPGA Configurable Logic Block. https:\/\/fpga.eetrend.com\/files-eetrend-xilinx\/download\/201408\/7595-13762-ug4747seriesclb.pdf. Accessed 23 April 2024"},{"key":"8428_CR30","doi-asserted-by":"crossref","unstructured":"Rukhin A, Soto J, Nechvatal J, Smid M, Barker E (2001) A statistical test suite for random and pseudorandom number generators for cryptographic applications. Technical report, Booz-allen and hamilton inc mclean va","DOI":"10.6028\/NIST.SP.800-22"},{"key":"8428_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102514","volume":"127","author":"F Zerrouki","year":"2022","unstructured":"Zerrouki F, Ouchani S, Bouarfa H (2022) A survey on silicon pufs. J Syst Architect 127:102514","journal-title":"J Syst Architect"},{"key":"8428_CR32","doi-asserted-by":"crossref","unstructured":"Abadi M (2016) Tensorflow: learning functions at scale. In: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, p 1","DOI":"10.1145\/2951913.2976746"},{"key":"8428_CR33","doi-asserted-by":"crossref","unstructured":"Riedmiller M, Braun H (1993) A direct adaptive method for faster backpropagation learning: The rprop algorithm. In: IEEE International Conference on Neural Networks. IEEE, pp 586\u2013591","DOI":"10.1109\/ICNN.1993.298623"},{"key":"8428_CR34","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair U, Sehnke F, S\u00f6lter J, Dror G, Devadas S, Schmidhuber J (2010) Modeling attacks on physical unclonable functions. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp 237\u2013249","DOI":"10.1145\/1866307.1866335"},{"key":"8428_CR35","doi-asserted-by":"crossref","unstructured":"Vijayakumar A, Patil VC, Prado CB, Kundu S (2016) Machine learning resistant strong puf: Possible or a pipe dream? In: 2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST). IEEE, pp 19\u201324","DOI":"10.1109\/HST.2016.7495550"},{"key":"8428_CR36","doi-asserted-by":"publisher","first-page":"2719","DOI":"10.1109\/TIFS.2022.3189533","volume":"17","author":"N Wisiol","year":"2022","unstructured":"Wisiol N, Thapaliya B, Mursi KT, Seifert J-P, Zhuang Y (2022) Neural network modeling attacks on arbiter-puf-based designs. IEEE Trans Inf Forensics Secur 17:2719\u20132731","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"8428_CR37","unstructured":"Santikellur P, Bhattacharyay A, Chakraborty RS (2019) Deep learning based model building attacks on arbiter puf compositions. Cryptology ePrint Archive"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08428-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08428-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08428-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T13:12:15Z","timestamp":1774444335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08428-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,25]]},"references-count":37,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["8428"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08428-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,25]]},"assertion":[{"value":"23 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2026","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 whose names are listed certify that they have no affiliations with or involvement in any organization or entity with any financial interest (such as honoraria; educational grants; participation in speakers\u2019 bureaus; membership, employment, consultancies, stock ownership, or other equity interest; and expert testimony or patent-licensing arrangements), or non-financial interest (such as personal or professional relationships, affiliations, knowledge or beliefs) in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"293"}}