1769 search results - page 103 / 354 » Cryptography |
133
click to vote
GMP
2003
IEEE
15 years 8 months ago
2003
IEEE
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
125
click to vote
FSE
2003
Springer
15 years 8 months ago
2003
Springer
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
121
click to vote
ACISP
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA probl...
129
click to vote
PACT
2001
Springer
15 years 7 months ago
2001
Springer
We introduce the νSPI-calculus that strengthens the notion of “perfect symmetric cryptography” of the spi-calculus by taking time into account. This involves defining an oper...
100
click to vote
ACSAC
1999
IEEE
15 years 7 months ago
1999
IEEE
Mainly for scalability reasons, many cryptographic security protocols make use of public key cryptography and require the existence of a corresponding public key infrastructure (P...