# On the Influence of the FPGA Compiler Optimization Options on the Success of the Horizontal Attack

@article{Kabin2019OnTI, title={On the Influence of the FPGA Compiler Optimization Options on the Success of the Horizontal Attack}, author={Ievgen Kabin and Alejandro Sosa and Zoya Dyka and Dan Klann and Peter Langend{\"o}rfer}, journal={2019 International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, year={2019}, pages={1-5} }

This paper reports about the impact of compiler options on the resistance of cryptographic implementations against side channel analysis attacks. We evaluated four compiler option for six different FPGAs from Intel and Xilinx. In order to ensure fair assessment we synthesized always the same VHDL code, kept the measurement setup and statistical analysis method etc. constant. Our analysis clearly shows that the compiler options have an impact on the success of attacks but also that the impact is…

## Figures and Tables from this paper

## 3 Citations

### FFT based Horizontal SCA Attack against ECC

- Computer Science2021 11th IFIP International Conference on New Technologies, Mobility and Security (NTMS)
- 2021

The authors' fast Fourier transform (FFT) based horizontal SCA attack performed against an ASIC implementation of the Montgomery kP algorithm for the NIST elliptic curve B-233 achieved a correctness of 96% for the key revealed analysing the trace in the frequency domain, based on FFT.

### Resistance of the Montgomery Ladder Against Simple SCA: Theory and Practice

- Computer ScienceJ. Electron. Test.
- 2021

This work implemented the Montgomery kP algorithm using Lopez-Dahab projective coordinates for the NIST elliptic curve B-233, instantiated the same VHDL code for a wide range of clock frequencies for the same target FPGA and using the same compiler options.

### Automated Simple Analysis Attack

- Computer Science, Mathematics2020 9th Mediterranean Conference on Embedded Computing (MECO)
- 2020

This paper discusses simple side channel analysis attack against the authors' Montgomery $kP$ implementation, and shows that the attack becomes even easier when the design works at higher frequencies, using state of the art FPGAs.

## References

SHOWING 1-7 OF 7 REFERENCES

### Horizontal Attacks Against ECC: From Simulations to ASIC

- Computer ScienceIOSec/MSTEC/FINSEC@ESORICS
- 2019

It is found that the compile_ultra option reduces the success rate significantly from 5 key candidates with a correctness of between 75 and 90% down to 3 key candidate with a maximum success rate of 72% compared to the simple compile option.

### FPGA Implementation of ECC: Low-Cost Countermeasure against Horizontal Bus and Address-Bit SCA

- Computer Science, Mathematics2018 International Conference on ReConFigurable Computing and FPGAs (ReConFig)
- 2018

The number of clock cycles in which key candidates were extracted with a correctness of more than 90 per cent was reduced from 14 to zero attacking a power trace and from 21 to 5 attacking an electromagnetic trace for the latter design variant.

### Horizontal Address-Bit DEMA against ECDSA

- Computer Science2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)
- 2018

This paper details the horizontal DEMA attack against a hardware implementation of the Montgomery kP algorithm for the NIST elliptic curve B-233 and applies the attack successfully against the ECDSA algorithm.

### Increasing the Robustness of the Montgomery kP-Algorithm Against SCA by Modifying Its Initialization

- Computer ScienceSECITC
- 2016

The Montgomery kP-algorithm using Lopez-Dahab projective coordinates is a well-known method for performing the scalar multiplication in elliptic curve crypto-systems (ECC), but its initialization phase affects this algorithm’s robustness against side channel analysis (SCA) attacks.

### Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation

- Computer Science, MathematicsCHES
- 1999

The improved method possesses many desirable features for implementing elliptic curves in restricted environments and requires less memory than projective schemes and the amount of computation needed for a scalar multiplication is fixed for all multipliers of the same binary length.