Results 1  10
of
261,696
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
Some Analysis of Radixr Representations
 C. DOCHE, T. ICART, AND D.R. KOHEL
, 2005
"... We deal with the radixr representation used for the scalar multiplication of pairingbased cryptosystems with characteristic r. Our goal of this paper is to present some invariant properties about the signed radixr representation; (1) approximation formulae for the average significant length an ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We deal with the radixr representation used for the scalar multiplication of pairingbased cryptosystems with characteristic r. Our goal of this paper is to present some invariant properties about the signed radixr representation; (1) approximation formulae for the average significant length
Implementing pairingbased cryptosystems
 In 3rd International Workshop on Wireless Security Technologies IWWST2005
"... Abstract. In the last decade, pairingbased cryptography has been the most intensively studied subject in the cryptography field. Various optimization techniques have been developed to speed up the pairing computation. However, implementing a pairingbased cryptosystem in resource constrained devi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In the last decade, pairingbased cryptography has been the most intensively studied subject in the cryptography field. Various optimization techniques have been developed to speed up the pairing computation. However, implementing a pairingbased cryptosystem in resource constrained
New Multibase NonAdjacent Form Scalar Multiplication and its Application to Elliptic Curve Cryptosystems
, 2007
"... In this paper we present a new method for scalar multiplication that uses a generic multibase representation to reduce the number of required operations. Further, a multibase NAFlike algorithm that efficiently converts numbers to such representation without impacting memory or speed performance is ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
is developed and showed to be sublinear in terms of the number of nonzero terms. Additional representation reductions are discussed with the introduction of windowbased variants that use an extended set of precomputations. To realize the proposed multibase scalar multiplication with or without precomputations
The English noun phrase in its sentential aspect
, 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by afunctional element (i.e., \nonlexical " category) D, identi ed with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by In (ection), under assump ..."
Abstract

Cited by 509 (4 self)
 Add to MetaCart
This dissertation is a defense of the hypothesis that the noun phrase is headed by afunctional element (i.e., \nonlexical " category) D, identi ed with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by In (ection), under
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 498 (68 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 548 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity also carrying over in a similar fashion. Finally we study the significance of these results in a variety of combinatorial optimization problems including the general 01 integer programs, the maximum clique and maximum stable set problems in perfect graphs, the maximum k partite subgraph problem in graphs, and va...
Results 1  10
of
261,696