{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T12:55:44Z","timestamp":1794401744970,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_137","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:50:45Z","timestamp":1319709045000},"page":"1297-1299","source":"Crossref","is-referenced-by-count":0,"title":["Time-Memory Trade-offs"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois-Xavier","family":"Standaert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"137_CR1_137","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1380564.1380565","volume":"11","author":"G Avoine","year":"2008","unstructured":"Avoine G, Junod P, Oeschlin P (2008) Characterization and improvement of time-memory trade-off based on perfect tables. ACM Trans Inform Syst Secur 11(4):1\u201322","journal-title":"ACM Trans Inform Syst Secur"},{"key":"137_CR2_137","doi-asserted-by":"crossref","unstructured":"Barkan E, Biham E, Shamir A (2006) Rigorous bounds on cryptanalytic time\/memory trade-offs. In: Proceedings of CRYPTO 2006. LNCS, vol 4117. Springer, Heidelberg, pp\u00a01\u201321","DOI":"10.1007\/11818175_1"},{"key":"137_CR3_137","unstructured":"Borst J (2001) Block ciphers: design, analysis and side-channel analysis. PhD thesis, Departement of Electrical Engineering, Katholieke Universiteit Leuven, Belgium"},{"key":"137_CR4_137","first-page":"100","volume-title":"Cryptography and data security","author":"D Denning","year":"1982","unstructured":"Denning D (1982) Cryptography and data security. Addison-Wesley, Reading, p\u00a0100"},{"key":"137_CR5_137","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M Hellman","year":"1980","unstructured":"Hellman M (1980) A cryptanalytic time-memory tradeoff. IEEE Trans Inform Theory 26:401\u2013406","journal-title":"IEEE Trans Inform Theory"},{"key":"137_CR6_137","doi-asserted-by":"crossref","unstructured":"Oechslin P (2003) Making a faster cryptanalytic time-memory trade-off. In: Proceedings of CRYPTO 2003. LNCS, vol 2729. Springer, Heidelberg, pp 617\u2013630","DOI":"10.1007\/978-3-540-45146-4_36"},{"key":"137_CR7_137","doi-asserted-by":"crossref","unstructured":"Quisquater JJ, Delescaille JP (1990) How easy is collision search? Application to DES. In: Proceedings of EUROCRYPT\u201989. LNCS, vol 434. Springer, Heidelberg, pp 429\u2013434","DOI":"10.1007\/3-540-46885-4_43"},{"key":"137_CR8_137","doi-asserted-by":"crossref","unstructured":"Standaert FX, Rouvroy G, Quisquater JJ, Legat JD (2002) A time-memory tradeoff using distinguished points: new analysis and FPGA results. In: Proceedings of CHES 2002. LNCS, vol 2523. Springer, Heidelberg, pp 593\u2013609","DOI":"10.1007\/3-540-36400-5_43"},{"issue":"1","key":"137_CR9_137","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot PC, Wiener MJ (1999) Parallel collision search with cryptanalytic applications. J Cryptol 12(1):1\u201328","journal-title":"J Cryptol"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T21:58:15Z","timestamp":1791842295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_137","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011]]}}}