Asiacrypt (also ASIACRYPT) is an important international conference for cryptography research. The full name of the conference is currently… (More)

(More)

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

2014

2014

- Palash Sarkar, Tetsu Iwata, Gerhard Goos, Juris Hartmanis, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2014

We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a… (More)

Is this relevant?

2014

2014

- Georg Fuchsbauer
- IACR Cryptology ePrint Archive
- 2014

We show how to compute an existential forgery after querying 4 signatures on chosen messages for a signature scheme presented at… (More)

Is this relevant?

Review

2013

Review

2013

- Kazue Sako, Palash Sarkar, Gerhard Goos, Juris Hartmanis, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2013

In the 1980s researchers were trying to understand the de-<lb>sign of the DES, and breaking it seemed impossible. Other block… (More)

Is this relevant?

Review

2012

Review

2012

- Gerhard Goos, Juris Hartmanis, Jan van Leeuwen, Xiaoyun Wang, Kazue Sako
- Lecture Notes in Computer Science
- 2012

While pairings were first introduced in cryptography as a tool to attack the discrete-log problem on certain elliptic curves… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Xinyi Huang, Willy Susilo, Yiming Mu, Futai Zhang
- CANS
- 2005

In traditional digital signature schemes, certificates signed by a trusted party are required to ensure the authenticity of the… (More)

Is this relevant?

2004

2004

- Gerhard Goos, Juris Hartmanis, Jan van Leeuwen, Pil Joong Lee
- Lecture Notes in Computer Science
- 2004

We study a recently proposed design approach of Feistel ci-<lb>phers which employs optimal diffusion mappings across multiple… (More)

Is this relevant?

2003

2003

- J. van Leeuwen, Chi Sung Laih, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2003

We propose asymmetric encryption schemes for which all ciphertexts are valid (which means here “reachable”: the encryption… (More)

Is this relevant?

2002

2002

- J. van Leeuwen, Yuliang Zheng, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2002

In [1], Bernstein proposed a circuit-based implementation of the matrix step of the number field sieve factorization algorithm… (More)

Is this relevant?

2000

2000

- J. van Leeuwen, Tatsuaki Okamoto, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2000

In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M… (More)

Is this relevant?

2000

2000

- Glenn Durfee, Phong Q. Nguyen
- ASIACRYPT
- 2000

At Asiacrypt ’99, Sun, Yang and Laih proposed three RSA variants with short secret exponent that resisted all known attacks… (More)

Is this relevant?