{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:06:56Z","timestamp":1730214416919,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/dessert50317.2020.9125045","type":"proceedings-article","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T16:46:07Z","timestamp":1593103567000},"page":"172-177","source":"Crossref","is-referenced-by-count":3,"title":["Testing of Code-Based Pseudorandom Number Generators for Post-Quantum Application"],"prefix":"10.1109","author":[{"given":"Alexandr","family":"Kuznetsov","sequence":"first","affiliation":[]},{"given":"Anastasiia","family":"Kiian","sequence":"additional","affiliation":[]},{"given":"Oleksii","family":"Smirnov","sequence":"additional","affiliation":[]},{"given":"Alla","family":"Cherep","sequence":"additional","affiliation":[]},{"given":"Meruert","family":"Kanabekova","sequence":"additional","affiliation":[]},{"given":"Iryna","family":"Chepurko","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"878","author":"dubrova","year":"2009","journal-title":"How to speed-up your NLFSR-based stream cipher"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ATIT49449.2019.9030493"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref13","first-page":"275","article-title":"True random number generators","author":"stipcevic","year":"2014","journal-title":"International Journal of Open Problems in Computer Science and Mathematics"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"journal-title":"S P W Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","year":"1997","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-22"},{"journal-title":"Benchmarking the quantum cryptanalysis of symmetric public-key and hash-based cryptographic schemes","year":"0","author":"gheorghiu","key":"ref17"},{"key":"ref18","first-page":"850","article-title":"How to generate cryptographycally strong sequences of pseudorandom bits","volume":"1","author":"blum","year":"1986","journal-title":"SIAM Journal on Computing"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DSC.2017.22"},{"key":"ref4","first-page":"10","article-title":"NISTIR 8105. Report on Post-Quantum Cryptography","author":"chen","year":"2016","journal-title":"National Institute of Standards and Technology Internal Report 8105"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1527017.1527028"},{"key":"ref6","first-page":"245","article-title":"An efficient PseudoRandom Generator Provably as Secure as Syndrome Decoding","author":"fisher","year":"0","journal-title":"Proceeding of EUROCRYPT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-90a"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"ref7","article-title":"Pseudorandom Number Generators for Cryptographic Applications","author":"rock","year":"2005","journal-title":"Diplomarbeit zur Erlangung des Magistergrades an der Naturwissenschaftlichen Fakultat der Paris-Lodron-Universitat Salzburg"},{"key":"ref2","first-page":"816","author":"menezes","year":"1996","journal-title":"Handbook of Applied Cryptography"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMMST.2018.8632021"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1515\/9781501506062"},{"key":"ref20","first-page":"1561","article-title":"Modelling instruments in risk management","volume":"10","author":"bondarenko","year":"2019","journal-title":"International Journal of Civil Engineering and Technology"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2907079"},{"key":"ref21","first-page":"1","article-title":"Generic Pseudorandom Sequence Generator Based on Permutations","author":"unka\u0161evi?","year":"2019","journal-title":"2019 27th Telecommunications Forum (TELFOR)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11072-009-0064-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/PICST47496.2019.9061530"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/15326340500294520"},{"key":"ref25","first-page":"211","article-title":"On the convergence of fourier means and interpolation means","volume":"6","author":"runovski","year":"2004","journal-title":"Journal of Computational Analysis and Applications"}],"event":{"name":"2020 IEEE 11th International Conference on Dependable Systems, Services and Technologies (DESSERT)","start":{"date-parts":[[2020,5,14]]},"location":"Kyiv, Ukraine","end":{"date-parts":[[2020,5,18]]}},"container-title":["2020 IEEE 11th International Conference on Dependable Systems, Services and Technologies (DESSERT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9122248\/9124995\/09125045.pdf?arnumber=9125045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T12:10:50Z","timestamp":1656331850000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9125045\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/dessert50317.2020.9125045","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}