Sciweavers

76 search results - page 13 / 16
» Pipelining GF(P) Elliptic Curve Cryptography Computation
Sort
View
DCOSS
2006
Springer
15 years 1 months ago
Distributed User Access Control in Sensor Networks
User access control in sensor networks defines a process of granting user the access right to the information and resources. It is essential for the future real sensor network depl...
Haodong Wang, Qun Li
ACMSE
2006
ACM
15 years 1 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
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...
Selçuk Baktir, Berk Sunar
WISEC
2009
ACM
15 years 5 months ago
Securing network access in wireless sensor networks
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...
Kun Sun, An Liu, Roger Xu, Peng Ning, W. Douglas M...
CIS
2006
Springer
15 years 1 months ago
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosy...
Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 1 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith