Sciweavers

52 search results - page 3 / 11
» Is There a Shortage of Primes for Cryptography
Sort
View
CMA
2010
183views more  CMA 2010»
13 years 4 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
14 years 1 months ago
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
David Freeman
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
14 years 1 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
SSC
2007
Springer
140views Cryptology» more  SSC 2007»
14 years 1 months ago
Existence of Modular Sonar Sequences of Twin-Prime Product Length
In this paper, we investigate the existence of modular sonar sequences of length v and mod v where v is a product of twin primes. For v = 3 · 5 = 15, we have found some old and ne...
Sung-Jun Yoon, Hong-Yeop Song
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
14 years 1 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz