{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:16:41Z","timestamp":1725549401442},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310129"},{"type":"electronic","value":"9783540331537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11604938_3","type":"book-chapter","created":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T10:28:58Z","timestamp":1138789738000},"page":"25-37","source":"Crossref","is-referenced-by-count":5,"title":["Application of LFSRs in Time\/Memory Trade-Off Cryptanalysis"],"prefix":"10.1007","author":[{"given":"Sourav","family":"Mukhopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Palash","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44448-3_1","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"A. Biryukov","year":"2000","unstructured":"Biryukov, A., Shamir, A.: Cyptanalytic Time\/Memory\/Data Tradeoffs for Stream Ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 1\u201313. Springer, Heidelberg (2000)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11693383_8","volume-title":"Selected Areas in Cryptography","author":"A. Biryukov","year":"2006","unstructured":"Biryukov, A., Mukhopadhyay, S., Sarkar, P.: Improved Time-Memory Trade-offs with Multiple Data. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 110\u2013127. Springer, Heidelberg (2006)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Burman, S., Sarkar, P.: An Efficient Algorithm for Software Generation of Linear Binary Recurrences. Applicable Algebra in Engineering, Communication and Computing\u00a015(3\/4) (December 2004)","DOI":"10.1007\/s00200-004-0147-7"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Fiat, A., Naor, M.: Rigorous time\/space tradeoffs for inverting functions. In: STOC 1991, pp. 534\u2013541 (1991)","DOI":"10.1145\/103418.103473"},{"key":"3_CR5","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":"3_CR6","unstructured":"Hong, J., Sarkar, P.: Rediscovery of Time Memory Tradeoffs. Cryptology, eprint archive, http:\/\/eprint.iacr.org\/2005\/090"},{"key":"3_CR7","unstructured":"Kim, I.J., Matsumoto, T.: Achieving Higher Success Probability in Time-Memory Trade-Off Cryptanalysis without Increasing Memory Size. TIEICE: IEICE Transactions on Communications\/Electronics\/Information and System, 123\u2013129 (1999)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1017\/CBO9781139172769.008","volume-title":"Introduction to Finite Fields and their applications","author":"R. Lidl","year":"1994","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their applications, pp. 189\u2013249. Cambridge University Press, Cambridge (1994) (revised edition)"},{"key":"3_CR9","first-page":"195","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"2001","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, pp. 195\u2013201. CRC, Boca Raton (2001)"},{"key":"3_CR10","unstructured":"Mentens, N., Batina, L., Preneel, B., Verbauwhede, I.: Cracking Unix passwords using FPGA platforms. In: SHARCS 2005 (in submission, 2005)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-540-45146-4_36","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"P. Oechslin","year":"2003","unstructured":"Oechslin, P.: Making a faster Cryptanalytic Time-Memory Trade-Off. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 617\u2013630. Springer, Heidelberg (2003)"},{"key":"3_CR12","unstructured":"Oechslin, P.: Les compromis temps-memoire et leur utilisation pour casser les mots de passe Windows (in French). In: Symposium sur la Securite des Technologies de l\u2019information et de la Communication SSTIC, Rennes (June 2004)"},{"key":"3_CR13","unstructured":"RainbowCrack: General propose implementation of rainbow method, http:\/\/www.antsight.com\/zsl\/rainbowcrack\/"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-46885-4_43","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"J.J. Quisquater","year":"1990","unstructured":"Quisquater, J.J., Delescaille, J.P.: How easy is collision search? Application to DES. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 429\u2013434. Springer, Heidelberg (1990)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/3-540-36400-5_43","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"F.X. Standaert","year":"2003","unstructured":"Standaert, F.X., Rouvroy, G., Quisquater, J.J., Legat, J.D.: A Time-Memory Tradeoffs using Distinquished Points: New Analysis and FPGA Results. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 593\u2013609. Springer, Heidelberg (2003)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P.C. Oorschot van","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. Journal of Cryptology\u00a012(1), 1\u201328 (1999)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604938_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:02Z","timestamp":1619507102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604938_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310129","9783540331537"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11604938_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}