2011 International Conference on Research and Innovation in Information Systems 2011
DOI: 10.1109/icriis.2011.6125708
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced Key Expansion for AES-256 by using Even-Odd method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…A Key Schedule is an algorithm that gives those round keys for each round [4]. Suppose, each word length w i = 32 bits = 4 bytes.…”
Section: 2key Expansionmentioning
confidence: 99%
“…A Key Schedule is an algorithm that gives those round keys for each round [4]. Suppose, each word length w i = 32 bits = 4 bytes.…”
Section: 2key Expansionmentioning
confidence: 99%
“…After Key N+1 0 and Key N+1 1 are obtained, two judgement modules are added in the proposed scheme to calculate Key N+1 2 and Key N+1 3. This is inspired by [21], where RoundKeys are formed based on the even and odd positions of generated words. The operations in the judgement modules are If (judge bit == 1) out = operand 1 ⊕ (operand 2 ≪ 16)…”
Section: New Schemementioning
confidence: 99%
“…After Key N +1 0 and Key N +1 1 are obtained, two judgement modules are added in the proposed scheme to calculate Key N +1 2 and Key N +1 3. This is inspired by [21], where RoundKeys are formed based on the even and odd positions of generated words. The operations in the judgement modules are right leftthickmathspace.5emIf(judge_bit==1)out=operand_1(operand_216)elseout=operand_1(operand_28) where judge_bit is the judgement input, operand_1/2 are the two inputs, out is the output of the judgement module and represents the left rotation.…”
Section: New Key Expansion Schemementioning
confidence: 99%
“…RECTANGLE using bit-slice techniques is a lightweight block cipher with a similar motivation. Bit-slice technique was proposed by E. Biham in 1997 [9]. The bit-slice techniques can not only improve the performance of software, but also resist the cache time attacks and reduce the cost of protected channel attacks.…”
Section: Introductionmentioning
confidence: 99%