Randomization of Elliptic Curve Secret Key to Efficiently Resist Power Analysis |
장상운
(고려대학교 정보보호 대학원)
정석원 (고려대학교 정보보호 대학원) 박영호 (세종 사이버 대학교 컴퓨터공학부) |
1 |
Protections agains diffenential analysis for elliptic curve cryptography : An algebraic approach
/
|
2 |
A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
/
|
3 |
An Analysis of Goubin;s Refined Power Analysis Attack
/
|
4 |
On insecurity of the side shannel attack countermeasure using addition subtraction chains under distinguishablility between addition and doubling
/
|
5 |
Speeding up the computation on an elliptic curve using addition-subtraction chains
/
DOI |
6 |
Preventing SPA/DPA in ECC Systems using the Jacobi form
/
|
7 |
Resistance against Differential Power Analysis for Elliptic Curve Crypto-systems
/
|
8 |
A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attack
/
|
9 |
Weierstraβ Elliptic Curves and side-Channel attacks
/
|
10 |
Power analysis breaks elliptic curve cryptosystems even secure against the timing attack
/
|
11 |
Hessian elliptic curves and side-channel attacks
/
|
12 |
Randomized Addition-Subtraction Chanins as a Count ermeasure against power Attacks
/
|
13 |
Randomized signed-Scalar Multiplication of ECC to Resist Power Attacks
/
|
14 |
/
|