Search Sciweavers | Sciweavers

16

INDOCRYPT
2007
Springer

140views Cryptology» more INDOCRYPT 2007»

Solving Discrete Logarithms from Partial Knowledge of the Key

13 years 11 months ago

Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...

K. Gopalakrishnan, Nicolas Thériault, Chui ...

claim paper

Read More »

25

click to vote

ACNS
2003
Springer

193views Cryptology» more ACNS 2003»

Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem

13 years 10 months ago

Download staff.aist.go.jp

Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...

Rui Zhang 0002, Hideki Imai

claim paper

Read More »

12

click to vote

INFORMATICALT
2007

104views more INFORMATICALT 2007»

Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level

13 years 5 months ago

Download www.mii.lt

The key agreement protocol based on inﬁnite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...

Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...

claim paper

Read More »

12

click to vote

AMC
2005

121views more AMC 2005»

A new key authentication scheme for cryptosystems based on discrete logarithms

13 years 5 months ago

Download msn.iecs.fcu.edu.tw

Key authentication is very important in private communication and data integrity. Recently, Peinado, Zhang and Kim showed that the LHL scheme is not secure, respectively. From pub...

Zuhua Shao

claim paper

Read More »

9

click to vote

TAAS
2008

62views more TAAS 2008»

Logarithmic keying

13 years 5 months ago