{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:52:35Z","timestamp":1771703555120,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540430667","type":"print"},{"value":"9783540455370","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45537-x_8","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T17:29:27Z","timestamp":1180891767000},"page":"103-111","source":"Crossref","is-referenced-by-count":67,"title":["A Simple Algebraic Representation of Rijndael"],"prefix":"10.1007","author":[{"given":"Niels","family":"Ferguson","sequence":"first","affiliation":[]},{"given":"Richard","family":"Schroeppel","sequence":"additional","affiliation":[]},{"given":"Doug","family":"Whiting","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"8_CR1","unstructured":"Joan Daemen and Vincent Rijmen. AES proposal: Rijndael. In AES Round 1 Technical Evaluation, CD-1: Documentation. NIST, August 1998. See \n                    http:\/\/www.esat.kuleuven.ac.be\/~rijmen\/rijndael\/\n                    \n                   or \n                    http:\/\/www.nist.gov\/aes\n                    \n                  ."},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Fast Software Encryption 2000","author":"N. Ferguson","year":"2000","unstructured":"Niels Ferguson, John Kelsey, Stefan Lucks, Bruce Schneier, Mike Stay, David Wagner, and Doug Whiting. Improved cryptanalysis of Rijndael. In Bruce Schneier, editor, Fast Software Encryption 2000, volume 1978 of Lecture Notes in Computer Science. Springer-Verlag, 2000."},{"key":"8_CR3","unstructured":"Matthew Kwan. Reducing the gate count of bitslice DES. Cryptology ePrint Archive, Report 2000\/051, 2000. \n                    http:\/\/eprint.iacr.org\/\n                    \n                  ."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-69897-2"},{"key":"8_CR5","unstructured":"Sean Murphy and Matt Robshaw. New observations on Rijndael. Available from \n                    http:\/\/www.isg.rhul.ac.uk\/mrobshaw\/\n                    \n                  , August 2000. Preliminary Draft."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45537-X_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T23:03:20Z","timestamp":1550358200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45537-X_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430667","9783540455370"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45537-x_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}