Results 1  10
of
101,973
Efficient algorithms for pairingbased cryptosystems
, 2002
"... Abstract. We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in ..."
Abstract

Cited by 361 (25 self)
 Add to MetaCart
Abstract. We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA
LEFTTORIGHT BINARY SIGNEDDIGIT RECODING FOR ELLIPTIC CURVE CRYPTOGRAPHY
"... In this paper we present a new lefttoright (i.e., from the most significant bit to the least significant bit) algorithm to compute the binary signeddigit representations of two integers g and h such that their joint weight is optimal. In [1] Solinas left this as an open problem. Such an algorithm ..."
Abstract
 Add to MetaCart
In this paper we present a new lefttoright (i.e., from the most significant bit to the least significant bit) algorithm to compute the binary signeddigit representations of two integers g and h such that their joint weight is optimal. In [1] Solinas left this as an open problem
Spa resistant lefttoright integer recodings
 In Selected Areas in cryptography 2005
, 2006
"... Abstract. We present two lefttoright integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a simple power analysis resistant implementation of a groupbased cryptosystem without using unified formulas or i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We present two lefttoright integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a simple power analysis resistant implementation of a groupbased cryptosystem without using unified formulas
1Reviewing HighRadix SignedDigit Adders
"... Abstract—Traditionally higher radix values of the form β = 2r have been employed for recoding of multipliers, and for determining quotient and rootdigits in iterative division and square root algorithms, usually only for quite moderate values of r, like 2 or 3. For fast additions, in particular fo ..."
Abstract
 Add to MetaCart
Abstract—Traditionally higher radix values of the form β = 2r have been employed for recoding of multipliers, and for determining quotient and rootdigits in iterative division and square root algorithms, usually only for quite moderate values of r, like 2 or 3. For fast additions, in particular
A public key cryptosystem and a signature scheme based on discrete logarithms
 Adv. in Cryptology, SpringerVerlag
, 1985
"... AbstractA new signature scheme is proposed, together with an implementation of the DiffieHellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields. I. ..."
Abstract

Cited by 1520 (0 self)
 Add to MetaCart
AbstractA new signature scheme is proposed, together with an implementation of the DiffieHellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields. I.
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
Higher Radix Squaring Operations Employing LefttoRight Dual Recoding
"... We introduce a novel lefttoright leading digit first dual recoding of an operand for the purpose of designing the squaring operation on that operand. Our dual recoding yields an array of nonnegative partial squares of size essentially one half that of a comparable multiplier partial product array ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce a novel lefttoright leading digit first dual recoding of an operand for the purpose of designing the squaring operation on that operand. Our dual recoding yields an array of nonnegative partial squares of size essentially one half that of a comparable multiplier partial product
A Simple LefttoRight Algorithm for the Computation of the
, 2006
"... We present a simple algorithm for computing the arithmetic weight of an integer with respect to a given radix r 2. The arithmetic weight of n is the minimum number of nonzero digits in any signed radixr representation of n. This algorithm leads to a new family of minimal weight signed radixr ..."
Abstract
 Add to MetaCart
We present a simple algorithm for computing the arithmetic weight of an integer with respect to a given radix r 2. The arithmetic weight of n is the minimum number of nonzero digits in any signed radixr representation of n. This algorithm leads to a new family of minimal weight signed radixr
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Results 1  10
of
101,973