Artemii Ovchinnikov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Artemii Ovchinnikov has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Siemen Dhooghe
COSIC, ESAT, KU Leuven, Leuven, Belgium
3 shared publications - Aein Rezaei Shahmirzadi
PQShield, Oxford, UK
2 shared publications - Jelle Biesmans
KU Leuven
1 shared publication - Kris Myny
KU Leuven, Leuven, Belgium
1 shared publication - Svetla Nikova
COSIC, KU Leuven
1 shared publication
Latest Publications
- 19 November 2026
- Published by Springer Nature
- p. 209-235
Uniform Sharing in Multiple Stages: Towards Second-Order Security
- 19 November 2026
- Published by Springer Nature
- p. 209-235
Uniform Sharing in Multiple Stages: Towards Second-Order Security
- 9 July 2026
- Published by Springer Nature
- p. 210-235
Can We Tolerate Small Side-Channel Leakages: The Role of Registers in Glitch-Stopping Circuits
- 9 July 2026
- Published by Springer Nature
- p. 210-235
Can We Tolerate Small Side-Channel Leakages: The Role of Registers in Glitch-Stopping Circuits
- Open Access
- 23 April 2026
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2026 (2) , 893-927
Uniform Sharing in Multiple Stages: NullFresh for Arbitrary Functions
In the field of hardware masking, threshold implementations are a wellknown technique that provides glitch-resistant power analysis security. While they guarantee probing security, finding a uniform sharing without additional randomness is difficult, making it challenging to apply to certain functions and, consequently, making it impossible to develop a tool that can straightforwardly generate the masked circuit. Additionally, this approach forces designers to use at least three shares in the underlying masking, which can make the design more costly. Other schemes, like DOM, which can work with two shares, often require fresh randomness. To address these issues, Shahmirzadi and Moradi introduced the NullFresh masking technique at CHES 2021. This method allows for uniform sharing with no additional randomness, using the minimal number of shares. However, similar to original threshold implementations, it is not always straightforward to find a NullFresh masking for arbitrary functions. In this work, we introduce an automated technique to provide masking for arbitrary functions, ensuring first-order security. This technique is applicable to functions where the number of output bits does not exceed the number of input bits. While this technique introduces additional register stages (resulting in higher latency and area) compared to existing methods, it addresses the automation challenges of threshold implementations, which have remained an open problem since their inception. We present the masking technique, along with proofs of glitch-extended probing security, and demonstrate its application to several ciphers, including Prince, Midori, Skinny, Keccak, and AES. The masked designs were verified using SILVER and PROLEAD, and tested on an FPGA through TVLA.
- 23 April 2026
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2026 (2) , 893-927
Open AccessUniform Sharing in Multiple Stages: NullFresh for Arbitrary Functions
In the field of hardware masking, threshold implementations are a wellknown technique that provides glitch-resistant power analysis security. While they guarantee probing security, finding a uniform sharing without additional randomness is difficult, making it challenging to apply to certain functions and, consequently, making it impossible to develop a tool that can straightforwardly generate the masked circuit. Additionally, this approach forces designers to use at least three shares in the underlying masking, which can make the design more costly. Other schemes, like DOM, which can work with two shares, often require fresh randomness. To address these issues, Shahmirzadi and Moradi introduced the NullFresh masking technique at CHES 2021. This method allows for uniform sharing with no additional randomness, using the minimal number of shares. However, similar to original threshold implementations, it is not always straightforward to find a NullFresh masking for arbitrary functions. In this work, we introduce an automated technique to provide masking for arbitrary functions, ensuring first-order security. This technique is applicable to functions where the number of output bits does not exceed the number of input bits. While this technique introduces additional register stages (resulting in higher latency and area) compared to existing methods, it addresses the automation challenges of threshold implementations, which have remained an open problem since their inception. We present the masking technique, along with proofs of glitch-extended probing security, and demonstrate its application to several ciphers, including Prince, Midori, Skinny, Keccak, and AES. The masked designs were verified using SILVER and PROLEAD, and tested on an FPGA through TVLA.
- 19 February 2024
- Published by Springer Nature
- p. 97-123
Threshold Implementations with Non-uniform Inputs
- 19 February 2024
- Published by Springer Nature
- p. 97-123
Threshold Implementations with Non-uniform Inputs