Add to ORKGThis thesis contains work on two problems in algorithmic number theory. The first problem is to give an algorithm that constructs a rational point on an elliptic curve over a finite field. A fast and easy randomized algorithm has existed for some time. We prove that in the case where the finite field has characteristic 2, there is a deterministic algorithm with the same asymptotic running time as the existing randomized algorithm
How many rational points are there on a random algebraic curve of large genus g over a given finite ...
We solve two computational problems concerning plane algebraic curves over finite fields: generating...
AbstractMany problems such as primality testing can be solved efficiently using a source of independ...
This thesis contains work on two problems in algorithmic number theory. The first problem is to give...
In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in po...
In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in po...
Abstract. One of the main difficulties for implementing cryptographic schemes based on elliptic curv...
Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms...
Abstract. The paper gives a formula for the probability that a randomly chosen elliptic curve over a...
International audienceOne of the main difficulties for implementing cryptographic schemes based on ...
An introduction on random numbers, their history and applications is given, along with explanations ...
Abstract. Randomization techniques play an important role in the pro-tection of cryptosystems agains...
We give a brief survey of several recently suggested constructions of generating sequences of pseudo...
Randomization techniques play an important role in the protection of cryptosystems against implement...
Randomization techniques play an important role in the protection of cryptosystems against implement...
How many rational points are there on a random algebraic curve of large genus g over a given finite ...
We solve two computational problems concerning plane algebraic curves over finite fields: generating...
AbstractMany problems such as primality testing can be solved efficiently using a source of independ...
This thesis contains work on two problems in algorithmic number theory. The first problem is to give...
In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in po...
In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in po...
Abstract. One of the main difficulties for implementing cryptographic schemes based on elliptic curv...
Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms...
Abstract. The paper gives a formula for the probability that a randomly chosen elliptic curve over a...
International audienceOne of the main difficulties for implementing cryptographic schemes based on ...
An introduction on random numbers, their history and applications is given, along with explanations ...
Abstract. Randomization techniques play an important role in the pro-tection of cryptosystems agains...
We give a brief survey of several recently suggested constructions of generating sequences of pseudo...
Randomization techniques play an important role in the protection of cryptosystems against implement...
Randomization techniques play an important role in the protection of cryptosystems against implement...
How many rational points are there on a random algebraic curve of large genus g over a given finite ...
We solve two computational problems concerning plane algebraic curves over finite fields: generating...
AbstractMany problems such as primality testing can be solved efficiently using a source of independ...