Sciweavers

PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 7 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
CAGD
2002
61views more  CAGD 2002»
13 years 9 months ago
Polynomial parametrization of curves without affine singularities
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial param...
Jaime Gutierrez, Rosario Rubio, Josef Schicho
CATS
2006
13 years 10 months ago
The Busy Beaver, the Placid Platypus and other Crazy Creatures
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
James Harland
ICDCSW
2000
IEEE
14 years 1 months ago
Games-Based Model Checking of Protocols: counting doesn't count
We introduce a technique that can be used to model the behaviour of protocols. In our model each process within a protocol belongs to a particular class. A set of rules governs th...
Tim Kempster, Colin Stirling, Peter Thanisch