Publications associées à Nombre premier régulier

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Robert Granger, Thorsten Kleinjung, 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

Somatosensory-visual effects in visual biological motion perception

Olaf Blanke, Kim Do, Nathan Quentin Faivre, Manuel Mercier, Pierre Progin, Wenwen Chang

Social cognition is dependent on the ability to extract information from human stimuli. Of those, patterns of biological motion (BM) and in particular walking patterns of other humans, are prime examples. Although most often tested in isolation, BM outside ...

2020

Four-Variable Expanders Over The Prime Fields

Adrian Claudiu Valculescu, Van Thang Pham

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 ...

AMER MATHEMATICAL SOC2018

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24

Martino Borello

Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that gp is a fixed point free involution. If C is extremal of length a multiple of 24, all the involutions are fixed point free, except the Golay Code and ev ...

Institute of Electrical and Electronics Engineers2013

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

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

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Marcelo Kaihara

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

High-Performance Modular Multiplication on the Cell Processor

Joppe Willem Bos

This paper presents software implementation speed records for modular multiplication arithmetic on the synergistic processing elements of the Cell broadband engine (Cell) architecture. The focus is on moduli which are of special interest in elliptic curve ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Nombre premier régulier

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Somatosensory-visual effects in visual biological motion perception

Vienna's Höfe: How Housing Builds the Collective

Four-Variable Expanders Over The Prime Fields

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24

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

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

Invariant Higher-Order Variational Problems II

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

High-Performance Modular Multiplication on the Cell Processor

Graph Chatbot

Chattez avec Graph Search

Vienna's Höfe: How Housing Builds the Collective

Four-Variable Expanders Over The Prime Fields

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24

Somatosensory-visual effects in visual biological motion perception

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

Computation Of A 30750-Bit Binary Field Discrete Logarithm

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

Invariant Higher-Order Variational Problems II

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

High-Performance Modular Multiplication on the Cell Processor