36 search results - page 7 / 8 » A New Related Message Attack on RSA |
TCS
2002
13 years 6 months ago
2002
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
EUROCRYPT
2007
Springer
14 years 13 days ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Electronic mail services have become an important source of communication for millions of people all over the world. Due to this tremendous growth, there has been a significant in...
LICS
2006
IEEE
14 years 9 days ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...