Sciweavers

44 search results - page 6 / 9
» Implementing Cryptographic Pairings over Barreto-Naehrig Cur...
Sort
View
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 8 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
ASIACRYPT
2001
Springer
13 years 12 months ago
An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
We present an algorithm for counting points on superelliptic curves yr = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorit...
Pierrick Gaudry, Nicolas Gürel
CIS
2006
Springer
13 years 11 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
IJNSEC
2007
130views more  IJNSEC 2007»
13 years 7 months ago
An Attack on Libert et al.' s ID-based Undeniable Signature Scheme
In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. ...
Zichen Li, C. F. Chong, Lucas Chi Kwong Hui, Siu-M...
ENC
2004
IEEE
13 years 11 months ago
On the Hardware Design of an Elliptic Curve Cryptosystem
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
Miguel Morales-Sandoval, Claudia Feregrino Uribe