EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
In STOC 2000, Canetti, Goldreich, Goldwasser, and Micali put forward the strongest notion of zero-knowledge to date, resettable zero-knowledge (RZK) and implemented it in constant ...
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. The block ciphers MISTY1 and MISTY2 proposed by Matsui are based on the principle of provable security against differential and linear cryptanalysis. This paper presents...
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU pu...
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
We define a new mode of operation for block encryption which in addition to assuring confidentiality also assures message integrity. In contrast, previously for message integrity...
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
EUROCRYPT
2001
Springer
14 years 4 months ago
2001
Springer
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...