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

Stefan Tillich

dblp:21/5558 · DBLP profile ↗
← Back
24ranked-venue papers
9as first author
0since 2021 · last 2012
—ORCID · none

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

Security and privacy · 16 · 7 first-authorSystems, architecture and hardware · 4Software engineering, systems software and programming languages · 2Human-computer interaction and ubiquitous computing · 1Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
5 papers
Cryptographic primitives and cryptanalysis · 63% Hardware security and side channels · 37%
Computer architecture, parallel and distributed computing, and storage systems
5 papers
Processor architecture and microarchitecture · 51% Hardware accelerators and domain-specific architectures · 31% Energy-efficient computing · 13%

Topics — the 11 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › instruction set architecture
instruction set extension
0.232011
An Exploration of Mechanisms for Dynamic Cryptographic Instruction Set Extension · CHES 2011
Instruction Set Extensions for Efficient AES Implementation on 32-bit Processors · CHES 2006
Power Analysis Resistant AES Implementation with Instruction Set Extensions · CHES 2007
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.112011
An Exploration of Mechanisms for Dynamic Cryptographic Instruction Set Extension · CHES 2011
Hardware security and side channels
side-channel attack
0.112008
Attacking State-of-the-Art Software Countermeasures-A Case Study for AES · CHES 2008
Hardware security and side channels
side-channel countermeasures
0.112007
Power Analysis Resistant AES Implementation with Instruction Set Extensions · CHES 2007
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.112006
Hardware/Software Co-design of Elliptic Curve Cryptography on an 8051 Microcontroller · CHES 2006
Cryptographic primitives and cryptanalysis › number theory
modular arithmetic
0.112005
Energy-Efficient Software Implementation of Long Integer Modular Arithmetic · CHES 2005
Cryptographic primitives and cryptanalysis
public-key cryptography
0.112005
Energy-Efficient Software Implementation of Long Integer Modular Arithmetic · CHES 2005
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.022008
Attacking State-of-the-Art Software Countermeasures-A Case Study for AES · CHES 2008
Instruction Set Extensions for Efficient AES Implementation on 32-bit Processors · CHES 2006
Cryptographic primitives and cryptanalysis › block cipher
AES
0.012008
Attacking State-of-the-Art Software Countermeasures-A Case Study for AES · CHES 2008
Cryptographic primitives and cryptanalysis › symmetric cryptography
AES implementation
0.012006
Instruction Set Extensions for Efficient AES Implementation on 32-bit Processors · CHES 2006
Embedded and real-time systems › embedded software engineering › embedded software development
microcontroller deployment
0.012006
Hardware/Software Co-design of Elliptic Curve Cryptography on an 8051 Microcontroller · CHES 2006

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

instruction set extension · 0.3power analysis resistance · 0.1dynamic reconfiguration · 0.1side-channel attack · 0.1
YearPublicationVenuePosition
2012 On reconfigurable fabrics and generic side-channel countermeasures
abstract
The use of field programmable devices in security-critical applications is growing in popularity; in part, this can be attributed to their potential for balancing metrics such as efficiency and algorithm agility. However, in common with non-programmable alternatives, physical attack techniques such as fault and power analysis are a threat. We investigate a family of next-generation field programmable devices, specifically those based on the concept of time multiplexing, within this context: our results support the premise that extra, inherent flexibility in such devices can offer a range of possibilities for low-overhead, generic countermeasures against physical attack.
Robert Beat, Philipp Grabher, Dan Page, Stefan Tillich, Marcin Wójcik
FPL4
2012 Efficient Java Implementation of Elliptic Curve Cryptography for J2ME-Enabled Mobile Devices
Johann Großschädl, Dan Page, Stefan Tillich
WISTP3
2011 Implementation and Evaluation of an SCA-Resistant Embedded Processor
Stefan Tillich, Mario Kirschbaum, Alexander Szekely
CARDIS1
2011 An Exploration of Mechanisms for Dynamic Cryptographic Instruction Set Extension
Philipp Grabher, Johann Großschädl, Simon Hoerder, Kimmo Järvinen 0001, Dan Page, Stefan Tillich, Marcin Wójcik
CHES6
2011 An Evaluation of Hash Functions on a Power Analysis Resistant Processor Architecture
Simon Hoerder, Marcin Wójcik, Stefan Tillich, Dan Page
WISTP3
2010 SCA-resistant embedded processors: the next generation
abstract
Resistance against side-channel analysis (SCA) attacks is an important requirement for many secure embedded systems. Microprocessors and microcontrollers which include suitable countermeasures can be a vital building block for such systems. In this paper, we present a detailed concept for building embedded processors with SCA countermeasures. Our concept is based on ideas for the secure implementation of cryptographic instruction set extensions. On the one hand, it draws from known SCA countermeasures like DPA-resistant logic styles. On the other hand, our protection scheme is geared towards use in modern embedded applications like PDAs and smart phones. It supports multitasking and a separation of secure system software and (potentially insecure) user applications. Furthermore, our concept affords support for a wide range of cryptographic algorithms. Based on this concept, embedded processor cores with support for a selected set of cryptographic algorithms can be built using a fully automated design flow.
Stefan Tillich, Mario Kirschbaum, Alexander Szekely
ACSAC1
2009 On the Security of Untrusted Memory
abstract
Embedded systems can be used in versatile applications. At the same time, more and more functionality is demanded from these systems, which necessitates an increase in the size of program and data memory. Thus, an external chip providing additional memory can be added to the microcontroller, which is the system's core component. However, the connection between microcontroller chip and external memory is an easy target for an attacker. A small alteration in an external program memory can already lead to a radical change in the overall behavior of the embedded system. In security-related applications, such a change in behavior can result in potentially catastrophic consequences. Although there have been proposals for schemes to protect certain aspects of the use of external memories, none provides a comprehensive analysis of potential threats and respective countermeasures. Therefore, we propose a new scheme to detect all manipulations of data in the external memory as well as to prevent an adversary from learning potentially compromising information about the program running inside the microcontroller. Although our scheme entails a non-negligible overhead in terms of processing effort and memory, it is, to the best of our knowledge, the first to provide a practical, uniform and coherent protection for external memory.
Jörn-Marc Schmidt, Stefan Tillich
ARES2
2009 Comparing Block Cipher Modes of Operation on MICAz Sensor Nodes
abstract
Wireless sensor networks are a key technology for "ubiquitous computing" applications. The challenges of securing such networks are tremendous. On the one side, sensor nodes are commonly deployed in potentially hostile environments, which requires additional protection in comparison to traditional computing systems. On the other side, the capabilities of sensor nodes in terms of computing power, memory, and available energy are severely limited, which makes it hard to adapt existing security solutions. In this paper, we examine different options for providing confidentiality and message authentication to sensor network communication. More specifically, we examine four modern block cipher modes of operation regarding their applicability in sensor networks. These are the offset codebook mode (OCB), the counter cipher feedback with header mode (CCFB+H), the EAX mode, and the Galois/Counter mode (GCM). Our practical evaluation targets the MICAz sensor node and accounts for the typically small packet size of sensor network traffic. Our results indicate that the CCFB+H mode is the best choice for a large range of applications.
Gernot R. Bauer, Philipp Potisk, Stefan Tillich
PDP3
2009 Energy-Efficient Implementation of ECDH Key Exchange for Wireless Sensor Networks
Christian Lederer, Roland Mader, Manuel Koschuch, Johann Großschädl, Alexander Szekely, Stefan Tillich
WISTP6
2008 Attacking State-of-the-Art Software Countermeasures-A Case Study for AES
Stefan Tillich, Christoph Herbst
CHES1
2008 Boosting AES Performance on a Tiny Processor Core
Stefan Tillich, Christoph Herbst
CT-RSA1
2008 General security concept for embedded P2P systems
abstract
The importance of peer-to-peer (P2P) systems in real-world applications has grown significantly over the last years. Although P2P systems have found their way into many fields of application, the lack of an adequate general security concept, research for specific security mechanisms and implementati
Stefan Kraxberger, Udo Payer, Stefan Tillich
MobiQuitous3
2007 Protecting AES Software Implementations on 32-Bit Processors Against Power Analysis
Stefan Tillich, Christoph Herbst, Stefan Mangard
ACNS1
2007 The energy cost of cryptographic key establishment in wireless sensor networks
abstract
Wireless sensor nodes generally face serious limitations in terms of computational power, energy supply, and network bandwidth. Therefore, the implementation of effective and secure techniques for setting up a shared secret key between sensor nodes is a challenging task. In this paper we analyze and compare the energy cost of two different protocols for authenticated key establishment. The first protocol employs a lightweight variant of the Kerberos key transport mechanism with 128-bit AES encryption. The second protocol is based on ECMQV, an authenticated version of the elliptic curve Diffie-Hellman key exchange, and uses a 256-bit prime field GF(p) as underlying algebraic structure. We evaluate the energy cost of both protocols on a Rockwell WINS node equipped with a 133 MHz Strong ARM processor and a 100 kbit/s radio module. The evaluation considers both the processor's energy consumption for calculating cryptographic primitives and the energy cost of radio communication for different transmit power levels. Our simulation results show that the ECMQV key exchange consumes up to twice as much energy as Kerberos-like key transport.
Johann Großschädl, Alexander Szekely, Stefan Tillich
AsiaCCS3
2007 Power Analysis Resistant AES Implementation with Instruction Set Extensions
Stefan Tillich, Johann Großschädl
CHES1
2007 Energy evaluation of software implementations of block ciphers under memory constraints
Johann Großschädl, Stefan Tillich, Christian Rechberger, Michael Hofmann 0007, Marcel Medwed
DATE2
2007 Performance Evaluation of Instruction Set Extensions for Long Integer Modular Arithmetic on a SPARC V8 Processor
abstract
Many important algorithms for public-key cryptography rely on computation-intensive arithmetic operations like modular exponentiation on very long integers, typically in the range of 512 and 2048 bits. Modular exponentiation is generally realized through a sequence of modular multiplications and spends the majority of execution time in simple inner loops. Speeding up these performance-critical inner loop operations with custom instructions has, therefore, a significant impact on the total execution time of public-key cryptosystems. In this paper we analyze the performance of instruction set extensions for long integer arithmetic on a SPARC V8 processor. We discuss various implementation options and optimization opportunities for both modular multiplication and exponentiation. In particular, we introduce a partial loop unrolling (PLU) technique for modular multiplication which allows to achieve large performance gains at the cost of a moderate increase in code size, while maintaining the full flexibility of a "rolled-loop" implementation. In addition, we study window methods for modular exponentiation and analyze their impact on performance and memory requirements. Our experimental results, obtained with an FPGA prototype of the LEON-2 SPARC V8 core, show that a full 1024-bit modular exponentiation can be performed in about 12.5 ldr 106clock cycles, which is a reasonable value for embedded devices like smart cards or sensor nodes.
Johann Großschädl, Stefan Tillich, Alexander Szekely
DSD2
2007 VLSI Implementation of a Functional Unit to Accelerate ECC and AES on 32-Bit Processors
Stefan Tillich, Johann Großschädl
WAIFI1
2006 Hardware/Software Co-design of Elliptic Curve Cryptography on an 8051 Microcontroller
Manuel Koschuch, Joachim Lechner, Andreas Weitzer, Johann Großschädl, Alexander Szekely, Stefan Tillich, Johannes Wolkerstorfer
CHES6
2006 Instruction Set Extensions for Efficient AES Implementation on 32-bit Processors
Stefan Tillich, Johann Großschädl
CHES1
2006 Practical Second-Order DPA Attacks for Masked Smart Card Implementations of Block Ciphers
Elisabeth Oswald, Stefan Mangard, Christoph Herbst, Stefan Tillich
CT-RSA4
2006 Combining algorithm exploration with instruction set design: a case study in elliptic curve cryptography
abstract
In recent years, processor customization has matured to become a trusted way of achieving high performance with limited cost/energy in embedded applications. In particular, instruction set extensions (ISEs) have been proven very effective in many cases. A large body of work exists today on creating tools that can select efficient ISEs given an application source code: ISE automation is crucial for increasing the productivity of design teams. In this paper, we show that an additional motivation for automating the ISE process is to facilitate algorithm exploration: the availability of ISE can have a dramatic impact on the performance of different algorithmic choices to implement identical or equivalent functionality. System designers need fast feedbacks on the ISE-ability of various algorithmic flavors. We use a case study in elliptic curve (EC) cryptography to exemplify the following contributions: (I) ISE can reverse the relative performance of different algorithms for one and the same operation, and (2) automatic ISE, even without predicting speed-ups as precisely as detailed simulation can, is able to show exactly the trends that the designer should follow
Johann Großschädl, Paolo Ienne, Laura Pozzi 0001, Stefan Tillich, Ajay Kumar Verma
DATE4
2005 Energy-Efficient Software Implementation of Long Integer Modular Arithmetic
Johann Großschädl, Roberto Maria Avanzi, Erkay Savas, Stefan Tillich
CHES4
2005 Accelerating AES Using Instruction Set Extensions for Elliptic Curve Cryptography
Stefan Tillich, Johann Großschädl
ICCSA (2)1