Publications related to Moduli stack of elliptic curves

Hardness of Computing Individual Bits for One-way Functions on Elliptic Curves

Dimitar Petkov Jetchev, Alexandre Raphaël Duc

We prove that if one can predict any of the bits of the input to an elliptic curve based one-way function over a finite field, then we can invert the function. In particular, our result implies that if one can predict any of the bits of the input to a clas ...

Springer2012

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

Client-specific A-stack model for adult face verification across aging

Andrzej Drygajlo, Weifeng Li

The problem of time validity of biometricmodels has received only a marginal attention from researchers. In this paper, we propose to manage the aging influence on the adult face verification system by an A-stack age modeling technique, which uses the age ...

2011

Special Curve Patterns for Freeform Architecture

Bailin Deng

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

Vienna University of Technology2011

Adult Face Recognition in Score-Age-Quality Classification Space

Andrzej Drygajlo, Weifeng Li, Hui Qiu

Face verification in the simultaneous presence of age progression and changing face-image quality is an important problem that has not been widely addressed. In this paper, we study the problem by designing and evaluating a generalized Q-stack model, which ...

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

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Robert Granger

We show that for any elliptic curve

E(\mathbb{F}_{q^n})

, if an adversary has access to a Static Diffie-Hellman Problem (Static DHP) oracle, then by making

O(q^{1-\frac{1}{n+1}})

Static DHP oracle queries during an initial learning phase, for fixed $n>1 ...

Springer Berlin Heidelberg2010

On the Use of the Negation Map in the Pollard Rho Method

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung

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

Global And Local Feature Based Multi-Classifier A-Stack Model For Aging Face Identification

Andrzej Drygajlo, Weifeng Li

The problem of time validity of biometric models has received only a marginal attention from researchers. Actual and up-to-date at the time of their creation, extracted features and models relevant to a person's face may eventually become outdated, leading ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Robert Granger

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

2010

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

Moduli stack of elliptic curves

Graph Chatbot

Chat with Graph Search

Hardness of Computing Individual Bits for One-way Functions on Elliptic Curves

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

Client-specific A-stack model for adult face verification across aging

Special Curve Patterns for Freeform Architecture

Adult Face Recognition in Score-Age-Quality Classification Space

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

On the Use of the Negation Map in the Pollard Rho Method

Global And Local Feature Based Multi-Classifier A-Stack Model For Aging Face Identification

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

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

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

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Special Curve Patterns for Freeform Architecture

Adult Face Recognition in Score-Age-Quality Classification Space

On the Use of the Negation Map in the Pollard Rho Method

Global And Local Feature Based Multi-Classifier A-Stack Model For Aging Face Identification

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

Hardness of Computing Individual Bits for One-way Functions on Elliptic Curves

Client-specific A-stack model for adult face verification across aging