Publication

Efficient Fail-Stop Signatures from the Factoring Assumption

Related publications (46)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Passive-Only Key Recovery Attacks on RC4

Serge Vaudenay, Martin Vuagnoux

We present several weaknesses in the key scheduling algorithm of RC4 when the secret key contains an initialization vector - a cryptographic scheme typically used by the WEP and WPA protocols to protect IEEE 802.11 wireless communications. First, we show h ...

Springer2007

On Small Degree Extension Fields in Cryptology

Robert Granger

This thesis studies the implications of using public key cryptographic primitives that are based in, or map to, the multiplicative group of finite fields with small extension degree. A central observation is that the multiplicative group of extension field ...

PhD dissertation, University of Bristol, UK, February 20062006

Cryptosystems and LLL

Thomas Baignères

Since the late 70’s, several public key cryptographic algorithms have been proposed. Diﬃe and Hellman ﬁrst came with this concept in 1976. Since that time, several other public key cryptosystems were invented, such as the well known RSA, ElGamal or Rabin c ...

2006

Discrete logarithm variants of VSH

Arjen Lenstra, Martijn Stam

Recent attacks on standardised hash functions such as SHA1 have reawakened interest in design strategies based on techniques common in provable security. In presenting the VSH hash function, a design based on RSA-like modular exponentiation, the authors in ...

2006

The Security of DSA and ECDSA

Serge Vaudenay

DSA and ECDSA are well established standards for digital signature based on the discrete logarithm problem. In this paper we survey known properties, certification issues regarding the public parameters, and security proofs. ECDSA also includes a standard ...

2003

High performance VLSI architectures implementing strong cryptographic primitives

Feth Allah Cherigui

The main topic of this thesis is related to the state of the art in designing cryptographic primitives from a hardware point of view. A special emphasis is dedicated to low-power/low-energy CMOS design. A set of solutions is proposed including an LFSR base ...

EPFL2002

The XTR public key system

Arjen Lenstra

This paper introduces the XTR public key system. XTR is based on a new method for representing elements of a subgroup of a multiplicative group of a finite field. Application of XTR in cryptographic protocols leads to substantial savings both in communicat ...

2000

Integer factoring

Arjen Lenstra

Using simple examples and informal discussions this article surveys the key ideas and major advances of the last quarter century in integer factorization. ...

2000

Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields

Arjen Lenstra

The author shows how to use cyclotomic polynomials to construct subgroups of multiplicative groups of finite fields that allow very efficient implementation of discrete logarithm based public key cryptosystems. Depending on the type of application and impl ...

1997

XMX: A Firmware-Oriented Block Cipher Based on Modular Multiplications

Serge Vaudenay, Jacques Stern

Presents xmx (xor-multiply-xor), a new symmetric block cipher optimized for public-key libraries and microcontrollers with arithmetic coprocessors. xmx has no S-boxes and uses only modular multiplications and XORs. The complete scheme can be described by a ...

1997