{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:40:00Z","timestamp":1757781600612,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T00:00:00Z","timestamp":1472515200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272042"],"award-info":[{"award-number":["61272042"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61202492"],"award-info":[{"award-number":["61202492"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s12095-016-0203-8","type":"journal-article","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T00:07:38Z","timestamp":1472515658000},"page":"563-580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the best linear approximation of addition modulo 2 n"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4899-3211","authenticated-orcid":false,"given":"Shuai","family":"Xue","sequence":"first","affiliation":[]},{"given":"Wen-Feng","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Xiao-Yuan","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,30]]},"reference":[{"key":"203_CR1","unstructured":"Staffelbach, O., Meier, W.: Cryptographic Significance of the Carry for Ciphers Based on Integer Addition. In: Advances in Cryptology\u2014CRYPTO 1990, LNCS, vol. 537, pp. 601\u2013614 (1990)"},{"key":"203_CR2","doi-asserted-by":"crossref","unstructured":"Maximov, A.: On Linear Approximation of Modulo Sum. In: Fast Software Encryption\u2014FSE 2004, LNCS, vol. 3017, pp. 483\u2013484 (2004)","DOI":"10.1007\/978-3-540-25937-4_31"},{"key":"203_CR3","doi-asserted-by":"crossref","unstructured":"Maximov, A., Johansson, T.: Fast Computation of Large Distributions and Its Cryptographic Applications. In: Advances in Cryptology\u2014ASIACRYPT 2005, LNCS, vol. 3788, pp. 313\u2013332 (2005)","DOI":"10.1007\/11593447_17"},{"key":"203_CR4","unstructured":"Sarkar, P.: On approximating addition by exclusive OR. http:\/\/eprint.iacr.org\/2009\/047.pdf (2014)"},{"key":"203_CR5","unstructured":"Alqui\u00e9, D.: Approximating addition by XOR: how to go all the way. http:\/\/eprint.iacr.org\/2010\/072.pdf (2015)"},{"key":"203_CR6","doi-asserted-by":"crossref","unstructured":"Feng, X., Zhou, C., Wu, C.: Linear Approximations of Addition Modulo 2 n \u22121. In: Fast Software Encryption\u2014FSE 2011, LNCS, vol. 6733, pp. 359\u2013377 (2011)","DOI":"10.1007\/978-3-642-21702-9_21"},{"key":"203_CR7","doi-asserted-by":"crossref","unstructured":"Ekdahl, P., Johansson, T.: Distinguishing Attacks on SOBER-T16 and T32. In: Fast Software Encryption\u2014FSE 2002, LNCS, vol. 2365, pp. 210\u2013224 (2002)","DOI":"10.1007\/3-540-45661-9_16"},{"key":"203_CR8","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Halevi, S., Jutla, C.: Cryptanalysis of Stream Ciphers with Linear Masking. In: Advances in Cryptology\u2014CRYPTO 2002, LNCS, vol. 2442, pp. 515\u2013532 (2002)","DOI":"10.1007\/3-540-45708-9_33"},{"key":"203_CR9","doi-asserted-by":"crossref","unstructured":"Wall\u00e9n, J.: Linear Approximations of Addition Modulo 2 n . In: Fast Software Encryption\u2014FSE 2003, LNCS, vol. 2887, pp. 261\u2013273 (2003)","DOI":"10.1007\/978-3-540-39887-5_20"},{"key":"203_CR10","unstructured":"Wall\u00e9n, J.: On the Differential and Linear Properties of Addition Research Report A84, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland (2003)"},{"key":"203_CR11","doi-asserted-by":"crossref","unstructured":"Nyberg, K., Wall\u00e9n, J.: Improved Linear Distinguishers for SNOW 2.0. In: Fast Software Encryption\u2014FSE 2006, LNCS, vol. 4047, pp. 144\u2013162 (2006)","DOI":"10.1007\/11799313_10"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-016-0203-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-016-0203-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-016-0203-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-016-0203-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T21:54:39Z","timestamp":1568325279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-016-0203-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,30]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s12095-016-0203-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2016,8,30]]}}}