Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Nombre premier régulier

Publications associées (8)

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Thorsten Kleinjung, Robert Granger, Benjamin Pierre Charles Wesolowski

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

AMER MATHEMATICAL SOC2021

Four-Variable Expanders Over The Prime Fields

Van Thang Pham, Adrian Claudiu Valculescu, Seyed Hossein Nassajianmojarrad

Let F-p be a prime field of order p > 2, and let A be a set in F-p with very small size in terms of p. In this note, we show that the number of distinct cubic distances determined by points in A x A satisfies vertical bar(A - A)(3) + (A - A)(3 vertical bar ...

American Mathematical Society (AMS)2018

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

Eva Bayer Fluckiger

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

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung

We describe a cell processor implementation of Pollard’s rho method to solve discrete logarithms in groups of elliptic curves over prime fields. The implementation was used on a cluster of PlayStation 3 game consoles to set a new record. We present in deta ...

2012

Invariant Higher-Order Variational Problems II

Tudor Ratiu, François Gay-Balmaz

Motivated by applications in computational anatomy, we consider a second-order problem in the calculus of variations on object manifolds that are acted upon by Lie groups of smooth invertible transformations. This problem leads to solution curves known as ...

Springer Verlag2012

Efficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields

Yusuf Leblebici

Elliptic curve cryptosystems (ECCs) are utilised as an alternative to traditional public-key cryptosystems, and are more suitable for resource-limited environments because of smaller parameter size. In this study, the authors carry out a thorough investiga ...

2010

Explicit construction of self-dual integral normal bases for the square-root of the inverse different

Erik Jarl Pickett

Let K be a finite extension of Q(p), let L/K be a finite abelian Galois extension of odd degree and let D-L be the valuation ring of L. We define A(L/K) to be the unique fractional D-L-ideal with square equal to the inverse different of L/K. For p an odd p ...

2009

A sectional characterization of the Dade group

Jacques Thévenaz, Serge Bouc

Let k be a field of characteristic p, let P be a finite p-group, where p is an odd prime, and let D(P) be the Dade group of endo-permutation kP-modules. It is known that D(P) is detected via deflation-restriction by the family of all sections of P which ar ...

2008