2006
DOI: 10.1007/978-0-387-36842-9
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic Aspects of the Advanced Encryption Standard

Abstract: except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now know or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks and similar terms, even if the are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(2 citation statements)
references
References 71 publications
0
2
0
Order By: Relevance
“…The non-linearity of a Boolean function can be defined as the smallest distance between the function and the set of affine functions. It is denoted by Ψ is mathematically represented as: Ψ = min(𝑁 𝜇 ) (6) with 𝑁 𝑗 = min[𝑑(𝑓, 𝑔)], where 𝑔 ∈ 𝐴 𝑛 (7) where 𝐴 𝑛 is the set of all the affine functions. And 𝑑(𝑓, 𝑔) = 2 𝑛−1 − 2 −1 (〈𝜂, 𝛽〉) (8) where 𝜂, 𝛽 represent the binary sequence of 𝑓, 𝑔 respectively and 〈𝜂, 𝛽〉 define the scalar product of sequence, Hence, for a function 𝑓: 𝐵 𝑛…”
Section: Non-linearity (Nl)mentioning
confidence: 99%
“…The non-linearity of a Boolean function can be defined as the smallest distance between the function and the set of affine functions. It is denoted by Ψ is mathematically represented as: Ψ = min(𝑁 𝜇 ) (6) with 𝑁 𝑗 = min[𝑑(𝑓, 𝑔)], where 𝑔 ∈ 𝐴 𝑛 (7) where 𝐴 𝑛 is the set of all the affine functions. And 𝑑(𝑓, 𝑔) = 2 𝑛−1 − 2 −1 (〈𝜂, 𝛽〉) (8) where 𝜂, 𝛽 represent the binary sequence of 𝑓, 𝑔 respectively and 〈𝜂, 𝛽〉 define the scalar product of sequence, Hence, for a function 𝑓: 𝐵 𝑛…”
Section: Non-linearity (Nl)mentioning
confidence: 99%
“…This modified S-box formula may then be used to produce an AES encryption expression by using a type of continuing fractions. As a result, each byte of the state space is unchanged after five AES cycles, i j , (5)  , by [5]. The term "modified S-box formula" refers to a modified version of the substitution box (S-box) used in the AES algorithm.…”
Section: Interplanetary File System (Ipfs)mentioning
confidence: 99%