Secure GCM implementation on AVR
| Autor: | Hwajeong Seo, Yasuyuki Nogami, Taehwan Park, Zhe Liu, Jongseok Choi, Chien Ning Chen, Howon Kim |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Authenticated encryption
Block cipher mode of operation business.industry Applied Mathematics Karatsuba algorithm 020206 networking & telecommunications Cryptography 02 engineering and technology Parallel computing Encryption Attack model 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics 020201 artificial intelligence & image processing Side channel attack Elliptic curve cryptography Arithmetic business Mathematics |
| Zdroj: | Discrete Applied Mathematics. 241:58-66 |
| ISSN: | 0166-218X |
| Popis: | In Internet of Things (IoT), sensor devices should deliver the collected sensor data to the server after the data is encrypted. The encrypted data cannot be eavesdropped by adversaries but the side channel information including clock cycles and power consumption patterns during encryption operations can leak the secret information. For this reason, cryptography engineering should prevent potential threats by designing the cryptography functions in secure manner. In this paper, we explore the feasible side channel attacks on cryptography operations, particularly polynomial multiplication for Galois/Counter Mode of operation (GCM). We perform the horizontal Correlation Power Analysis (CPA) on the most well-known Lopez et al.’s polynomial multiplication and successfully extract the secret values from power consumption patterns. In order to prevent proposed attack model, we suggest a masked polynomial multiplication, ensuring a regular and constant-time solution without potential vulnerabilities including Look-up Table (LUT) access and branch statements. With proposed polynomial multiplication, we suggest the secure and efficient implementation of GCM on the low-end embedded processor. Finally, we further explore the long polynomial multiplication for Elliptic Curve Cryptography (ECC) operations. We exploit the combination of Karatsuba algorithm and proposed masked polynomial multiplication, which achieved the practically fast polynomial multiplication on embedded processors. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect