4212 search results - page 3 / 843 » On Compressible Pairings and Their Computation |
CRYPTO
2004
Springer
13 years 11 months ago
2004
Springer
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...
IWSEC
2007
Springer
13 years 11 months ago
2007
Springer
The hash function HAVAL is an Australian extension of well known Merkle-Damg˚ard hash functions such as MD4 and MD5. It has three variants, 3-, 4- and 5-pass HAVAL. On 3-pass HAVA...
ACISP
2004
Springer
13 years 9 months ago
2004
Springer
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been u...
TVLSI
2010
13 years 7 days ago
2010
Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memor...
APAL
2010
13 years 5 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...