A structural comparison of the computational difficulty of breaking discrete log cryptosystems

Kouichi Sakurai, Hiroki Shizuya

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

The complexity of breaking cryptosystems of which security is based on the discrete logarithm problem is explored. The cryptosystems mainly discussed are the Diffie-Hellman key exchange scheme (DH), the Bellare-Micali noninteractive oblivious transfer scheme (EM), the ElGamal public-key cryptosystem (EG), the Okamoto conference-key sharing scheme (CONF), and the Shamir 3-pass key-transmission scheme (3PASS). The obtained relation among these cryptosystems is that 3 PASS < CONF < EG =£" BM s DH, where <JJdenotes the polynomial-time functionally many-to-one reducibility, i.e., a function version of the <£ -reducibility. We further give some condition in which these algorithms have equivalent difficulty. One of such conditions suggest another advantage of the discrete logarithm associated with ordinary elliptic curves.

Original languageEnglish
Pages (from-to)29-43
Number of pages15
JournalJournal of Cryptology
Volume11
Issue number1
DOIs
Publication statusPublished - Jan 1 1998

Fingerprint

Cryptosystem
Cryptography
Reducibility
Many to one
Oblivious Transfer
Discrete Logarithm Problem
Discrete Logarithm
Key Exchange
Public-key Cryptosystem
Diffie-Hellman
Elliptic Curves
Polynomial time
Sharing
Polynomials

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Applied Mathematics

Cite this

A structural comparison of the computational difficulty of breaking discrete log cryptosystems. / Sakurai, Kouichi; Shizuya, Hiroki.

In: Journal of Cryptology, Vol. 11, No. 1, 01.01.1998, p. 29-43.

Research output: Contribution to journalArticle

@article{4e8afde363ee484d840c6ae7fd5df993,
title = "A structural comparison of the computational difficulty of breaking discrete log cryptosystems",
abstract = "The complexity of breaking cryptosystems of which security is based on the discrete logarithm problem is explored. The cryptosystems mainly discussed are the Diffie-Hellman key exchange scheme (DH), the Bellare-Micali noninteractive oblivious transfer scheme (EM), the ElGamal public-key cryptosystem (EG), the Okamoto conference-key sharing scheme (CONF), and the Shamir 3-pass key-transmission scheme (3PASS). The obtained relation among these cryptosystems is that 3 PASS < CONF < EG =£{"} BM s DH, where <JJdenotes the polynomial-time functionally many-to-one reducibility, i.e., a function version of the <£ -reducibility. We further give some condition in which these algorithms have equivalent difficulty. One of such conditions suggest another advantage of the discrete logarithm associated with ordinary elliptic curves.",
author = "Kouichi Sakurai and Hiroki Shizuya",
year = "1998",
month = "1",
day = "1",
doi = "10.1007/s001459900033",
language = "English",
volume = "11",
pages = "29--43",
journal = "Journal of Cryptology",
issn = "0933-2790",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - A structural comparison of the computational difficulty of breaking discrete log cryptosystems

AU - Sakurai, Kouichi

AU - Shizuya, Hiroki

PY - 1998/1/1

Y1 - 1998/1/1

N2 - The complexity of breaking cryptosystems of which security is based on the discrete logarithm problem is explored. The cryptosystems mainly discussed are the Diffie-Hellman key exchange scheme (DH), the Bellare-Micali noninteractive oblivious transfer scheme (EM), the ElGamal public-key cryptosystem (EG), the Okamoto conference-key sharing scheme (CONF), and the Shamir 3-pass key-transmission scheme (3PASS). The obtained relation among these cryptosystems is that 3 PASS < CONF < EG =£" BM s DH, where <JJdenotes the polynomial-time functionally many-to-one reducibility, i.e., a function version of the <£ -reducibility. We further give some condition in which these algorithms have equivalent difficulty. One of such conditions suggest another advantage of the discrete logarithm associated with ordinary elliptic curves.

AB - The complexity of breaking cryptosystems of which security is based on the discrete logarithm problem is explored. The cryptosystems mainly discussed are the Diffie-Hellman key exchange scheme (DH), the Bellare-Micali noninteractive oblivious transfer scheme (EM), the ElGamal public-key cryptosystem (EG), the Okamoto conference-key sharing scheme (CONF), and the Shamir 3-pass key-transmission scheme (3PASS). The obtained relation among these cryptosystems is that 3 PASS < CONF < EG =£" BM s DH, where <JJdenotes the polynomial-time functionally many-to-one reducibility, i.e., a function version of the <£ -reducibility. We further give some condition in which these algorithms have equivalent difficulty. One of such conditions suggest another advantage of the discrete logarithm associated with ordinary elliptic curves.

UR - http://www.scopus.com/inward/record.url?scp=0003610767&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0003610767&partnerID=8YFLogxK

U2 - 10.1007/s001459900033

DO - 10.1007/s001459900033

M3 - Article

VL - 11

SP - 29

EP - 43

JO - Journal of Cryptology

T2 - Journal of Cryptology

JF - Journal of Cryptology

SN - 0933-2790

IS - 1

ER -