Eurocrypt (or EUROCRYPT) is a conference for cryptography research. The full name of the conference is now the Annual International Conference on theâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Phong Q. Nguyen, Elisabeth Oswald, Gerhard Goos, Juris Hartmanis, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2014

The difficulty of computing discrete logarithms in fields Fqk depends on the relative sizes of k and q. Until recently all theâ€¦Â (More)

Is this relevant?

2013

2013

- Thomas Johansson, Phong Q. Nguyen, Gerhard Goos, Juris Hartmanis, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2013

We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps inâ€¦Â (More)

Is this relevant?

2012

2012

- Gerhard Goos, Juris Hartmanis, Jan van Leeuwen, David Pointcheval, Thomas Johansson
- Lecture Notes in Computer Science
- 2012

Cryptology and computers have a long common history; in fact, some of the early computers were created as cryptanalytic toolsâ€¦Â (More)

Is this relevant?

2009

2009

- Antoine Joux, Gerhard Goos, Juris Hartmanis, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2009

The existence of encryption and commitment schemes secure<lb>under selective opening attack (SOA) has remained open despiteâ€¦Â (More)

Is this relevant?

2004

2004

- Gerhard Goos, Juris Hartmanis, Jan van Leeuwen, Christian Cachin, Jan Camenisch
- Lecture Notes in Computer Science
- 2004

We consider the problem of computing the intersection of<lb>private datasets of two parties, where the datasets contain lists ofâ€¦Â (More)

Is this relevant?

2002

2002

- J. van Leeuwen, Lars Knudsen, Jan van Leeuwen, Lars R. Knudsen
- Lecture Notes in Computer Science
- 2002

We show that the decisional version of the Ko-Lee assumption for braid groups put forward by Lee, Lee and Hahn at Crypto 2001 isâ€¦Â (More)

Is this relevant?

2001

2001

- Craig Gentry, Jakob Jonsson, Jacques Stern, Michael Szydlo
- ASIACRYPT
- 2001

In 1996, a new cryptosystem called NTRU was introduced, related to the hardness of finding short vectors in specific lattices. Atâ€¦Â (More)

Is this relevant?

2001

2001

- J. van Leeuwen, Birgit Pfitzmann, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2001

In this paper we present an algorithm for counting points on elliptic curves over a finite field Fpn of small characteristicâ€¦Â (More)

Is this relevant?

1995

1995

- Louis C. Guillou, Jean-Jacques Quisquater
- Lecture Notes in Computer Science
- 1995

We introduce algorithms for lattice basis reduction that are improvements of the famous L3-algorithm. If a random L3-reducedâ€¦Â (More)

Is this relevant?

1991

1991

- Wilfried Brauer, David Gries, Josef Stoer, D. W. Davies
- Lecture Notes in Computer Science
- 1991

In [1,2] we introduced the notion of differential cryptanalysis and described its application to DES[8] and several of itsâ€¦Â (More)

Is this relevant?