Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ingo von Maurich

dblp:05/10085 · DBLP profile ↗
← Back
11ranked-venue papers
4as first author
0since 2021 · last 2016
0000-0002-8461-9657ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 8 · 2 first-authorSystems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 77% Hardware security and side channels · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography
code-based cryptography
0.422016
Horizontal and Vertical Side Channel Analysis of a McEliece Cryptosystem · IEEE Trans. Inf. Forensics Secur. 2016
Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices · CHES 2013
Cryptographic primitives and cryptanalysis › post-quantum cryptography › code-based cryptography
mceliece cryptosystem
0.212016
Horizontal and Vertical Side Channel Analysis of a McEliece Cryptosystem · IEEE Trans. Inf. Forensics Secur. 2016
Hardware security and side channels
side-channel attack
0.212016
Horizontal and Vertical Side Channel Analysis of a McEliece Cryptosystem · IEEE Trans. Inf. Forensics Secur. 2016
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.212013
Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices · CHES 2013

Methods — techniques the papers use, named apart from their topics

syndrome computation · 0.2algebraic attack · 0.2
YearPublicationVenuePosition
2016 IND-CCA Secure Hybrid Encryption from QC-MDPC Niederreiter
Ingo von Maurich, Lukas Heberle, Tim Güneysu
PQCrypto1
2016 Horizontal and Vertical Side Channel Analysis of a McEliece Cryptosystem
abstract
This paper presents horizontal and vertical side channel analysis techniques for an implementation of the McEliece cryptosystem. The target of this side-channel attack is a state-of-the-art field-programmable gate array (FPGA) implementation of the efficient quasi-cyclic moderate-density parity-check McEliece decryption operation, as presented at Design, Automation and Test in Europe (DATE) 2014. The presented cryptanalysis succeeds to recover the complete secret key after a few observed decryptions. It consists of a combination of a differential leakage analysis during the syndrome computation followed by an algebraic step that exploits the relation between the public key and the private key.
Cong Chen 0001, Thomas Eisenbarth 0001, Ingo von Maurich, Rainer Steinwandt
IEEE Trans. Inf. Forensics Secur.3
2015 Differential Power Analysis of a McEliece Cryptosystem
Cong Chen 0001, Thomas Eisenbarth 0001, Ingo von Maurich, Rainer Steinwandt
ACNS3
2015 Masking Large Keys in Hardware: A Masked Implementation of McEliece
Cong Chen 0001, Thomas Eisenbarth 0001, Ingo von Maurich, Rainer Steinwandt
SAC3
2015 Implementing QC-MDPC McEliece Encryption
abstract
With respect to performance, asymmetric code-based cryptography based on binary Goppa codes has been reported as a highly interesting alternative to RSA and ECC. A major drawback is still the large keys in the range between 50 and 100KB that prevented real-world applications of code-based cryptosystems so far. A recent proposal by Misoczki et al. showed that quasi-cyclic moderate-density parity-check (QC-MDPC) codes can be used in McEliece encryption, reducing the public key to just 0.6KB to achieve an 80-bit security level. In this article, we provide optimized decoding techniques for MDPC codes and survey several efficient implementations of the QC-MDPC McEliece cryptosystem. This includes high-speed and lightweight architectures for reconfigurable hardware, efficient coding styles for ARM’s Cortex-M4 microcontroller, and novel high-performance software implementations that fully employ vector instructions. Finally, we conclude that McEliece encryption in combination with QC-MDPC codes not only enables high-performance implementations but also allows for lightweight designs on a wide range of different platforms.
Ingo von Maurich, Tobias Oder, Tim Güneysu
ACM Trans. Embed. Comput. Syst.1
2014 Lightweight code-based cryptography: QC-MDPC McEliece encryption on reconfigurable devices
abstract
With the break of RSA and ECC cryptosystems in an era of quantum computing, asymmetric code-based cryptography is an established alternative that can be a potential replacement. A major drawback are large keys in the range between 50kByte to several MByte that prevented real-world applications of code-based cryptosystems so far. A recent proposal by Misoczki et al. showed that quasi-cyclic moderate density parity-check (QC-MDPC) codes can be used in McEliece encryption — reducing the public key to just 0.6 kByte to achieve a 80-bit security level. Despite of reasonably small key sizes that could also enable small designs, previous work only report highperformance implementations with high resource consumptions of more than 13,000 slices on a large Xilinx Virtex-6 FPGA for a combined en-/decryption unit. In this work we focus on lightweight implementations of code-based cryptography and demonstrate that McEliece encryption using QC-MDPC codes can be implemented with a significantly smaller resource footprint — still achieving reasonable performance sufficient for many applications, e.g., challenge-response protocols or hybrid firmware encryption. More precisely, our design requires just 68 slices for the encryption and around 150 slices for the decryption unit and is able to en-/decrypt an input block in 2.2ms and 13.4 ms, respectively.
Ingo von Maurich, Tim Güneysu
DATE1
2014 Towards Side-Channel Resistant Implementations of QC-MDPC McEliece Encryption on Constrained Devices
Ingo von Maurich, Tim Güneysu
PQCrypto1
2013 Efficient implementation of cryptographic primitives on the GA144 multi-core architecture
abstract
With myriads of small and pervasive devices in our digital age, the availability of low-power and energy-efficient processing technology has become absolutely essential. Most of these constrained devices need to incorporate security services for confidentiality and privacy in addition to their primary tasks - typically involving computationally expensive cryptography. In the last years, many researchers have worked on novel lightweight cryptographic constructions to minimize the computational burden on the constrained devices. However, most of those alternative constructions sacrificed security for simplicity, potentially enabling just as simple attacks. In this work, we aim for another approach and implement standardized and well-established cryptography on a special but very lightweight platform, namely an asynchronous GA144 ultra-low-powered multicore processor with 144 simplistic cores. For the first time, we demonstrate that symmetric and asymmetric cryptography such as AES and RSA is even feasible on such a low-end and unclocked device. With energy consumption being as low as 0.63 μJ and 22.3 mJ, this platform achieves a performance of 38 μs and 462.9 ms per AES and RSA operation, respectively. Both energy consumption as well as computation time are significantly lower than many lightweight implementations reported so far.
Tobias Schneider 0002, Ingo von Maurich, Tim Güneysu
ASAP2
2013 Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices
Stefan Heyse, Ingo von Maurich, Tim Güneysu
CHES2
2013 Faster Hash-Based Signatures with Bounded Leakage
Thomas Eisenbarth 0001, Ingo von Maurich, Xin Ye 0002
Selected Areas in Cryptography2
2012 Compact Implementation and Performance Evaluation of Hash Functions in ATtiny Devices
Josep Balasch, Baris Ege, Thomas Eisenbarth 0001, Benoît Gérard, Tim Güneysu, Stefan Heyse, Stéphanie Kerckhof, François Koeune, Thomas Plos, Thomas Pöppelmann, Francesco Regazzoni 0001, François-Xavier Standaert, Gilles Van Assche, Ronny Van Keer, Loïc van Oldeneel tot Oldenzeel, Ingo von Maurich
CARDIS17