Matthias Probst
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matthias Probst has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Georg Sigl
Technical University of Munich
6 shared publications - Manuel Brosch
TUM School of Computation, Information and Technology, Technical University of Munich
4 shared publications C Zimmer
Technische Universität München/Klinikum rechts der Isar
2 shared publications- Egon Burian
Department of Diagnostic and Interventional Radiology University Hospital of Zurich Zurich Switzerland
2 shared publications - Lars Tebelmann
Technical University of Munich
2 shared publications - Michael Gruber
Technical University of Munich
2 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.
- 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
Influence of Parallelism in Vector-Multiplication Units on Correlation Power Analysis
The use of neural networks in edge devices is increasing, which introduces new security challenges related to the neural networks' confidentiality. As edge devices often offer physical access, attacks targeting the hardware, such as side-channel analysis, must be considered. To enhance the performance of neural network 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 operations on overall power consumption is evaluated, as well as the success rate of correlation power analysis. 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 an FPGA.
Open AccessInfluence of Parallelism in Vector-Multiplication Units on Correlation Power Analysis
The use of neural networks in edge devices is increasing, which introduces new security challenges related to the neural networks' confidentiality. As edge devices often offer physical access, attacks targeting the hardware, such as side-channel analysis, must be considered. To enhance the performance of neural network 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 operations on overall power consumption is evaluated, as well as the success rate of correlation power analysis. 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 an FPGA.
- 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
- Open Access
- 14 November 2024
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 15 (1) , 1-19
Remote side-channel analysis of the loop PUF using a TDC-based voltage sensor
FPGAs promise significant performance improvements for several computations in cloud applications. However, their shared use in multi-tenant scenarios makes them susceptible to attacks. Different from classical scenarios, where the attacker has hardware access to the device, in cloud scenarios the attack is possible only from remote. As a consequence remote SCA attacks gained increasing attention in the last years. These attacks exploit that attacker and victim share with the same FPGA also the same PDN so that operation-dependent voltage fluctuations caused by the victim’s IP are observable by a voltage sensor of the attacker. While previous attacks in this domain focused on cryptographic algorithms, this work provides insights in an attack on a PUF primitive, the Loop PUF. This primitive is an interesting target for the attack since it might be used, e.g., for storing or deriving secret keys on a remote FPGA. We introduce and discuss the setup of such a remote SCA using a TDC-based voltage sensor. With this sensor, we compare the performance of classical and remote SCA attacks on the Loop PUF using two different Artix-7 FPGA and demonstrate and discuss findings regarding sampling frequency and placement. This work extends and deepens the analysis from a previously published analysis at the ASHES Workshop 2022. In particular, it provides insights into the influence of repeated measurements, measurement time, and usage of multiple TDCs on the attack performance. It also discusses the applicability of the attack to further RO-based PUF primitives. Overall the results show that remote SCA attacks on PUFs in a multi-tenant FPGA scenario have to be considered as a severe attack vector in the future.
- 14 November 2024
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 15 (1) , 1-19
Open AccessRemote side-channel analysis of the loop PUF using a TDC-based voltage sensor
FPGAs promise significant performance improvements for several computations in cloud applications. However, their shared use in multi-tenant scenarios makes them susceptible to attacks. Different from classical scenarios, where the attacker has hardware access to the device, in cloud scenarios the attack is possible only from remote. As a consequence remote SCA attacks gained increasing attention in the last years. These attacks exploit that attacker and victim share with the same FPGA also the same PDN so that operation-dependent voltage fluctuations caused by the victim’s IP are observable by a voltage sensor of the attacker. While previous attacks in this domain focused on cryptographic algorithms, this work provides insights in an attack on a PUF primitive, the Loop PUF. This primitive is an interesting target for the attack since it might be used, e.g., for storing or deriving secret keys on a remote FPGA. We introduce and discuss the setup of such a remote SCA using a TDC-based voltage sensor. With this sensor, we compare the performance of classical and remote SCA attacks on the Loop PUF using two different Artix-7 FPGA and demonstrate and discuss findings regarding sampling frequency and placement. This work extends and deepens the analysis from a previously published analysis at the ASHES Workshop 2022. In particular, it provides insights into the influence of repeated measurements, measurement time, and usage of multiple TDCs on the attack performance. It also discusses the applicability of the attack to further RO-based PUF primitives. Overall the results show that remote SCA attacks on PUFs in a multi-tenant FPGA scenario have to be considered as a severe attack vector in the future.
- 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.
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 32 (2) , 231-244
A Masked Hardware Accelerator for Feed-Forward Neural Networks With Fixed-Point Arithmetic
Neural network (NN) execution on resource-constrained edge devices is increasing. Commonly, hardware accelerators are introduced in small devices to support the execution of NNs. However, an attacker can often gain physical access to edge devices. Therefore, side-channel attacks are a potential threat to obtain valuable information about the NN. In order to keep the network secret and protect it from extraction, countermeasures are required. In this article, we propose a masked hardware accelerator for feed-forward NNs that utilizes fixed-point arithmetic and is protected against side-channel analysis (SCA). We use an existing arithmetic masking scheme and improve it to prevent incorrect results. Moreover, we transfer the scheme to the hardware layer by utilizing the glitch-extended probing model and demonstrate the security of the individual modules. To exhibit the effectiveness of the masked design, we implement it on an FPGA and measure the power consumption. The results show that with two million measurements, no secret information is leaked by means of a $t$ -test. In addition, we compare our accelerator with the masked software implementation and other hardware designs. The comparison indicates that our accelerator is up to 38 times faster than software and improves the throughput by a factor of about 4.1 compared to other masked hardware accelerators.
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 32 (2) , 231-244
A Masked Hardware Accelerator for Feed-Forward Neural Networks With Fixed-Point Arithmetic
Neural network (NN) execution on resource-constrained edge devices is increasing. Commonly, hardware accelerators are introduced in small devices to support the execution of NNs. However, an attacker can often gain physical access to edge devices. Therefore, side-channel attacks are a potential threat to obtain valuable information about the NN. In order to keep the network secret and protect it from extraction, countermeasures are required. In this article, we propose a masked hardware accelerator for feed-forward NNs that utilizes fixed-point arithmetic and is protected against side-channel analysis (SCA). We use an existing arithmetic masking scheme and improve it to prevent incorrect results. Moreover, we transfer the scheme to the hardware layer by utilizing the glitch-extended probing model and demonstrate the security of the individual modules. To exhibit the effectiveness of the masked design, we implement it on an FPGA and measure the power consumption. The results show that with two million measurements, no secret information is leaked by means of a $t$ -test. In addition, we compare our accelerator with the masked software implementation and other hardware designs. The comparison indicates that our accelerator is up to 38 times faster than software and improves the throughput by a factor of about 4.1 compared to other masked hardware accelerators.
- 16 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 16 (15566013) , 4321-4335
DOMREP–An Orthogonal Countermeasure for Arbitrary Order Side-Channel and Fault Attack Protection
Protection against physical attacks is a major requirement for cryptographic implementations on devices which can be accessed by attackers. Side-channel and fault injection attacks are the most common types of physical attacks. In this work we present a novel generic solution for simultaneous protection against side-channel and fault attacks with arbitrary order. We combine domain oriented masking and repetition codes in an orthogonal way and call this approach DOMREP. The resistance against side-channel attacks and fault attacks can be scaled independently of each other, for the protection against higher-order side-channel analysis and the injection of multiple faults including SIFA. We develop the generic concept of orthogonal protection, and implement the DOMREP concept on GIMLI, a round two NIST LWC competition candidate, on a Xilinx Artix-7 FPGA. Our implementation of GIMLI is verified to be resistant against univariate first-order side-channel attacks by TVLA. The resistance against SIFA is verified by means of fault emulation of single as well as multiple bit faults. Our implementation of GIMLI achieves the expected security level according to these measurements. We also provide numbers for the area overhead for our protected implementation of GIMLI.
- 16 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 16 (15566013) , 4321-4335
DOMREP–An Orthogonal Countermeasure for Arbitrary Order Side-Channel and Fault Attack Protection
Protection against physical attacks is a major requirement for cryptographic implementations on devices which can be accessed by attackers. Side-channel and fault injection attacks are the most common types of physical attacks. In this work we present a novel generic solution for simultaneous protection against side-channel and fault attacks with arbitrary order. We combine domain oriented masking and repetition codes in an orthogonal way and call this approach DOMREP. The resistance against side-channel attacks and fault attacks can be scaled independently of each other, for the protection against higher-order side-channel analysis and the injection of multiple faults including SIFA. We develop the generic concept of orthogonal protection, and implement the DOMREP concept on GIMLI, a round two NIST LWC competition candidate, on a Xilinx Artix-7 FPGA. Our implementation of GIMLI is verified to be resistant against univariate first-order side-channel attacks by TVLA. The resistance against SIFA is verified by means of fault emulation of single as well as multiple bit faults. Our implementation of GIMLI achieves the expected security level according to these measurements. We also provide numbers for the area overhead for our protected implementation of GIMLI.
- 2 January 2020
- Published by Georg Thieme Verlag KG in RöFo - Fortschritte auf dem Gebiet der Röntgenstrahlen und der bildgebenden Verfahren
- Vol. 192 (S 01) , S62
Darstellung peripherer Hirnnerven und ihrer Pathologien im extrakraniellen Verlauf mittels neuer hochauflösender Sequenzen
Zielsetzung Die Darstellbarkeit peripherer Hirnnerven im extracraniellen Verlauf gestaltet sich aufgrund der anatomischen Verhältnisse im Gesicht und Hals oft schwierig. Ziel dieser Studie ist die Etablierung eines Scanprotokolls zur direkten Visualisierung sowie qualitativen und quantitativen Evaluation peripherer Hirnnerven. Material und Methoden Es wurden im Rahmen einer Studie 43 Probanden (28-80 Jahre) und 17 Patienten mittels hochauflösender (0,55 mm Voxel) 3D STIR (Short tau inversion recovery) und 3D WATS (Water selective excitation) Sequenzen untersucht. Diese wurden im Vorfeld an die Gegebenheiten der Mund-, Kiefer- und Gesichtsregion angepasst. Bei Probanden und Patienten wurde durch zwei Radiologen erfasst, inwiefern sich die Hirnnerven (insbesondere N. fazialis und N. trigeminus) im extracraniellen Verlauf darstellen lassen. Ergebnisse In der STIR Sequenz weisen periphere Nerven ein hohes Signal zu Muskel Verhältnis auf (aNMCNR= Apparent nerve-muscle contrast to noise ratio). In der WATS Sequenz gelang die beste Abgrenzbarkeit im Verlauf durch einen hohen Gesamtkontrast zum umliegenden Gewebe mit niedrigem Gefäßsignal, wodurch die peripheren Nerven weniger stark maskiert wurden. Am besten ließen sich die Trigeminusäste (V2 und V3) bei hoher Übereinstimmung der beiden Rater abgrenzen. Wilcoxon matched-pairs two-tailed Test Rater 1 versus Rater 2 (significantly different p<0,05): WATS aNMCNR: N. alveolaris inferior (V3) proximal p=0,76, STIR aNMCNR: N. alveolaris inferior (V3) proximal p=0,33, Die Darstellbarkeit des N. fazialis hängt stark von dem Grad der Verfettung der Glandula parotis ab. Schlußfolgerungen Bei der Diagnostik von Pathologien im Verlauf peripherer Gesichtsnerven liefern die hochauflösenden WATS und STIR Sequenzen wertvolle Zusatzinformationen sowohl präoperativ bei enger Lagebeziehung von Parotistumoren zum N. fazialis sowie im Rahmen der Diagnostik der idiopathischen Trigeminusneuralgie.
- 2 January 2020
- Published by Georg Thieme Verlag KG in RöFo - Fortschritte auf dem Gebiet der Röntgenstrahlen und der bildgebenden Verfahren
- Vol. 192 (S 01) , S62
Darstellung peripherer Hirnnerven und ihrer Pathologien im extrakraniellen Verlauf mittels neuer hochauflösender Sequenzen
Zielsetzung Die Darstellbarkeit peripherer Hirnnerven im extracraniellen Verlauf gestaltet sich aufgrund der anatomischen Verhältnisse im Gesicht und Hals oft schwierig. Ziel dieser Studie ist die Etablierung eines Scanprotokolls zur direkten Visualisierung sowie qualitativen und quantitativen Evaluation peripherer Hirnnerven. Material und Methoden Es wurden im Rahmen einer Studie 43 Probanden (28-80 Jahre) und 17 Patienten mittels hochauflösender (0,55 mm Voxel) 3D STIR (Short tau inversion recovery) und 3D WATS (Water selective excitation) Sequenzen untersucht. Diese wurden im Vorfeld an die Gegebenheiten der Mund-, Kiefer- und Gesichtsregion angepasst. Bei Probanden und Patienten wurde durch zwei Radiologen erfasst, inwiefern sich die Hirnnerven (insbesondere N. fazialis und N. trigeminus) im extracraniellen Verlauf darstellen lassen. Ergebnisse In der STIR Sequenz weisen periphere Nerven ein hohes Signal zu Muskel Verhältnis auf (aNMCNR= Apparent nerve-muscle contrast to noise ratio). In der WATS Sequenz gelang die beste Abgrenzbarkeit im Verlauf durch einen hohen Gesamtkontrast zum umliegenden Gewebe mit niedrigem Gefäßsignal, wodurch die peripheren Nerven weniger stark maskiert wurden. Am besten ließen sich die Trigeminusäste (V2 und V3) bei hoher Übereinstimmung der beiden Rater abgrenzen. Wilcoxon matched-pairs two-tailed Test Rater 1 versus Rater 2 (significantly different p<0,05): WATS aNMCNR: N. alveolaris inferior (V3) proximal p=0,76, STIR aNMCNR: N. alveolaris inferior (V3) proximal p=0,33, Die Darstellbarkeit des N. fazialis hängt stark von dem Grad der Verfettung der Glandula parotis ab. Schlußfolgerungen Bei der Diagnostik von Pathologien im Verlauf peripherer Gesichtsnerven liefern die hochauflösenden WATS und STIR Sequenzen wertvolle Zusatzinformationen sowohl präoperativ bei enger Lagebeziehung von Parotistumoren zum N. fazialis sowie im Rahmen der Diagnostik der idiopathischen Trigeminusneuralgie.
- 2 January 2020
- Published by Georg Thieme Verlag KG in RöFo - Fortschritte auf dem Gebiet der Röntgenstrahlen und der bildgebenden Verfahren
- Vol. 192 (S 01) , S48
MRT zur Parodontitisdiagnostik – Eignung und Mehrwert
Zielsetzung Erkrankungen des Zahnhalteapparates haben gesellschaftlich eine große Bedeutung sowohl sozio-ökonomisch sowie auch medizinisch. Bei der Diagnostik der Parodontitis werden bildgebend bislang ausschließlich röntgenbasierte Verfahren wie die OPT oder DVT eingesetzt. Hierbei werden lediglich späte Stadien der Parodontitis angezeigt, die bereits mit einer irreversiblen Destruktion des Zahnhalteapparates und des umgebenden Knochens einhergehen und zu Zahnverlust führen. Die direkte Visualisierung der Entzündungsprozesse im Parodontalapparat und umgebenden Kieferknochen ist weder durch röntgenbasierte Bildgebung noch durch klinische Tests möglich. Eine neue Alternative bietet die MRT, welche in der Lage ist, bereits im Initialstadium entzündliche Prozesse im Knochen zu visualisieren noch bevor es zu strukturellen Veränderungen kommt. Material und Methoden In einer prospektiven Studie soll der Einsatz von MRT Sequenzen (hochauflösende 3D STIR, 3D T1 FFE Black bone) bei Patienten mit Parodontitis (n=40) erprobt werden. Verglichen werden die Aufnahmen mit einem klinisch symptomfreien Vergleichskollektiv (n=30). Die Aufnahmen wurden an einem 3T MRT (Elition, Philips, Best, the Netherlands) mit einer 16-Kanal Head-Neck-Spine Spule erhoben. Erfassung der mit einer Parodontitis assoziierten Veränderungen im MRT (Ödem des umgebenden Knochens als Frühzeichen der Krankheitsaktivität und Attachmentverlust durch bereits eingetretenen Knochenabbau). Korrelation mit etablierten klinischen Parametern (Grad der Zahnlocke-rung, Bleeding on probing, Taschensondierungstiefe). Koregistrierung der 3D STIR mit 3D Black bone Sequenz (Software: Elastix). Volumetrierung des Knochenödems (STIR) und des vertikalen Kno-chenabbaus (Black Bone). Ergebnisse Es zeigt sich eine starke Korrelation der Taschensondierungstiefe (TST) mit der Aus-dehnung des Knochenödems (Spearman’s Rho = 0,725; p>0,0001). Das Vorhandensein eines Knö-chenödems (dichotom) korreliert mit der TST als unabhängige Variable (OR=6,32, 95% CI 1,71-23,3; p=0,006). Der klinische Parameter Bleeding on Probing (BOP) korreliert stark mit der Größe eines Knochenödems (Spearman’s Rho=0,244; p>0,0001). Auch bei physiologischer TST (Parodontitiskrite-rien formal noch nicht erfüllt) korreliert der Parameter BOP stark mit dem Vorhandensein eines Kno-chenödems (Mann-Whitney-U p=0,004). Schlußfolgerungen Diese prospektive Studie zeigt dass die MRT als bildgebendes Werkzeug zur Parodontitisdiagnostik geeignet ist. Die MRT ist der DVT überlegen, da es gelingt von Knochenabbau gefährdete Areale darzustellen. Die Strahlenfreiheit ermöglicht die MRT als Parodonti-tis Screeninginstrument. Zudem sind weitere Auswertungen vor und nach Therapie geplant um ein Therapiemonitoring durchzuführen.
- 2 January 2020
- Published by Georg Thieme Verlag KG in RöFo - Fortschritte auf dem Gebiet der Röntgenstrahlen und der bildgebenden Verfahren
- Vol. 192 (S 01) , S48
MRT zur Parodontitisdiagnostik – Eignung und Mehrwert
Zielsetzung Erkrankungen des Zahnhalteapparates haben gesellschaftlich eine große Bedeutung sowohl sozio-ökonomisch sowie auch medizinisch. Bei der Diagnostik der Parodontitis werden bildgebend bislang ausschließlich röntgenbasierte Verfahren wie die OPT oder DVT eingesetzt. Hierbei werden lediglich späte Stadien der Parodontitis angezeigt, die bereits mit einer irreversiblen Destruktion des Zahnhalteapparates und des umgebenden Knochens einhergehen und zu Zahnverlust führen. Die direkte Visualisierung der Entzündungsprozesse im Parodontalapparat und umgebenden Kieferknochen ist weder durch röntgenbasierte Bildgebung noch durch klinische Tests möglich. Eine neue Alternative bietet die MRT, welche in der Lage ist, bereits im Initialstadium entzündliche Prozesse im Knochen zu visualisieren noch bevor es zu strukturellen Veränderungen kommt. Material und Methoden In einer prospektiven Studie soll der Einsatz von MRT Sequenzen (hochauflösende 3D STIR, 3D T1 FFE Black bone) bei Patienten mit Parodontitis (n=40) erprobt werden. Verglichen werden die Aufnahmen mit einem klinisch symptomfreien Vergleichskollektiv (n=30). Die Aufnahmen wurden an einem 3T MRT (Elition, Philips, Best, the Netherlands) mit einer 16-Kanal Head-Neck-Spine Spule erhoben. Erfassung der mit einer Parodontitis assoziierten Veränderungen im MRT (Ödem des umgebenden Knochens als Frühzeichen der Krankheitsaktivität und Attachmentverlust durch bereits eingetretenen Knochenabbau). Korrelation mit etablierten klinischen Parametern (Grad der Zahnlocke-rung, Bleeding on probing, Taschensondierungstiefe). Koregistrierung der 3D STIR mit 3D Black bone Sequenz (Software: Elastix). Volumetrierung des Knochenödems (STIR) und des vertikalen Kno-chenabbaus (Black Bone). Ergebnisse Es zeigt sich eine starke Korrelation der Taschensondierungstiefe (TST) mit der Aus-dehnung des Knochenödems (Spearman’s Rho = 0,725; p>0,0001). Das Vorhandensein eines Knö-chenödems (dichotom) korreliert mit der TST als unabhängige Variable (OR=6,32, 95% CI 1,71-23,3; p=0,006). Der klinische Parameter Bleeding on Probing (BOP) korreliert stark mit der Größe eines Knochenödems (Spearman’s Rho=0,244; p>0,0001). Auch bei physiologischer TST (Parodontitiskrite-rien formal noch nicht erfüllt) korreliert der Parameter BOP stark mit dem Vorhandensein eines Kno-chenödems (Mann-Whitney-U p=0,004). Schlußfolgerungen Diese prospektive Studie zeigt dass die MRT als bildgebendes Werkzeug zur Parodontitisdiagnostik geeignet ist. Die MRT ist der DVT überlegen, da es gelingt von Knochenabbau gefährdete Areale darzustellen. Die Strahlenfreiheit ermöglicht die MRT als Parodonti-tis Screeninginstrument. Zudem sind weitere Auswertungen vor und nach Therapie geplant um ein Therapiemonitoring durchzuführen.