{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T14:18:58Z","timestamp":1676038738428},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,1,8]],"date-time":"2008-01-08T00:00:00Z","timestamp":1199750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10623-007-9164-4","type":"journal-article","created":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T18:19:06Z","timestamp":1199729946000},"page":"353-363","source":"Crossref","is-referenced-by-count":7,"title":["Cryptographic properties of nonlinear pseudorandom number generators"],"prefix":"10.1007","volume":"46","author":[{"given":"Nicholas","family":"Kolokotronis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,8]]},"reference":[{"key":"9164_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02113290","volume":"55","author":"V.S. Anashin","year":"1994","unstructured":"Anashin V.S. (1994) Uniformly distributed sequences of p-adic integers Math. Notes 55, 109\u2013133","journal-title":"Math. Notes"},{"key":"9164_CR2","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1007\/BF02355442","volume":"89","author":"V.S. Anashin","year":"1998","unstructured":"Anashin V.S. (1998) Uniformly distributed sequences in computer algebra, or how to construct program generators of random numbers. J. Math. Sci. 89, 1355\u20131390","journal-title":"J. Math. Sci."},{"key":"9164_CR3","first-page":"527","volume":"12","author":"V.S. Anashin","year":"2002","unstructured":"Anashin V.S. (2002) Uniformly distributed sequences of p-adic integers, II. Discrete Math. Appl. 12, 527\u2013590","journal-title":"Discrete Math. Appl."},{"key":"9164_CR4","unstructured":"Anashin V.S.: Pseudorandom number generation by p-adic ergodic transformations. arXiv: Cryptography & Security (2004). http:\/\/arxiv.org\/abs\/cs\/0401030 ."},{"key":"9164_CR5","unstructured":"Anashin V.S.: Pseudorandom number generation by p-adic ergodic transformations: an addendum. arXiv: Cryptography & Security (2004). http:\/\/arxiv.org\/abs\/cs\/0402060 ."},{"key":"9164_CR6","unstructured":"Anashin V.S.: Non-Archimedean analysis, T-functions, and cryptography. arXiv: Cryptography & Security (2006). http:\/\/arxiv.org\/abs\/cs\/0612038 ."},{"key":"9164_CR7","unstructured":"Anashin V.S.: Wreath products in stream cipher design. arXiv: Cryptography & Security (2006). http:\/\/arxiv.org\/abs\/cs\/0602012 ."},{"key":"9164_CR8","doi-asserted-by":"crossref","unstructured":"Daum M.: Narrow t-functions. In: Gilbert H., Handschuh H. (eds.), Proceedings of Fast Software Encryption 2005. Lecture Notes in Computer Science, vol. 3557, pp. 50\u201367. Springer-Verlag, Berlin (2005).","DOI":"10.1007\/11502760_4"},{"key":"9164_CR9","unstructured":"desJardins D.L., Zieve M.E.: On the structure of polynomial mappings modulo an odd prime power. arXiv: Number Theory (2001). http:\/\/arxiv.org\/abs\/math\/0103046 ."},{"key":"9164_CR10","doi-asserted-by":"crossref","unstructured":"Hong J., Lee D.H., Yeom Y., Han D.: A new class of single cycle t-functions. In: Gilbert H., Handschuh H. (eds.), Proceedings of Fast Software Encryption 2005. Lecture Notes in Computer Science, vol. 3557, pp.68\u201382. Springer-Verlag, Berlin (2005).","DOI":"10.1007\/11502760_5"},{"key":"9164_CR11","unstructured":"Hong J., Lee D.H., Yeom Y., Han D., Chee S.: T-function based stream cipher TSC-3. eSTREAM, ECRYPT Stream Cipher Project, Report 2005\/031 (2005). http:\/\/www.ecrypt.eu.org\/strea ."},{"key":"9164_CR12","unstructured":"Klimov A.: Applications of t-functions in cryptography. Ph.D. Thesis, Department of Applied Mathematics and Computer Science, Weizmann Institute of Science (2005)."},{"key":"9164_CR13","doi-asserted-by":"crossref","unstructured":"Klimov A., Shamir A.: A new class of invertible mappings. In: Kaliski Jr. B.S., et. al. (eds.), Proceedings of Workshop on Cryptographic Hardware and Embedded Systems 2002. Lecture Notes in Computer Science, vol. 2523, pp. 470\u2013483. Springer-Verlag, Berlin (2003).","DOI":"10.1007\/3-540-36400-5_34"},{"key":"9164_CR14","doi-asserted-by":"crossref","unstructured":"Klimov A., Shamir A.: Cryptographic applications of t-functions. In: Matsui M., Zuccherato R. (eds.), Proceedings of Workshop on Selected Areas in Cryptography 2003. Lecture Notes in Computer Science, vol. 3006, pp. 248\u2013261. Springer-Verlag, Berlin (2004).","DOI":"10.1007\/978-3-540-24654-1_18"},{"key":"9164_CR15","doi-asserted-by":"crossref","unstructured":"Klimov A., Shamir A.: New cryptographic primitives based on multiword t-functions. In: Roy B., Meier W. (eds.), Proceedings of Fast Software Encryption 2004. Lecture Notes in Computer Science, vol. 3017, pp. 1\u201315. Springer-Verlag, Berlin (2004).","DOI":"10.1007\/978-3-540-25937-4_1"},{"key":"9164_CR16","doi-asserted-by":"crossref","unstructured":"Klimov A., Shamir A.: New applications of t-functions in block ciphers and hash functions. In: Gilbert H., Handschuh H. (eds.), Proceedings of Fast Software Encryption 2005. Lecture Notes in Computer Science, vol. 3557, pp. 18\u201331. Springer-Verlag, Berlin (2005).","DOI":"10.1007\/11502760_2"},{"key":"9164_CR17","unstructured":"Knuth D.E.: The Art of Computer Programming. Series in Computer Science and Information Processing, vol. 2, 3rd edn. Addison\u2013Wesley, Reading, MA (1998)."},{"key":"9164_CR18","doi-asserted-by":"crossref","unstructured":"Kolokotronis N.: Cryptographic properties of stream ciphers based on t-functions. Proceedings of 2006 IEEE International Symposium on Information Theory, pp. 1604\u20131608. IEEE Press (2006).","DOI":"10.1109\/ISIT.2006.261547"},{"key":"9164_CR19","doi-asserted-by":"crossref","first-page":"3047","DOI":"10.1109\/TIT.2003.818400","volume":"49","author":"N. Kolokotronis","year":"2003","unstructured":"Kolokotronis N., Kalouptsidis N. (2003). On the linear complexity of nonlinearly filtered PN-sequences. IEEE Trans. Infor. Theory 49, 3047\u20133059","journal-title":"IEEE Trans. Infor. Theory"},{"key":"9164_CR20","unstructured":"Kotomina L.: Fast nonlinear congruential generators. M.Sc. Thesis, Russian State University for the Humanities, Moscow (1999)."},{"key":"9164_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1515\/dma-2002-0204","volume":"12","author":"M.V. Larin","year":"2002","unstructured":"Larin M.V. (2002). Transitive polynomial transformations of residue class rings. Discrete Math. Appl. 12, 127\u2013140","journal-title":"Discrete Math. Appl."},{"key":"9164_CR22","doi-asserted-by":"crossref","unstructured":"Mayhew G.L.: Auto-correlation properties of modified de Bruijn sequences. Proceedings of 2000 IEEE Position Location and Navigation Symposium, pp. 349\u2013354. IEEE Press (2000).","DOI":"10.1109\/PLANS.2000.838324"},{"key":"9164_CR23","doi-asserted-by":"crossref","unstructured":"Mitra J., Sarkar P.: Time-memory trade-off attacks on multiplications and t-functions. In: Lee P.J. (ed.), Proceedings of Advances in Cryptology \u2013 Asiacrypt 2004. Lecture Notes in Computer Science, vol. 3329, pp. 468\u2013482. Springer-Verlag, Berlin (2004).","DOI":"10.1007\/978-3-540-30539-2_33"},{"key":"9164_CR24","doi-asserted-by":"crossref","unstructured":"Molland H., Helleseth T.: A linear weakness in the Klimov-Shamir t-function. Proceedings of 2005 IEEE International Symposium on Information Theory, pp. 1106\u20131110 (2005).","DOI":"10.1109\/ISIT.2005.1523511"},{"key":"9164_CR25","unstructured":"Moon D., Kwon D., Han D., Lee J., Ryu G.H., Lee D.W., Yeom Y., Chee S.: T-function based stream cipher TSC-4. eSTREAM, ECRYPT Stream Cipher Project, Report 2006\/024 (2006) http:\/\/www.ecrypt.eu.org\/strea ."},{"key":"9164_CR26","doi-asserted-by":"crossref","unstructured":"Muller F., Peyrin T.: Linear cryptanalysis of the TSC family of stream ciphers. In: Roy B. (ed.), Proceedings of Advances in Cryptology \u2013 Asiacrypt 2005. Lecture Notes in Computer Science, vol. 3788, pp. 373\u2013394. Springer-Verlag, Berlin (2005).","DOI":"10.1007\/11593447_20"},{"key":"9164_CR27","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/ffta.2000.0282","volume":"7","author":"R.L. Rivest","year":"2001","unstructured":"Rivest R.L. (2001). Permutation polynomials modulo 2 w . Finite Fields Appl. 7, 287\u2013292","journal-title":"Finite Fields Appl."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9164-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9164-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:09Z","timestamp":1559245809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9164-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,8]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9164"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9164-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,8]]}}}