Sciweavers

79 search results - page 14 / 16
» Cryptosystems Based on Elliptic Curve Pairing
Sort
View
INDOCRYPT
2007
Springer
14 years 1 months ago
Solving Discrete Logarithms from Partial Knowledge of the Key
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
K. Gopalakrishnan, Nicolas Thériault, Chui ...
IJNSEC
2011
239views more  IJNSEC 2011»
13 years 2 months ago
Digital Signature Scheme with Message Recovery Using Knapsack-based ECC
Digital signature authentication scheme provides secure communication between two users. Digital signatures guarantee end-to-end message integrity and authentication information a...
R. Rajaram Ramasamy, M. Amutha Prabakar
ISCAS
2007
IEEE
129views Hardware» more  ISCAS 2007»
14 years 1 months ago
ECC Processor with Low Die Size for RFID Applications
Abstract— This paper presents the design of a special purpose processor with Elliptic Curve Digital Signature Algorithm (ECDSA) functionality. This digital signature generation d...
Franz Fürbass, Johannes Wolkerstorfer
ICONS
2008
IEEE
14 years 1 months ago
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
Giray Kömürcü, Erkay Savas
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
13 years 11 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