Back to Results
First PageMeta Content
Algebraic geometry / Valuation / Finite field / E-function / Correlation attack / Diophantine approximation / Schneider–Lang theorem / Field theory / Mathematics / Number theory


Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks Frederik Armknecht1 , Claude Carlet2 , Philippe Gaborit3 , Simon K¨ unzli4 , Willi Meier4 , and Olivier Ruatta3 1
Add to Reading List

Document Date: 2008-01-28 11:48:47

Open Document

File Size: 238,38 KB

Share Result on Facebook

City

Mannheim / /

Company

AES / BP / /

Country

Switzerland / Germany / France / /

IndustryTerm

refined algorithm / factorization algorithms / interpolation algorithm / generic algorithm / search step / scalar product / nontrivial solution / triangular systems / /

Organization

Univ. of Paris / /

Person

Ui Pi / /

Position

General / /

ProgrammingLanguage

C / /

Technology

cryptography / modified algorithm / much refined algorithm / classical incremental Newton interpolation algorithm / second algorithm / proposed algorithm / artificial intelligence / known algorithms / Bluetooth / Berlekamp-Massey algorithm / previous algorithms / LU factorization algorithms / /

SocialTag