{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:33:23Z","timestamp":1725600803875},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231407"},{"type":"electronic","value":"9783642231414"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23141-4_11","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T12:36:48Z","timestamp":1313584608000},"page":"111-122","source":"Crossref","is-referenced-by-count":6,"title":["2SC: An Efficient Code-Based Stream Cipher"],"prefix":"10.1007","author":[{"given":"Mohammed","family":"Meziani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Louis","family":"Cayrel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidi Mohamed","family":"El Yousfi Alaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: Rsa and rabin functions: certain parts are as hard as the whole. SIAM J. Comput.\u00a017(2), 194\u2013209 (1988)","journal-title":"SIAM J. Comput."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11554868_6","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"D. Augot","year":"2005","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A Family of Fast Syndrome Based Cryptographic Hash Functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 64\u201383. Springer, Heidelberg (2005)"},{"issue":"12","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1016\/j.jsc.2008.10.004","volume":"44","author":"C. Berbain","year":"2009","unstructured":"Berbain, C., Gilbert, H., Patarin, J.: Quad: A multivariate stream cipher with provable security. J. Symb. Comput.\u00a044(12), 1703\u20131723 (2009)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"11_CR4","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, H.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory\u00a024(2), 384\u2013386 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo random number generator. SIAM J. Comput.\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput.\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"11_CR7","unstructured":"Finiasz, M., Gaborit, P., Sendrier, N.: Improved fast syndrome based cryptographic hash functions. In: Rijmen, V. (ed.) ECRYPT Hash Workshop 2007 (2007)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-based Cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J.-B. Fischer","year":"1996","unstructured":"Fischer, J.-B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 245\u2013255. Springer, Heidelberg (1996)"},{"key":"11_CR10","unstructured":"Peeters, M., Bertoni, G., Daemen, J., Van Assche, G.: Sponge Functions. In: ECRYPT Hash Workshop 2007 (2007)"},{"key":"11_CR11","unstructured":"Peeters, M., Bertoni, G., Daemen, J., Van Assche, G.: On the security of the keyed sponge construction. In: Symmetric Key Encryption Workshop, SKEW 2011 (2011)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Laudaroux, C., Sendrier, N.: Synd: a very fast code-based cipher stream with a security reduction. In: IEEE Conference, ISIT 2007, Nice, France, pp. 186\u2013190 (July 2007)","DOI":"10.1109\/ISIT.2007.4557224"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/73007.73010","volume-title":"STOC 1989: Proc. of the Twenty-first Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 1989: Proc. of the Twenty-first Annual ACM Symposium on Theory of Computing, pp. 25\u201332. ACM, New York (1989)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-69053-0_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"J.D. Golic","year":"1997","unstructured":"Golic, J.D.: Cryptanalysis of alleged a5 stream cipher. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 239\u2013255. Springer, Heidelberg (1997)"},{"key":"11_CR15","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 Transactions on Information Theory\u00a026, 401\u2013406 (1980)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR16","unstructured":"Hong, J., Sarkar, P.: Rediscovery of time memory tradeoffs. Cryptology ePrint Archive, Report 2005\/090 (2005), \n                  \n                    http:\/\/eprint.iacr.org\/"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. J. Cryptology\u00a09(4), 199\u2013216 (1996)","journal-title":"J. Cryptology"},{"key":"11_CR18","unstructured":"Kaliski, B.S.: Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools. Phd thesis, MIT, Cambridge, MA, USA (1988)"},{"key":"11_CR19","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations. Plenum Press, New York (1972)"},{"key":"11_CR20","volume-title":"The Theory of Error Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"11_CR21","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"SFCS 1994: Proc. of the 35th Annual Symposium on Foundations of Computer Science","author":"P.W. Shor","year":"1994","unstructured":"Shor, P.W.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: SFCS 1994: Proc. of the 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE Computer Society, Los Alamitos (1994)"},{"key":"11_CR22","unstructured":"H\u00e5stad, J., N\u00e4slund, M.: Bmgl: Synchronous key-stream generator with provable security (2001)"}],"container-title":["Communications in Computer and Information Science","Information Security and Assurance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23141-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T14:40:18Z","timestamp":1554043218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23141-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231407","9783642231414"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23141-4_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}