Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: discrete logarithm problem

Sortuj według:

Ogranicz wyniki do:

Chameleon Hash Functions and One-Time Signature Schemes from Inner Automorphism Groups

Pan P., Wang L., Yang Y., Gan Y., Wang L., Xu C.

Fundamenta Informaticae

2013

Vol. 126, nr 1

103--119

In this paper, we build a family of chameleon hash functions and strongly unforgeable one-time signature schemes based on the intractability assumption of the discrete logarithm problem (DLP) over inner automorphism groups. Since the DLP assumption over inner automorphism groups does not admit sub-exponential attacks, thus the sizes of the working parameters used in our constructions are shorten significantly. This leads to remarkable gains for our proposals both in running time and in storage space. In addition, as far as we know, this is the first time to build CHF and OTS based on noncommutative groups.

A Contribution to the Discrete Logarithm Problem

Paszkiewicz A.

Electronics and Telecommunications Quarterly

2009

Vol. 55, No 3

493-499

In this paper we consider a common, fundamental problem of all cryptographic schemes based on the discrete logarithm modulo a prime. This is the choice a base of the modular exponent function or other words a generator of a prime order multiplicative group. We construct a class of primes for which its least generators can be extremely large.

Eliptic Curve Based Threshold Proxy Signature Scheme with Known Signers

Pomykala J., Barabasz S.

Fundamenta Informaticae

2006

Vol. 69, nr 4

411-425

In the article we present a new (t,n) threshold proxy signature scheme with known signers. It is based on the elliptic curve cryptosystem whose security refers to the discrete logarithm problem (DLP) in the group E(Fp) of rational points of elliptic curve over the finite field. In comparision to similar schemes based on the RSA or DSS systems our solution requires application of significantly shorter cryptographic keys. The scheme is relatively simple in construction, has the property of unforgeability, non-repudation and admits the proactive security.