#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1999

2017

- This year (1)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Fabrice Boudot
- EUROCRYPT
- 2000

Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a specific interval. Up to now, such tools were either inefficient (too many bits to compute and to transmit) or inexact (i.e. proved membership to a much larger interval). This paper… (More)

- Fabrice Boudot, Berry Schoenmakers, Jacques Traoré
- Discrete Applied Mathematics
- 2001

We present a solution to the Tiercé problem, in which two players want to know whether they have backed the same combination (but neither player wants to disclose its combination to the other one). The problem is also known as the socialist millionaires’ problem, in which two millionaires want to know whether they happen to be equally rich. In our solution,… (More)

- Fabrice Boudot, Jacques Traoré
- ICICS
- 1999

- Fabrice Boudot
- CARDIS
- 2000

- Fabrice Boudot
- IACR Cryptology ePrint Archive
- 2017

The number field sieve is the best-known algorithm for factoring integers and solving the discrete logarithm problem in prime fields. In this paper, we present some new improvements to various steps of the number field sieve. We apply these improvements on the current 768bit discrete logarithm record and show that we are able to perform the overall… (More)

- ‹
- 1
- ›