Sciweavers

15 search results - page 1 / 3
» Completion Attacks and Weak Keys of Oleshchuk's Public Key C...
Sort
View
INDOCRYPT
2005
Springer
13 years 11 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
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 5 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
FDTC
2008
Springer
144views Cryptology» more  FDTC 2008»
13 years 7 months ago
Comparative Analysis of Robust Fault Attack Resistant Architectures for Public and Private Cryptosystems
The adaptive and active nature of fault based sidechannel attacks along with the large arsenal of fault injection methods complicates the design of effective countermeasures. To o...
Konrad J. Kulikowski, Zhen Wang, Mark G. Karpovsky
JSS
2007
79views more  JSS 2007»
13 years 5 months ago
Security problems with improper implementations of improved FEA-M
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-d...
Shujun Li, Kwok-Tung Lo
CRYPTO
2006
Springer
108views Cryptology» more  CRYPTO 2006»
13 years 9 months ago
Inverting HFE Is Quasipolynomial
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
Louis Granboulan, Antoine Joux, Jacques Stern