93 search results - page 16 / 19 » On Some Cryptographic Properties of Rijndael |
CRYPTO
2005
Springer
14 years 2 months ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
LATINCRYPT
2010
13 years 7 months ago
2010
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
SACRYPT
2007
Springer
14 years 2 months ago
2007
Springer
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
IAT
2006
IEEE
14 years 2 months ago
2006
IEEE
Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosin...
PKC
2000
Springer
14 years 3 days ago
2000
Springer
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...