Sciweavers

402 search results - page 4 / 81
» Cryptosystems using Linear Groups
Sort
View
EUROCRYPT
2000
Springer
14 years 2 months ago
A NICE Cryptanalysis
We present a chosen-ciphertext attack against both NICE cryptosystems. These two cryptosystems are based on computations in the class group of non-maximal imaginary orders. More pr...
Éliane Jaulmes, Antoine Joux
IJNSEC
2006
132views more  IJNSEC 2006»
13 years 11 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma
IJNSEC
2008
103views more  IJNSEC 2008»
13 years 11 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao
ASIACRYPT
2000
Springer
14 years 3 months ago
Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
Abstract. In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies t...
Safuat Hamdy, Bodo Möller
SASN
2005
ACM
14 years 4 months ago
On the security of group communication schemes based on symmetric key cryptosystems
Many emerging applications in both wired and wireless networks, such as information dissemination and distributed collaboration in an adversarial environment, need support of secu...
Shouhuai Xu