4212 search results - page 41 / 843 » On Compressible Pairings and Their Computation |
122
click to vote
MFCS
2010
Springer
14 years 11 months ago
2010
Springer
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 ...
64
Voted
DCC
2007
IEEE
16 years 3 days ago
2007
IEEE
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...
116
Voted
IJNSEC
2008
15 years 16 days ago
2008
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
FDTC
2007
Springer
15 years 6 months ago
2007
Springer
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...
110
Voted
ECLIPSE
2004
ACM
15 years 6 months ago
2004
ACM
Pair programming requires two programmers working together at one computer. However, the trend toward globally distributed organizations makes long-distance collaboration necessar...