• Publications
  • Influence
On the Security of Oscillator-Based Random Number Generators
TLDR
A comprehensive statistical study of TRNGs based on the sampling of an oscillator subject to phase noise, which allows one to evaluate and control the main security parameters of such a random source, including its entropy rate and the biases of certain bit patterns. Expand
The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
TLDR
It is shown that applying the same strategy to elliptic curves gives Montgomery-like formulas in odd characteristic that are faster than the classical ones, and the formulas obtained are very efficient and may be useful in cryptographic applications. Expand
Attribute-Based Broadcast Encryption Scheme Made Efficient
TLDR
This paper describes a new broadcast encryption scheme for stateless receivers that allows one to select or revoke users by sending ciphertexts of linear size with respect to the number of attributes, which is in general far less than thenumber of users. Expand
Computing isogenies between abelian varieties
Abstract We describe an efficient algorithm for the computation of separable isogenies between abelian varieties represented in the coordinate system given by algebraic theta functions. Let A be anExpand
Efficient Pairing Computation with Theta Functions
TLDR
A new approach based on theta functions to compute Weil and Tate pairings on Kummer varieties and a nice algorithmic compatibility between some algebraic groups quotiented by the action of the automorphism − 1, where the ℤ-action can be computed efficiently with a Montgomery ladder type algorithm. Expand
Embedded Evaluation of Randomness in Oscillator Based Elementary TRNG
TLDR
This work proposes a simple precise method for measuring jitter that can be easily embedded in logic devices and shows that despite its simplicity and small area requirements, it enables the jitter to be measured with an error of less than 5i¾?%. Expand
A quasi quadratic time algorithm for hyperelliptic curve point counting
We describe an algorithm to compute the cardinality of Jacobians of ordinary hyperelliptic curves of small genus over finite fields $${\cal F}_{2^n}$$ with cost $$O(n^{2+o(1)})$$. This algorithm isExpand
The arithmetic of characteristic 2 Kummer surfaces
TLDR
It is shown that applying the same strategy to elliptic curves gives Montgomery-like formulas in odd characteristic that are of some interest, and the formulas obtained are very efficient and may be useful in cryptographic applications. Expand
Point Counting on Elliptic and Hyperelliptic Curves
Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time
TLDR
An algorithm which computes without any preprocessing the j-invariant of the canonical lift of E with the cost of O(log n) times the cost needed to compute a power of the lift of the Frobenius is proposed. Expand
...
1
2
3
4
...