Concept

Nombres premiers jumeaux

Publications associées (33)

Computational Aspects of Jacobians of Hyperelliptic Curves

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...

EPFL2016

Different combinations of forward and backward masking as well as interocular suppression have been used extensively to render stimuli invisible and to study those aspects of visual stimuli that are processed in the absence of conscious experience. Althoug ...

Frontiers Research Foundation2014

Two primes priming: Does feature integration occur before response activation?

Michael Herzog, Frank Scharnowski, Thomas Schmidt, Julianne Grainger

Responses to a target can be sped up or slowed down by a congruent or incongruent prime, respectively. Even though presentations are rapid, the prime and the target are thought to activate motor responses in strict sequence, with prime activation preceding ...

Association for Research in Vision and Ophthalmology2013

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

Generalised Mersenne Numbers Revisited

Robert Granger

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attrac ...

2013

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

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

By using the generalized Littlewood theorem about a contour integral involving the logarithm of an analytic function, we show how an infinite number of integral equalities involving integrals of the logarithm of the Riemann zeta-function and equivalent to ...

Springer US2012

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

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

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search