Concept

Sexy prime

Related publications (9)

A spectral refinement of the Bergelson–Host–Kra decomposition and new multiple ergodic theorems

We investigate how spectral properties of a measure-preserving system (X, B, mu, T) are reflected in the multiple ergodic averages arising from that system. For certain sequences a :N -> N, we provide natural conditions on the spectrum sigma (T) such that, ...

2019

A PRACTICAL ANALYTIC METHOD FOR CALCULATING pi(x)

Thorsten Kleinjung

In this paper we give a description of a practical analytic method for the computation of pi(x), the number of prime numbers

American Mathematical Society2017

Primeless Factoring-Based Cryptography

Serge Vaudenay, Sonia Mihaela Bogos

Factoring-based 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 process ...

2013

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

Primality Testing

Kamal Tahiri Jouti

Since the discovery of the utility of the numbers, the human being tried to differentiate them. We decide between them according to whether they are even or odd. Or, according to the fact that they are prime or composite. A natural number n >1 is called a ...

2006

Digital Signature Schemes with Domain Parameters

Serge Vaudenay

Digital signature schemes often use domain parameters such as prime numbers or elliptic curves. They can be subject to security threats when they are not treated like public keys. In this paper we formalize the notion of "signature scheme with domain param ...

2004

We prove that for all local fields SLn is stable over n in terms of continuous bounded cohomology. We complement this by various computations in low degree, showing notably the vanishing of the third bounded cohomology of SLn(R) for all n. We link the corr ...

2004

Efficient generation of prime numbers

Serge Vaudenay

The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appearing during various cryptographic setups. Surprisingly, despite decades of in ...

2000

Implementation of a new primality test

Arjen Lenstra

An implementation of the Cohen-Lenstra version (see ibid., vol. 42, p.297-330, 1984) of the Adleman-Pomerance-Rumely primality test (see L.M. Adleman, C. Pomerance and R.S. Rumely, Ann. of Math., vol.117, p.173-206, 1983) is presented. Primality of prime n ...

American Mathematical Society1987

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.