Georg Sigl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Georg Sigl has a total of 98 co-authors. Here are the top co-authors by number of shared publications:
- Matthias Probst
Chair of Security in Information Technology, Technical University of Munich
6 shared publications - Patrick Karl
TUM School of Computation, Information and Technology, Technical University of Munich, Munich, Germany
5 shared publications - Jonas Schupp
Technical University of Munich
4 shared publications - Manuel Brosch
TUM School of Computation, Information and Technology, Technical University of Munich
4 shared publications - Fabrizio De Santis
Siemens AG
3 shared publications - Johann Heyszl
Fraunhofer Institute for Applied and Integrated Security (AISEC)
3 shared publications
Latest Publications
- Open Access
- 26 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (5) , 1-23
A Comprehensive Analysis of DOMREP-II with Respect to SCA-NFA
Protection against hardware attacks is a fundamental requirement for cryptographic implementations deployed on devices that may be physically accessible to adversaries. The primary threats in such scenarios are SCA and FIA, which are increasingly being combined into potent joint attacks. A prominent example is the technique, which has been shown to circumvent DOMREP, a countermeasure designed to provide individual protections against both SCA and FIA. In this work, we present DOMREP-II, which extends the original scheme to withstand powerful adversaries with SCA-NFA capabilities. We adapt non-linear DOM gates to ensure strong non-interference under the presence of faults and develop a protected error-correction gate that eliminates secret-dependent leakage during the redundancy-checking phase. The proposed countermeasure is validated using first-order TVLA and a detailed empirical SCA-NFA analysis on a microcontroller platform. Our results demonstrate that while the original Domain Oriented Masking with REPetiton codes (DOMREP) implementation leaks the secret key within 100,000 traces, DOMREP-II successfully mitigates this leakage. When applied to the Gimli permutation, the enhanced protection introduces a moderate performance overhead of 18.8% in cycle count and only 4.4% in code size. Furthermore, we show that the authenticated structure of our countermeasure enables secure randomness reuse, reducing the entropy demand to 696 bytes per permutation. These findings confirm that DOMREP-II provides a practical and scalable security-performance tradeoff for high-assurance cryptographic implementations.
- 26 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (5) , 1-23
Open AccessA Comprehensive Analysis of DOMREP-II with Respect to SCA-NFA
Protection against hardware attacks is a fundamental requirement for cryptographic implementations deployed on devices that may be physically accessible to adversaries. The primary threats in such scenarios are SCA and FIA, which are increasingly being combined into potent joint attacks. A prominent example is the technique, which has been shown to circumvent DOMREP, a countermeasure designed to provide individual protections against both SCA and FIA. In this work, we present DOMREP-II, which extends the original scheme to withstand powerful adversaries with SCA-NFA capabilities. We adapt non-linear DOM gates to ensure strong non-interference under the presence of faults and develop a protected error-correction gate that eliminates secret-dependent leakage during the redundancy-checking phase. The proposed countermeasure is validated using first-order TVLA and a detailed empirical SCA-NFA analysis on a microcontroller platform. Our results demonstrate that while the original Domain Oriented Masking with REPetiton codes (DOMREP) implementation leaks the secret key within 100,000 traces, DOMREP-II successfully mitigates this leakage. When applied to the Gimli permutation, the enhanced protection introduces a moderate performance overhead of 18.8% in cycle count and only 4.4% in code size. Furthermore, we show that the authenticated structure of our countermeasure enables secure randomness reuse, reducing the entropy demand to 696 bytes per permutation. These findings confirm that DOMREP-II provides a practical and scalable security-performance tradeoff for high-assurance cryptographic implementations.
- 18 August 2026
- Published by Springer Nature
- p. 308-326
fRE: A TEE-Based Firmware Resilience Engine with Efficient Local Detection and Recovery
- 18 August 2026
- Published by Springer Nature
- p. 308-326
fRE: A TEE-Based Firmware Resilience Engine with Efficient Local Detection and Recovery
- Open Access
- 5 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (2) , 1-20
Influence of Parallelism in Vector-Multiplication Units on Correlation Power Analysis
The use of Neural Networks (NNs) in edge devices is increasing, introducing new security challenges related to the confidentiality of NNs. As edge devices often offer physical access, attacks targeting the hardware, such as Side-Channel Analysis (SCA), must be considered. To enhance the performance of NN inference, hardware accelerators are commonly employed. This work investigates the influence of parallel processing within such accelerators on correlation-based side-channel attacks that exploit power consumption. The focus is on neurons that are part of the same fully-connected layer, which run parallel and simultaneously process the same input value. The theoretical impact of concurrent Multiply-and-Accumulate (MAC) operations on overall power consumption is evaluated, as well as the success rate of Correlation Power Analysis (CPA). Based on the observed behavior, equations are derived that describe how the correlation decreases with increasing levels of parallelism. The applicability of these equations is validated using a vector-multiplication unit implemented on a Field Programmable Gate Array (FPGA). The theoretical boundary for successful CPA is found to be 15 parallel Processing Elements (PEs), while practical results show this limit is reduced to 8 PEs due to noise and Signal-to-Noise Ratio (SNR) reduction.
- 5 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (2) , 1-20
Open AccessInfluence of Parallelism in Vector-Multiplication Units on Correlation Power Analysis
The use of Neural Networks (NNs) in edge devices is increasing, introducing new security challenges related to the confidentiality of NNs. As edge devices often offer physical access, attacks targeting the hardware, such as Side-Channel Analysis (SCA), must be considered. To enhance the performance of NN inference, hardware accelerators are commonly employed. This work investigates the influence of parallel processing within such accelerators on correlation-based side-channel attacks that exploit power consumption. The focus is on neurons that are part of the same fully-connected layer, which run parallel and simultaneously process the same input value. The theoretical impact of concurrent Multiply-and-Accumulate (MAC) operations on overall power consumption is evaluated, as well as the success rate of Correlation Power Analysis (CPA). Based on the observed behavior, equations are derived that describe how the correlation decreases with increasing levels of parallelism. The applicability of these equations is validated using a vector-multiplication unit implemented on a Field Programmable Gate Array (FPGA). The theoretical boundary for successful CPA is found to be 15 parallel Processing Elements (PEs), while practical results show this limit is reduced to 8 PEs due to noise and Signal-to-Noise Ratio (SNR) reduction.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Solid-State Circuits Society
- Vol. 6, 354-364
Memory Confidentiality and Integrity: Flipping Bits in Hardware
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Solid-State Circuits Society
- Vol. 6, 354-364
Open AccessMemory Confidentiality and Integrity: Flipping Bits in Hardware
- 15 October 2025
- Published by Springer Nature
- p. 27-44
A Horizontal Attack on the Codes and Restricted Objects Signature Scheme (CROSS)
- 15 October 2025
- Published by Springer Nature
- p. 27-44
A Horizontal Attack on the Codes and Restricted Objects Signature Scheme (CROSS)
- Open Access
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 23-32
Special Sessions - Hardware-Software Co-Design for Machine Learning Systems Made Open-Source
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 23-32
Open AccessSpecial Sessions - Hardware-Software Co-Design for Machine Learning Systems Made Open-Source
- 10 August 2025
- Published by Springer Nature
- p. 74-91
A Cyber-Resilient DICE Architecture for Resource-Constrained Devices
- 10 August 2025
- Published by Springer Nature
- p. 74-91
A Cyber-Resilient DICE Architecture for Resource-Constrained Devices
- Open Access
- 4 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (2) , 548-560
Side-Channel Analysis of Integrate-and-Fire Neurons Within Spiking Neural Networks
Spiking neural networks gain increasing attention in constraint edge devices due to event-based low-power operation and little resource usage. Such edge devices often allow physical access, opening the door for Side-Channel Analysis. In this work, we introduce a novel robust attack strategy on the neuron level to retrieve the trained parameters of an implemented spiking neural network. Utilizing horizontal correlation power analysis, we demonstrate how to recover the weights and thresholds of a feed-forward spiking neural network implementation. We verify our methodology with real-world measurements of localized electromagnetic emanations of an FPGA design. Additionally, we propose countermeasures against the introduced novel attack approach. We evaluate shuffling and masking as countermeasures to protect the implementation against our proposed attack and demonstrate their effectiveness and limitations.
- 4 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (2) , 548-560
Open AccessSide-Channel Analysis of Integrate-and-Fire Neurons Within Spiking Neural Networks
Spiking neural networks gain increasing attention in constraint edge devices due to event-based low-power operation and little resource usage. Such edge devices often allow physical access, opening the door for Side-Channel Analysis. In this work, we introduce a novel robust attack strategy on the neuron level to retrieve the trained parameters of an implemented spiking neural network. Utilizing horizontal correlation power analysis, we demonstrate how to recover the weights and thresholds of a feed-forward spiking neural network implementation. We verify our methodology with real-world measurements of localized electromagnetic emanations of an FPGA design. Additionally, we propose countermeasures against the introduced novel attack approach. We evaluate shuffling and masking as countermeasures to protect the implementation against our proposed attack and demonstrate their effectiveness and limitations.
- Open Access
- 9 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
Performance and Communication Cost of Hardware Accelerators for Hashing in Post-Quantum Cryptography
SPHINCS+ is a signature scheme included in the first NIST post-quantum standard, that bases its security on the underlying hash primitive. As most of the runtime of SPHINCS+ is caused by the evaluation of several hash- and pseudo-random functions, offloading this computation to dedicated hardware accelerators is a natural step. In this work, we evaluate different architectures for hardware acceleration of such a hash primitive with respect to its use-case and evaluate them in the context of SPHINCS+. We attach hardware accelerators for different hash primitives (SHAKE128 and Ascon-Xof for both, full and round-reduced versions) to CPU interfaces having different transfer speeds. We show, that for most use-cases, data transfer determines the overall performance if accelerators are equipped with FIFOs and that reducing the number of rounds in the permutation does not necessarily lead to significant performance improvements when using hardware acceleration. This work extends on a conference paper accepted at COSADE’24, first published in [19], and written by the same authors, where different architectures for hardware accelerators of hash functions are benchmarked and evaluated for SPHINCS+ as a case study. In this paper, we provide results for additional parameter sets for SPHINCS+ and improve the performance of one of the accelerators by adding an additional RISC-V instruction for faster absorption. We then extend the performance benchmark by including the algorithms CRYSTALS-Kyber, CRYSTALS-Dilithium and Falcon. Finally we provide a power/energy comparison for the accelerators.
- 9 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
Open AccessPerformance and Communication Cost of Hardware Accelerators for Hashing in Post-Quantum Cryptography
SPHINCS+ is a signature scheme included in the first NIST post-quantum standard, that bases its security on the underlying hash primitive. As most of the runtime of SPHINCS+ is caused by the evaluation of several hash- and pseudo-random functions, offloading this computation to dedicated hardware accelerators is a natural step. In this work, we evaluate different architectures for hardware acceleration of such a hash primitive with respect to its use-case and evaluate them in the context of SPHINCS+. We attach hardware accelerators for different hash primitives (SHAKE128 and Ascon-Xof for both, full and round-reduced versions) to CPU interfaces having different transfer speeds. We show, that for most use-cases, data transfer determines the overall performance if accelerators are equipped with FIFOs and that reducing the number of rounds in the permutation does not necessarily lead to significant performance improvements when using hardware acceleration. This work extends on a conference paper accepted at COSADE’24, first published in [19], and written by the same authors, where different architectures for hardware accelerators of hash functions are benchmarked and evaluated for SPHINCS+ as a case study. In this paper, we provide results for additional parameter sets for SPHINCS+ and improve the performance of one of the accelerators by adding an additional RISC-V instruction for faster absorption. We then extend the performance benchmark by including the algorithms CRYSTALS-Kyber, CRYSTALS-Dilithium and Falcon. Finally we provide a power/energy comparison for the accelerators.
- 3 April 2024
- Published by Springer Nature
- p. 221-239
The Impact of Hash Primitives and Communication Overhead for Hardware-Accelerated SPHINCS+
- 3 April 2024
- Published by Springer Nature
- p. 221-239
The Impact of Hash Primitives and Communication Overhead for Hardware-Accelerated SPHINCS+