Computation of the discrete logarithm on elliptic curves of trace one
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.
In recent years, freeform shapes are gaining more and more popularity in architecture. Such shapes are often challenging to manufacture, and have motivated an active research field called architectural geometry. In this thesis, we investigate patterns of s ...
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 ...
We show that for any elliptic curve E(Fqn), if an adversary has access to a Static Diffie-Hellman Problem (Static DHP) oracle, then by making O(q1−n+11) Static DHP oracle queries during an initial learning phase, for fixed $n>1 ...
The negation map can be used to speed up the Pollard rho method to compute discrete logarithms in groups of elliptic curves over finite fields. It is well known that the random walks used by Pollard rho when combined with the negation map get trapped in fr ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010
Recent work by Koblitz and Menezes has highlighted the existence, in some cases, of apparent separations between the hardness of breaking discrete logarithms in a particular group, and the hardness of solving in that group problems to which the security of ...
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 ...
We describe Curves+, a new nucleic acid conformational analysis program which is applicable to a wide range of nucleic acid structures, including those with up to four strands and with either canonical or modified bases and backbones. The program is algori ...
In 1999, Smart has shown how to solve in linear time ECDLP for elliptic curves of trace 1 defined over a prime finite field Fp, the so-called anomalous elliptic curves. In this article, we show how to construct such cryptographically weak curves for primes ...
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 ...
In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has the following surprising properties: The loop length in Miller’s algorithm can be up t ...
