2009 Second International Symposium on Computational Intelligence and Design 2009
DOI: 10.1109/iscid.2009.280
|View full text |Cite
|
Sign up to set email alerts
|

Research on Time Randomization of AES against Differential Power Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…efficiency are possible: if the phase dependencies allow, δ could be small (even zero) while producing the same security benefit. High-level, algorithm-specific implementations of this concept in hardware are known [27]; realising an algorithm-neutral version on an SCA seems difficult as the result of managing dependencies between phases. This is, for example, more difficult than the case of instruction dependencies in software [15].…”
Section: Countermeasuresmentioning
confidence: 99%
“…efficiency are possible: if the phase dependencies allow, δ could be small (even zero) while producing the same security benefit. High-level, algorithm-specific implementations of this concept in hardware are known [27]; realising an algorithm-neutral version on an SCA seems difficult as the result of managing dependencies between phases. This is, for example, more difficult than the case of instruction dependencies in software [15].…”
Section: Countermeasuresmentioning
confidence: 99%