93 search results - page 12 / 19 » On Some Cryptographic Properties of Rijndael |
FSTTCS
2003
Springer
14 years 1 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
SEC
1993
13 years 10 months ago
1993
We describe public key cryptosystems and analyse the RSA cryptosystem, pointing out a weakness (already known) of the RSA system. We define Lucas functions and derive some of thei...
ISCI
2008
13 years 8 months ago
2008
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
ASIACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, calle...
CCS
2009
ACM
14 years 3 months ago
2009
ACM
Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation i...