{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:53:13Z","timestamp":1725475993076},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340751"},{"type":"electronic","value":"9783540340768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751595_47","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T10:27:59Z","timestamp":1147343279000},"page":"436-445","source":"Crossref","is-referenced-by-count":9,"title":["Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms"],"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":"47_CR1","doi-asserted-by":"crossref","unstructured":"Electronics Frontier Foundation, Cracking DES, O\u2019Reilly and Associates (1998)","DOI":"10.1049\/ee.1998.0053"},{"key":"47_CR2","unstructured":"Bernstein, D.J.: Salsa20 specification, ecrypt submission (2005), http:\/\/www.ecrypt.eu.org\/"},{"issue":"3-4","key":"47_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00200-004-0147-7","volume":"15","author":"S. Burman","year":"2004","unstructured":"Burman, S., Sarkar, P.: An Efficient Algorithm for Software Generation of Binary Linear Recurrences. Appl. Algebra Eng. Commun. Comput.\u00a015(3-4), 201\u2013203 (2004)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/PROC.1979.11256","volume":"67","author":"W. Diffie","year":"1979","unstructured":"Diffie, W., Hellman, M.: Privacy and Authentication: An Introduction to Cryptography. Proceedings of the IEEE\u00a067, 397\u2013427 (1979)","journal-title":"Proceedings of the IEEE"},{"key":"47_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":"47_CR6","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., Niederreriter, H.: Introduction to Finite Fields and their applications, pp. 189\u2013249. Cambridge University Press, Cambridge (1994) (revised edition)"},{"key":"47_CR7","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":"47_CR8","unstructured":"Mentens, N., Batina, L., Preneel, B., Verbauwhede, I.: Cracking Unix passwords using FPGA platforms. Presented at SHARCS 2005 (2005)"},{"key":"47_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/11604938_3","volume-title":"Information Security Applications","author":"S. Mukhopadhyay","year":"2006","unstructured":"Mukhopadhyay, S., Sarkar, P.: Application of LFSRs in Time\/Memory Trade-Off Cryptanalysis. In: Song, J.-S., Kwon, T., Yung, M. (eds.) WISA 2005. LNCS, vol.\u00a03786, pp. 25\u201337. Springer, Heidelberg (2006)"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Mukhopadhyay, S., Sarkar, P.: Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms, Cryptology ePrint Technical report 2006\/042 (February 6, 2006), http:\/\/eprint.iacr.org\/2006\/042","DOI":"10.1007\/11751595_47"},{"key":"47_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":"47_CR12","unstructured":"Quisquater, J.J., Standaert, F.X.: Exhaustive Key Search of the DES: Updates and Refinements. Presented at SHARCS 2005 (2005)"},{"key":"47_CR13","first-page":"31","volume-title":"presented at the rump session of CRYTO 1993, reprented in Practical Cryptography for Data Internetworks","author":"M.J. Wiener","year":"1996","unstructured":"Wiener, M.J.: Efficient DES Key Search. In: Stallings, W. (ed.) presented at the rump session of CRYTO 1993, reprented in Practical Cryptography for Data Internetworks, pp. 31\u201379. IEEE Computer Society Press, Los Alamitos (1996)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751595_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:59:59Z","timestamp":1619492399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751595_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340751","9783540340768"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11751595_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}