Sciweavers

4212 search results - page 41 / 843
» On Compressible Pairings and Their Computation
Sort
View
MFCS
2010
Springer
15 years 5 months ago
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
Gero Greiner, Riko Jacob
DCC
2007
IEEE
16 years 6 months ago
Golay complementary array pairs
Constructions and nonexistence conditions for multi-dimensional Golay complementary array pairs are reviewed. A construction for a d-dimensional Golay array pair from a (d + 1)-di...
Jonathan Jedwab, Matthew G. Parker
IJNSEC
2008
106views more  IJNSEC 2008»
15 years 6 months ago
Parallel Hardware Architectures for the Cryptographic Tate Pairing
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
Guido Marco Bertoni, Luca Breveglieri, Pasqualina ...
FDTC
2007
Springer
105views Cryptology» more  FDTC 2007»
16 years 29 days ago
Tate Pairing with Strong Fault Resiliency
We present a novel non-linear error coding framework which incorporates strong adversarial fault detection capabilities into identity based encryption schemes built using Tate pai...
Erdinç Öztürk, Gunnar Gaubatz, Be...
ECLIPSE
2004
ACM
16 years 6 days ago
Sangam: a distributed pair programming plug-in for Eclipse
Pair programming requires two programmers working together at one computer. However, the trend toward globally distributed organizations makes long-distance collaboration necessar...
Chih-Wei Ho, Somik Raha, Edward F. Gehringer, Laur...