555 search results - page 37 / 111 » From ABZ to Cryptography |
192
click to vote
CTRSA
2005
Springer
16 years 7 days ago
2005
Springer
For an integer w ≥ 2, a radix 2 representation is called a width-w nonadjacent form (w-NAF, for short) if each nonzero digit is an odd integer with absolute value less than 2w−...
176
click to vote
EUROCRYPT
2005
Springer
16 years 7 days ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
180
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
171
Voted
ACISP
2004
Springer
15 years 10 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...
206
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...