Paper 2006/261
Using Wiedemann's algorithm to compute the immunity against algebraic and fast algebraic attacks
Frederic Didier
Abstract
We show in this paper how to apply well known methods from sparse linear algebra to the problem of computing the immunity of a Boolean function against algebraic or fast algebraic attacks.
For an
Note: second submission : I removed the accents in my name because there was a problem...
Metadata
- Available format(s)
-
PDF PS
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- algebraic and fast algebraic attacksalgebraic immunityWiedemann's algorithm
- Contact author(s)
- frederic didier @ inria fr
- History
- 2006-08-07: received
- Short URL
- https://ia.cr/2006/261
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/261, author = {Frederic Didier}, title = {Using Wiedemann's algorithm to compute the immunity against algebraic and fast algebraic attacks}, howpublished = {Cryptology {ePrint} Archive, Paper 2006/261}, year = {2006}, url = {https://eprint.iacr.org/2006/261} }