Publication

Primality Testing

Related publications (42)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Some applications of the Weil-Barner explicit formula

Thorsten Kleinjung

The Weil-Barner explicit formula is applied to the prime counting function and to the problem of numerical partial verification of the Riemann hypothesis. ...

Wiley-V C H Verlag Gmbh2013

Upper bounds for the Euclidean minima of abelian fields of odd prime power conductor

Eva Bayer Fluckiger, Piotr Aleksander Maciak

The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime power conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p(r), where p is an odd prime number ...

Springer Verlag2013

Le foncteur de bi-ensembles des modules de p-permutation

Mélanie Baumann

Let k be an algebraically closed field of characteristic p, where p is a prime number or 0. Let G be a finite group and ppk(G) be the Grothendieck group of p-permutation kG-modules. If we tensor it with C, then Cppk becomes a C-linear biset functor. Recall ...

EPFL2012

Primeless Modular Cryptography (Extended Abstract)

Serge Vaudenay, Sonia Mihaela Bogos

Most of the known public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off proce ...

2012

Algebraic Divisibility Sequences Over Function Fields

Valéry Aurélien Mahé

In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields define ...

Australian Mathematical Society2012

Priming With Two Primes : The Interaction of Prime and Target Features

Julianne Grainger

In response priming, the reaction times to classify an object can be affected by previous exposure to a similar object. Most priming experiments focus on how primes prime a target. In the following set of experiments, we investigate how the interaction bet ...

2011

Polar codes for the m-user multiple access channels

Rajai Nasser

Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding decays exponentially with the square root of the block length. Although the ...

2011

On the Reduction of Points on Abelian Varieties and Tori

Antonella Perucca

Let G be the product of an abelian variety and a torus defined over a number field K. Let R-1, ..., R-n be points in G(K). Let l be a rational prime, and let a(1), ..., a(n) be nonnegative integers. Consider the set of primes p of K satisfying the followin ...

2011

2-Selmer groups and the Birch-Swinnerton-Dyer Conjecture for the congruent number curves

Robert Christopher Rhoades

We take an approach toward Counting the number of integers n for which the curve (n),: y(2) = x(3) - n(2)x has 2-Selmer groups of a given size. This question was also discussed in a pair of papers by Roger Heath-Brown. In contrast to earlier work, our anal ...

2009

Statistics Of Prime Divisors In Function Fields

Robert Christopher Rhoades

We show that the prime divisors of a random polynomial in F-q[t] are typically "Poisson distributed". This result is analogous to the result in Z of Granville [1]. Along the way, we use a sieve developed by Granville and Soundararajan [2] to give a simple ...

2009