J. Seifert

Publications
Influence

Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)

J. Blömer, J. Seifert
Computer Science
Financial Cryptography
27 January 2003

We present an implementation independent attack as well as attacks on several implementations of AES aimed at making AES timing analysis secure. Expand

On the power of simple branch prediction analysis

O. Aciiçmez, Ç. K. Koç, J. Seifert
Computer Science
ASIACCS '07
20 March 2007

We prove that a carefully written spy-process running simultaneously with an RSA-process, is able to collect during one single RSA signing execution almost all of the secret key bits. Expand

Advances on Access-Driven Cache Attacks on AES

M. Neve, J. Seifert
Computer Science
Selected Areas in Cryptography
17 August 2006

An access-driven attack is a class of cache-based side channel analysis. Expand

Cloning Physically Unclonable Functions

C. Helfmeier, C. Boit, Dmitry Nedospasov, J. Seifert
Computer Science
IEEE International Symposium on Hardware-Oriented…
2 June 2013

This work demonstrates that SRAM PUFs are not well suited as PUFs, as they do not meet several requirements that constitute an ideal PUF. Expand

Sign Change Fault Attacks on Elliptic Curve Cryptosystems

J. Blömer, M. Otto, J. Seifert
Computer Science
FDTC
10 October 2006

We present a new type of fault attacks on elliptic curve scalar multiplications: Sign Change Attacks. Expand

A new CRT-RSA algorithm secure against bellcore attacks

J. Blömer, M. Otto, J. Seifert
Computer Science
CCS '03
27 October 2003

In this paper we describe a new algorithm to prevent fault attacks on RSA signature algorithms using the Chinese Remainder Theorem (CRT-RSA). Expand

Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors

Oded Goldreich, Daniele Micciancio, S. Safra, J. Seifert
Mathematics, Computer Science
Electron. Colloquium Comput. Complex.
30 July 1999

We show that given oracle access to a subroutine which returns approximate closest vectors in a lattice, one may find in polynomial time approximate shortest vectors in the lattice. Expand

New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures

O. Aciiçmez, Shay Gueron, J. Seifert
Computer Science
IMACC
18 December 2007

We present a new and yet unforeseen side channel attack that is enabled by the recently published Simple Branch Prediction Analysis (SBPA) which is another type of MicroArchitectural Analysis. Expand

Parallel scalar multiplication on general elliptic curves over Fp hedged against Non-Differential Side-Channel Attacks

W. Fischer, C. Giraud, Erik Woodward Knudsen, J. Seifert
Mathematics, Computer Science
IACR Cryptol. ePrint Arch.
2002

For speeding up elliptic curve scalar multiplication and making it secure against sidechannel attacks such as timing or power analysis, various methods have been proposed using speci cally chosen elliptic curves. Expand

Secrecy Analysis in Protocol Composition Logic

Arnab Roy, A. Datta, A. Derek, J. Mitchell, J. Seifert
Computer Science
ASIAN
6 December 2006

Extending a compositional protocol logic with an induction rule for secrecy, we prove soundness for a conventional symbolic protocol execution model, adapt and extend previous composition theorems, and illustrate the logic by proving properties of two key agreement protocols. Expand

Recommended Authors