Sciweavers

109 search results - page 5 / 22
» Some Attacks on the Bit-Search Generator
Sort
View
COMCOM
1999
91views more  COMCOM 1999»
14 years 9 months ago
Group-oriented undeniable signature schemes with a trusted center
Undeniable signature is an intriguing concept introduced by Chaum and Antwerpen at Crypto'89. In 1999, Lee and Hwang presented two group-oriented undeniable signature schemes ...
Narn-Yih Lee, Tzonelih Hwang
INDOCRYPT
2005
Springer
15 years 3 months ago
Completion Attacks and Weak Keys of Oleshchuk's Public Key Cryptosystem
This paper revisits a public key cryptosystem which is based on finite string-rewriting systems. We consider a new approach for cryptanalysis of such proposals—the so-called com...
Heiko Stamer
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
15 years 1 months ago
Collisions and Near-Collisions for Reduced-Round Tiger
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...
John Kelsey, Stefan Lucks
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
15 years 3 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
CCS
2007
ACM
15 years 3 months ago
Topological analysis of network attack vulnerability
: To understand overall vulnerability to network attack, one must consider attacker exploits not just in isolation, but also in combination. That is, one must analyze how low-level...
Sushil Jajodia