On linear approximation of modulo sum
(2004) 11th International Workshop, FSE 2004 3017. p.483-484- Abstract
- The general case for a linear approximation of the form "X-1+(...)+X-k mod 2(n'') -->"X-1 circle plus(...)circle plus X-k circle plus N" is investigated, where the variables and operations are n-bit based, and the noise variable N is introduced due to the approximation. An efficient and practical algorithm of complexity 0(n (.) 2(3(k-1))) to calculate the probability Pr{N} is given, and in some cases it can be reduced to 0(2(k-2)).
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/272865
- author
- Maximov, Alexander LU
- organization
- publishing date
- 2004
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Fast Software Encryption (Lecture Notes in Computer Science)
- volume
- 3017
- pages
- 483 - 484
- publisher
- Springer
- conference name
- 11th International Workshop, FSE 2004
- conference location
- Delhi, India
- conference dates
- 2004-02-05 - 2004-02-07
- external identifiers
-
- wos:000222561800031
- ISSN
- 0302-9743
- 1611-3349
- ISBN
- 978-3-540-22171-5
- DOI
- 10.1007/978-3-540-25937-4_31
- language
- English
- LU publication?
- yes
- id
- 8f6bcbd5-11e2-41bd-84fa-cf78225e71c8 (old id 272865)
- date added to LUP
- 2016-04-01 12:16:03
- date last changed
- 2018-11-21 20:05:38
@inproceedings{8f6bcbd5-11e2-41bd-84fa-cf78225e71c8, abstract = {{The general case for a linear approximation of the form "X-1+(...)+X-k mod 2(n'') -->"X-1 circle plus(...)circle plus X-k circle plus N" is investigated, where the variables and operations are n-bit based, and the noise variable N is introduced due to the approximation. An efficient and practical algorithm of complexity 0(n (.) 2(3(k-1))) to calculate the probability Pr{N} is given, and in some cases it can be reduced to 0(2(k-2)).}}, author = {{Maximov, Alexander}}, booktitle = {{Fast Software Encryption (Lecture Notes in Computer Science)}}, isbn = {{978-3-540-22171-5}}, issn = {{0302-9743}}, language = {{eng}}, pages = {{483--484}}, publisher = {{Springer}}, title = {{On linear approximation of modulo sum}}, url = {{http://dx.doi.org/10.1007/978-3-540-25937-4_31}}, doi = {{10.1007/978-3-540-25937-4_31}}, volume = {{3017}}, year = {{2004}}, }