Publication

Selecting cryptographic key sizes

Related publications (54)

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.

Signatures for Multisource Network Coding

László Czap

We consider the problem of securing inter-ﬂow network coding with multiple sources. We present a practical homomorphic signature scheme that makes possible to verify network coded packets composed of data originating from diﬀerent sources. The multi-source ...

ArXiv2010

On the Use of the Negation Map in the Pollard Rho Method

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung

The negation map can be used to speed up the Pollard rho method to compute discrete logarithms in groups of elliptic curves over finite fields. It is well known that the random walks used by Pollard rho when combined with the negation map get trapped in fr ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Robert Granger

This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of

\mathbb{F}_{q^6}

, for

q \equiv 1 \bmod{6}

. Our result arises from considering the Weil restriction of scalars of this group from

\mathbb{F}_{q^6}

...

Springer Berlin Heidelberg2010

Adaptive Message Authentication for Vehicular Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Nikodin Ristanovic, Panagiotis Papadimitratos, Georgios Theodorakopoulos

Public key cryptography can introduce significant processing delays in vehicular communication platforms. This can lead to serious performance issues, especially in the case of multi-hop Inter-Vehicle Communication. In this paper we propose Adaptive Messag ...

Sheridan Printing2009

On the security of 1024-bit RSA and 160-bit elliptic curve cryptography

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Marcelo Kaihara

Meeting the requirements of NIST’s new cryptographic standard ‘Suite B Cryptography’ means phasing out usage of 1024-bit RSA and 160-bit Elliptic Curve Cryptography (ECC) by the year 2010. This write-up comments on the vulnerability of these systems to an ...

2009

GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Jun Luo

Abstract—Resource and cost constraints remain a challenge for wireless sensor network security. In this paper, we propose a new approach to protect confidentiality against a parasitic adversary, which seeks to exploit sensor networks by obtaining measureme ...

2008

Cryptography based on error correcting codes

Lorenz Minder

The idea to use error-correcting codes in order to construct public key cryptosystems was published in 1978 by McEliece [ME1978]. In his original construction, McEliece used Goppa codes, but various later publications suggested the use of different familie ...

EPFL2007

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

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

On Small Characteristic Algebraic Tori in Pairing-Based Cryptography

Robert Granger, Martijn Stam

The value of the Tate pairing on an elliptic curve over a finite field may be viewed as an element of an algebraic torus. Using this simple observation, we transfer techniques recently developed for torus-based cryptography to pairing-based cryptography, r ...

2006

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Robert Granger

This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of

\mathbb{F}_{q^6}

, for

q \equiv 1 \bmod{6}

. Our result arises from considering the Weil restriction of scalars of this group from

\mathbb{F}_{q^6}

...

Springer Berlin Heidelberg2010