The security and reliability of a class of public-key cryptosystems against attacks by unauthorized parties, who had acquired partial knowledge of one or more of the private key components and/or of the message, were discussed. The standard statistical mechanical methods of dealing with diluted spin systems with replica symmetric considerations were analyzed. The dynamical transition which defined decryption success in practical situation was studied. The phase diagrams which showed the dynamical threshold as a function of the partial acquired knowledge of the private key were also presented
[[abstract]]It is shown how a chosen-public-key attack can compromise the ID-based cryptosystem of S...
International audienceKabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme ba...
We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy inst...
Public-key cryptosystems built on quasi-cyclic (QC) low-density parity-check and moderate-density pa...
In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-chec...
Abstract. We present attacks against the McEliece Public-Key Cryptosystem, the Atjai-Dwork Public-Ke...
Part I: Theory Provable security is an important goal in the design of public-key cryptosystems. For...
Rank metric is a very promising research direction for code-based cryptography. In fact, thanks to t...
Rank metric is a very promising research direction for code-based cryptography. In fact, thanks to t...
This paper presents three methods for strengthening public key cryptosystems in suchaway that they b...
Guo et al. recently presented a reaction attack against the QC-MDPC McEliece cryptosystem. Their att...
In this paper we present a method of attacking public-key cryptosystems (PKCs) on tamper resistant d...
AbstractIn this paper, the authors give the definitions of a coprime sequence and a lever function, ...
Abstract. The main purpose of this paper is to show that public key encryption can be secure against...
[[abstract]]It is shown how a chosen-public-key attack can compromise the ID-based cryptosystem of S...
International audienceKabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme ba...
We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy inst...
Public-key cryptosystems built on quasi-cyclic (QC) low-density parity-check and moderate-density pa...
In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-chec...
Abstract. We present attacks against the McEliece Public-Key Cryptosystem, the Atjai-Dwork Public-Ke...
Part I: Theory Provable security is an important goal in the design of public-key cryptosystems. For...
Rank metric is a very promising research direction for code-based cryptography. In fact, thanks to t...
Rank metric is a very promising research direction for code-based cryptography. In fact, thanks to t...
This paper presents three methods for strengthening public key cryptosystems in suchaway that they b...
Guo et al. recently presented a reaction attack against the QC-MDPC McEliece cryptosystem. Their att...
In this paper we present a method of attacking public-key cryptosystems (PKCs) on tamper resistant d...
AbstractIn this paper, the authors give the definitions of a coprime sequence and a lever function, ...
Abstract. The main purpose of this paper is to show that public key encryption can be secure against...
[[abstract]]It is shown how a chosen-public-key attack can compromise the ID-based cryptosystem of S...
International audienceKabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme ba...
We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy inst...