{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T15:30:38Z","timestamp":1687879838119},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,4]],"date-time":"2020-07-04T00:00:00Z","timestamp":1593820800000},"content-version":"vor","delay-in-days":3,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s42979-020-00221-z","type":"journal-article","created":{"date-parts":[[2020,7,4]],"date-time":"2020-07-04T04:41:37Z","timestamp":1593837697000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["PudgyTurtle: Using Keystream to Encode and Encrypt"],"prefix":"10.1007","volume":"1","author":[{"given":"David A.","family":"August","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne C.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,4]]},"reference":[{"issue":"1","key":"221_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1504\/IJWMC.2011.044106","volume":"5","author":"M Agren","year":"2011","unstructured":"Agren M, Hell M, Johansson T, Meier W. Grain-128a: a new version of Grain-128 with optional authentication. Int J Wire Mob Comput. 2011;5(1):48\u201359.","journal-title":"Int J Wire Mob Comput"},{"issue":"3","key":"221_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.3390\/e20030180","volume":"20","author":"V Amin Ghafari","year":"2018","unstructured":"Amin Ghafari V, Hu H. Fruit-80: a secure ultra-lightweight stream cipher for constrained environments. Entropy. 2018;20(3):180.","journal-title":"Entropy"},{"key":"221_CR3","doi-asserted-by":"crossref","unstructured":"Armknecht F, Mikhalev V. On lightweight stream ciphers with shorter internal states. In: Fast software encryption\u201422nd international workshop, FSE 2015, Istanbul, Turkey, March 8\u201311, 2015, Revised selected papers; 2015. pp. 451\u2013470","DOI":"10.1007\/978-3-662-48116-5_22"},{"issue":"4","key":"221_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1380564.1380565","volume":"11","author":"G Avoine","year":"2008","unstructured":"Avoine G, Junod P, Oechslin P. Characterization and improvement of time-memory trade-off based on perfect tables. ACM Trans Inf Syst Secur. 2008;11(4):1\u201322.","journal-title":"ACM Trans Inf Syst Secur"},{"key":"221_CR5","doi-asserted-by":"crossref","unstructured":"Babbage S. Improved \u201cexhaustive search\u201d attacks on stream ciphers. In: European convention on security and detection, 1995, Institution of Engineering and Technology; 1995. p. 161\u2013166","DOI":"10.1049\/cp:19950490"},{"issue":"3","key":"221_CR6","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s00145-007-9001-y","volume":"21","author":"E Barkan","year":"2008","unstructured":"Barkan E, Biham E, Keller N. Instant ciphertext-only cryptanalysis of GSM encrypted communication. J Cryptol. 2008;21(3):392\u2013429.","journal-title":"J Cryptol"},{"key":"221_CR7","doi-asserted-by":"crossref","unstructured":"Bellare M, Rogaway P. Encode-then-encipher encryption: how to exploit nonces or redundancy in plaintexts for efficient cryptography. In: Okamoto T (ed) Advances in cryptology\u2014ASIACRYPT 2000. Lecture Notes in Computer Science, vol 1976, Springer, London, UK; 2000. p. 317\u201330","DOI":"10.1007\/3-540-44448-3_24"},{"key":"221_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-74619-5_17","volume-title":"Fast software encryption","author":"C Berbain","year":"2007","unstructured":"Berbain C, Gilbert H. On the security of IV dependent stream ciphers. In: Biryukov A, editor. Fast software encryption. Berlin: Springer; 2007. p. 254\u201373."},{"issue":"3","key":"221_CR9","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp E, McEliece R, Van Tilborg HC. On the inherent intractability of certain coding problems. IEEE Trans Inf Theory. 1978;24(3):384\u20136.","journal-title":"IEEE Trans Inf Theory"},{"key":"221_CR10","unstructured":"Bernstein DJ. Cycle counts for authenticated encryption. In: Workshop record of SASC 2007: the state of the art of stream ciphers; 2007. http:\/\/cr.yp.to\/papers.html#aescycles . Accessed 25 Apr 2020."},{"key":"221_CR11","unstructured":"Biham E, Dunkelman O. Differential cryptanalysis in stream ciphers. Cryptology ePrint Archive, Report 2007\/218, 2007. https:\/\/eprint.iacr.org\/2007\/218"},{"key":"221_CR12","first-page":"1","volume-title":"Advances in cryptology\u2014ASIACRYPT 2000","author":"A Biryukov","year":"2000","unstructured":"Biryukov A, Shamir A. Cryptanalytic time\/memory\/data tradeoffs for stream ciphers. In: Okamoto T, editor. Advances in cryptology\u2014ASIACRYPT 2000. Berlin: Springer; 2000. p. 1\u201313."},{"key":"221_CR13","first-page":"1","volume-title":"Fast software encryption","author":"A Biryukov","year":"2001","unstructured":"Biryukov A, Shamir A, Wagner D. Real time cryptanalysis of A5\/1 on a PC. In: Goos G, Hartmanis J, van Leeuwen J, Schneier B, editors. Fast software encryption. Berlin: Springer; 2001. p. 1\u201318."},{"key":"221_CR14","unstructured":"Canni\u00e8re CD, Preneel BT. In: Billet O, Robshaw M, editors. New stream cipher designs, vol. 4986. Lecture notes in computer science. Berlin: Springer; 2008. p. 244\u201366."},{"key":"221_CR15","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10623-018-0533-y","volume":"87","author":"S Dey","year":"2019","unstructured":"Dey S, Roy T, Sarkar S. Some results on fruit. Des Codes Cryptogr. 2019;87:349\u201364.","journal-title":"Des Codes Cryptogr"},{"issue":"8","key":"221_CR16","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1007\/s10623-018-00594-6","volume":"87","author":"I Dinur","year":"2019","unstructured":"Dinur I. An algorithmic framework for the generalized birthday problem. Des Codes Cryptogr. 2019;87(8):1897\u2013926.","journal-title":"Des Codes Cryptogr"},{"key":"221_CR17","unstructured":"Dubrova E. A list of maximum period NLFSRs. IACR cryptology ePrint archive. Report 2012\/166; 2012. https:\/\/eprint.iacr.org\/2012\/166 . Accessed 25 Apr 2020."},{"issue":"5","key":"221_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2008.01.011","volume":"107","author":"O Dunkelman","year":"2008","unstructured":"Dunkelman O, Keller N. Treatment of the initial value in time-memory-data tradeoff attacks on stream ciphers. Inf Process Lett. 2008;107(5):133\u20137.","journal-title":"Inf Process Lett"},{"key":"221_CR19","doi-asserted-by":"crossref","unstructured":"Esgin MF, Kara O. Practical cryptanalysis of full sprout with TMD tradeoff attacks. In: Dunkelman O, Keliher L (eds) Selected areas in cryptography\u2014SAC 2015\u201422nd international conference, Sackville, NB, Canada, August 12\u201314, 2015, Revised selected papers, Springer, Lecture notes in computer science, vol. 9566; 2015. p. 67\u201385","DOI":"10.1007\/978-3-319-31301-6_4"},{"key":"221_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11941378_5","volume-title":"Progress in cryptology\u2014INDOCRYPT 2006. Lecture notes in computer science","author":"M Fossorier","year":"2006","unstructured":"Fossorier M, Mihaljevi\u0107 M, Imai H, Cui Y, Matsuura K. An algorithm for solving the LPN problem and its application to security evaluation of the HB protocols for RFID authentication. In: Barua R, Lange T, editors. Progress in cryptology\u2014INDOCRYPT 2006. Lecture notes in computer science, vol. 4329. Berlin: Springer; 2006. p. 48\u201362."},{"key":"221_CR21","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-85053-3_17","volume-title":"Cryptographic hardware and embedded systems\u2014CHES 2008","author":"T Gendrullis","year":"2008","unstructured":"Gendrullis T, Novotn\u00fd M, Rupp A. A real-world attack breaking A5\/1 within hours. In: Oswald E, Rohatgi P, editors. Cryptographic hardware and embedded systems\u2014CHES 2008. Berlin: Springer; 2008. p. 266\u201382."},{"key":"221_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-69053-0_17","volume-title":"Advances in cryptology\u2014EUROCRYPT \u201997","author":"JD Goli\u0107","year":"1997","unstructured":"Goli\u0107 JD. Cryptanalysis of alleged A5 stream cipher. In: Fumy W, editor. Advances in cryptology\u2014EUROCRYPT \u201997. Berlin: Springer; 1997. p. 239\u201355."},{"issue":"5","key":"221_CR23","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s12095-018-0294-5","volume":"10","author":"M Hamann","year":"2018","unstructured":"Hamann M, Krause M. On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Cryptogr Commun. 2018;10(5):959\u20131012.","journal-title":"Cryptogr Commun"},{"key":"221_CR24","doi-asserted-by":"crossref","first-page":"45","DOI":"10.46586\/tosc.v2017.i1.45-79","volume":"1","author":"M Hamann","year":"2017","unstructured":"Hamann M, Krause M, Meier W. LIZARD\u2014a lightweight stream cipher for power-constrained devices. IACR Trans Sym Cryptol. 2017;1:45\u201379.","journal-title":"IACR Trans Sym Cryptol"},{"issue":"3","key":"221_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TIT.1977.1055709","volume":"23","author":"M Hellman","year":"1977","unstructured":"Hellman M. An extension of the Shannon theory approach to cryptography. IEEE Trans Inf Theory. 1977;23(3):289\u201394.","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"221_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M Hellman","year":"1980","unstructured":"Hellman M. A cryptanalytic time-memory trade-off. IEEE Trans Inf Theor. 1980;26(4):401\u20136.","journal-title":"IEEE Trans Inf Theor"},{"key":"221_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-93638-3_9","volume-title":"Information security and privacy","author":"HM Heys","year":"2018","unstructured":"Heys HM. Distributed time-memory tradeoff attacks on ciphers. In: Susilo W, Yang G, editors. Information security and privacy. Cham: Springer; 2018. p. 135\u201353."},{"key":"221_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10623-010-9368-x","volume":"57","author":"J Hong","year":"2010","unstructured":"Hong J. The cost of false alarms in Hellman and rainbow tradeoffs. Des Codes Cryptogr. 2010;57:293\u2013327.","journal-title":"Des Codes Cryptogr"},{"issue":"4","key":"221_CR29","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00145-012-9128-3","volume":"26","author":"J Hong","year":"2013","unstructured":"Hong J, Moon S. A comparison of cryptanalytic tradeoff algorithms. J Cryptol. 2013;26(4):559\u2013637.","journal-title":"J Cryptol"},{"key":"221_CR30","doi-asserted-by":"crossref","unstructured":"Hong J, Sarkar P. New applications of time memory data tradeoffs. In: Roy B (ed) Advances in cryptology\u2014ASIACRYPT 2005. Lecture notes in computer science, vol 3788, Springer, Berlin, Heidelberg; 2005. p. 353\u201372.","DOI":"10.1007\/11593447_19"},{"key":"221_CR31","unstructured":"Hong J, Jeong KC, Kwon EY, Lee IS, Ma D. Variants of the distinguished point method for cryptanalytic time memory trade-offs. In: Chen L, Mu Y, Susilo W (eds) Information security practice and experience ISPEC 2008. Lecture notes in computer science, vol. 4991, Springer, Berlin; 2008. p. 131\u201345."},{"key":"221_CR32","unstructured":"Kara O, Erguler I. A new approach to keystream based cryptosystems. In: The state of the art of stream ciphers: SASC 2008. Workshop record; 2008. p. 205\u201321."},{"key":"221_CR33","unstructured":"Kara O, Erguler I, Anarim E. In: Proceedings of extended abstracts, international conference on applied and computational mathematics ICACM-2012. Ankara, Turkey: METU; 2012. p. 1\u20135."},{"key":"221_CR34","doi-asserted-by":"crossref","unstructured":"Kocher PC. Timing attacks on implementations of Diffie\u2013Hellman, RSA, DSS, and other systems. In: Koblitz N (ed) Advances in cryptology\u2014CRYPTO 96. Lecture notes in computer science, vol. 1109, Springer, London, UK; 1996. p. 104\u201313.","DOI":"10.1007\/3-540-68697-5_9"},{"key":"221_CR35","doi-asserted-by":"crossref","unstructured":"K\u00f6pf B, D\u00fcrmuth M. A provably secure and efficient countermeasure against timing attacks. In: 22nd IEEE computer security foundations symposium, CSF\u201909; 2009. p. 324\u201335","DOI":"10.1109\/CSF.2009.21"},{"key":"221_CR36","unstructured":"Lallemand V, Naya-Plasencia M. Cryptanalysis of full Sprout. In: Gennaro R, Robshaw M (eds) Advances in cryptology\u2013CRYPTO 2015, Part 1. Lecture notes in computer science, vol. 9215. Springer, Berlin; 2015. p. 663\u201382."},{"key":"221_CR37","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10623-015-0116-0","volume":"80","author":"GW Lee","year":"2012","unstructured":"Lee GW, Hong J. Comparison of perfect table cryptanalytic tradeoff algorithms. Des Codes Cryptogr. 2012;80:473\u2013523.","journal-title":"Des Codes Cryptogr"},{"key":"221_CR38","first-page":"115","volume":"7","author":"A Mahalanobis","year":"2014","unstructured":"Mahalanobis A, Shah J. An improved guess-and-determine attack on the A5\/1 stream cipher. Comput Inf Sci. 2014;7:115\u201324.","journal-title":"Comput Inf Sci"},{"key":"221_CR39","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45473-X_13","volume-title":"Fast software encryption","author":"I Mantin","year":"2002","unstructured":"Mantin I, Shamir A. A practical attack on broadcast RC4. In: Matsui M, editor. Fast software encryption. Berlin: Springer; 2002. p. 152\u201364."},{"key":"221_CR40","unstructured":"McEliece RJ. A public-key cryptosystem based on algebraic coding theory. DSN progress report, Jet Propulsion Laboratory, Pasadena, CA; 1978. p. 114\u20136."},{"key":"221_CR41","doi-asserted-by":"crossref","unstructured":"Mihaljevic MJ, Oggier FE, Imai H. Homophonic coding design for communication systems employing the encoding-encryption paradigm. 2010; CoRR. arXiv:1012.5895","DOI":"10.1109\/ICTEL.2010.5478824"},{"key":"221_CR42","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00607-009-0035-x","volume":"85","author":"M Mihaljevi\u0107","year":"2009","unstructured":"Mihaljevi\u0107 M, Imai H. An approach for stream ciphers design based on joint computing over random and secret data. Computing. 2009;85:153\u201368.","journal-title":"Computing"},{"key":"221_CR43","doi-asserted-by":"crossref","first-page":"52","DOI":"10.46586\/tosc.v2016.i2.52-79","volume":"2016","author":"V Mikhalev","year":"2017","unstructured":"Mikhalev V, Armknecht F, Muller C. On ciphers that continually access the non-volatile key. IACR Trans Sym Cryptol. 2017;2016:52\u201379.","journal-title":"IACR Trans Sym Cryptol"},{"key":"221_CR44","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-540-45146-4_36","volume-title":"Advances in cryptology\u2014CRYPTO 2003","author":"P Oechslin","year":"2003","unstructured":"Oechslin P. Making a faster cryptanalytic time-memory trade-off. In: Boneh D, editor. Advances in cryptology\u2014CRYPTO 2003. Berlin: Springer; 2003. p. 617\u201330."},{"key":"221_CR45","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-11659-4_12","volume-title":"Post-quantum cryptography: PQCrypto 2014. Lecture notes in computer science","author":"C Peikert","year":"2014","unstructured":"Peikert C. Lattice cryptography for the internet. In: Mosca M, editor. Post-quantum cryptography: PQCrypto 2014. Lecture notes in computer science, vol. 8772. Cham: Springer; 2014. p. 197\u2013219."},{"issue":"4","key":"221_CR46","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert C. A decade of lattice cryptography. Found Trends\u00ae Theor Comput Sci. 2016;10(4):283\u2013424. https:\/\/doi.org\/10.1561\/0400000074 .","journal-title":"Found Trends\u00ae Theor Comput Sci"},{"key":"221_CR47","doi-asserted-by":"crossref","unstructured":"Rivest RL, Sherman AT. Randomized encryption techniques. In: Chaum D, Rivest RL, Sherman AT (eds) Advances in cryptology: proceedings of crypto \u201982. Springer, Boston; 1983. p. 145\u201363.","DOI":"10.1007\/978-1-4757-0602-4_14"},{"key":"221_CR48","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-45661-9_18","volume-title":"Fast software encryption","author":"MJO Saarinen","year":"2002","unstructured":"Saarinen MJO. A time-memory tradeoff attack against LILI-128. In: Daemen J, Rijmen V, editors. Fast software encryption. Berlin: Springer; 2002. p. 231\u20136."},{"key":"221_CR49","unstructured":"Sarkar P. Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector. Cryptology ePrint archive. Report 2011\/299; 2011. https:\/\/eprint.iacr.org\/2011\/299 . Accessed 25 Apr 2020."},{"issue":"4","key":"221_CR50","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C Shannon","year":"1949","unstructured":"Shannon C. Communication theory of secrecy systems. Bell Syst Tech J. 1949;28(4):656\u2013715.","journal-title":"Bell Syst Tech J"},{"key":"221_CR51","doi-asserted-by":"crossref","unstructured":"Standaert FX, Rouvroy G, Quisquater JJ, Legat JD. A time-memory tradeoff using distinguished points: new analysis and FPGA results. Revised papers from the 4th international workshop on cryptographic hardware and embedded systems, CHES \u201902. Springer, Berlin; 2002. p. 593\u2013609.","DOI":"10.1007\/3-540-36400-5_43"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00221-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42979-020-00221-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00221-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T01:26:29Z","timestamp":1616462789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42979-020-00221-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["221"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-00221-z","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"23 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"226"}}