209 search results - page 38 / 42 » Supersingular Curves in Cryptography |
ACMSE
2006
ACM
13 years 11 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
EUROCRYPT
1999
Springer
14 years 3 days ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. This paper reports record-setting performance for the ellipticcurve method of integer factorization: for example, 926.11 curves/second for ECM stage 1 with B1 = 8192 for ...
MOBISYS
2007
ACM
14 years 7 months ago
2007
ACM
We identify the security challenges facing a sensor network for wireless health monitoring, and propose an architecture called "SNAP" (Sensor Network for Assessment of P...