Sciweavers

127 search results - page 6 / 26
» On Cryptographic Schemes Based on Discrete Logarithms and Fa...
Sort
View
DCC
2000
IEEE
13 years 6 months ago
Discrete Logarithms: The Past and the Future
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
Andrew M. Odlyzko
INFORMATICALT
2007
104views more  INFORMATICALT 2007»
13 years 7 months ago
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...
IJNSEC
2006
107views more  IJNSEC 2006»
13 years 7 months ago
ID-based Signcryption Scheme with (t, n) Shared Unsigncryption
An identity-based signcryption scheme with (t, n) shared unsigncryption is proposed, which is the integration of the signcryption scheme, the (t, n) threshold scheme and zero know...
Fagen Li, Xiangjun Xin, Yupu Hu
ISCI
2008
104views more  ISCI 2008»
13 years 6 months ago
Unconditionally secure cryptosystems based on quantum cryptography
Most modern cryptographic studies design cryptosystems and algorithms using mathematical concepts. In designing and analyzing cryptosystems and protocols, mathematical concepts ar...
Yu-Fang Chung, Zhen Yu Wu, Tzer-Shyong Chen
IJNSEC
2007
131views more  IJNSEC 2007»
13 years 7 months ago
On the Security of Huang-Chang Multi-signature Schemes
Recently, based on RSA and discrete logarithm with composite modulus, Huang and Chang proposed two multisignature schemes with distinguished signing authority and claimed that the...
Jianhong Zhang, Wei Zou