A proposal of a new public key cryptosystem using matrices over a ring

Heajoung Yoo, Seokhie Hong, Sangjin Lee, Jong In Lim, Okyeon Yi, Maenghee Sung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

In this paper, we propose a new public key cryptosystem based on a probably subexponential time problem over a modular matrix ring. Our new cryptosystem is similar to GGH(O. Goldreich, S. Goldwasser, and S. Halevi) cryptosystem but the attack which breaks the GGH system is not applicable to ours. The security of the new construction is based on the computational difficulty of integer factorizations.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages41-48
Number of pages8
Volume1841
ISBN (Print)3540677429
DOIs
Publication statusPublished - 2000
Event5th Australasian Conference on Information Security and Privacy, ACISP 2000 - Brisbane, Australia
Duration: 2000 Jul 102000 Jul 12

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1841
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Australasian Conference on Information Security and Privacy, ACISP 2000
CountryAustralia
CityBrisbane
Period00/7/1000/7/12

Fingerprint

Public-key Cryptosystem
Cryptosystem
Cryptography
Integer Factorization
Ring
Matrix Ring
Attack
Factorization

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Yoo, H., Hong, S., Lee, S., Lim, J. I., Yi, O., & Sung, M. (2000). A proposal of a new public key cryptosystem using matrices over a ring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1841, pp. 41-48). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1841). Springer Verlag. https://doi.org/10.1007/10718964_4

A proposal of a new public key cryptosystem using matrices over a ring. / Yoo, Heajoung; Hong, Seokhie; Lee, Sangjin; Lim, Jong In; Yi, Okyeon; Sung, Maenghee.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1841 Springer Verlag, 2000. p. 41-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1841).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yoo, H, Hong, S, Lee, S, Lim, JI, Yi, O & Sung, M 2000, A proposal of a new public key cryptosystem using matrices over a ring. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1841, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1841, Springer Verlag, pp. 41-48, 5th Australasian Conference on Information Security and Privacy, ACISP 2000, Brisbane, Australia, 00/7/10. https://doi.org/10.1007/10718964_4
Yoo H, Hong S, Lee S, Lim JI, Yi O, Sung M. A proposal of a new public key cryptosystem using matrices over a ring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1841. Springer Verlag. 2000. p. 41-48. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/10718964_4
Yoo, Heajoung ; Hong, Seokhie ; Lee, Sangjin ; Lim, Jong In ; Yi, Okyeon ; Sung, Maenghee. / A proposal of a new public key cryptosystem using matrices over a ring. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1841 Springer Verlag, 2000. pp. 41-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b8a4759184414265ba9e086206979100,
title = "A proposal of a new public key cryptosystem using matrices over a ring",
abstract = "In this paper, we propose a new public key cryptosystem based on a probably subexponential time problem over a modular matrix ring. Our new cryptosystem is similar to GGH(O. Goldreich, S. Goldwasser, and S. Halevi) cryptosystem but the attack which breaks the GGH system is not applicable to ours. The security of the new construction is based on the computational difficulty of integer factorizations.",
author = "Heajoung Yoo and Seokhie Hong and Sangjin Lee and Lim, {Jong In} and Okyeon Yi and Maenghee Sung",
year = "2000",
doi = "10.1007/10718964_4",
language = "English",
isbn = "3540677429",
volume = "1841",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "41--48",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A proposal of a new public key cryptosystem using matrices over a ring

AU - Yoo, Heajoung

AU - Hong, Seokhie

AU - Lee, Sangjin

AU - Lim, Jong In

AU - Yi, Okyeon

AU - Sung, Maenghee

PY - 2000

Y1 - 2000

N2 - In this paper, we propose a new public key cryptosystem based on a probably subexponential time problem over a modular matrix ring. Our new cryptosystem is similar to GGH(O. Goldreich, S. Goldwasser, and S. Halevi) cryptosystem but the attack which breaks the GGH system is not applicable to ours. The security of the new construction is based on the computational difficulty of integer factorizations.

AB - In this paper, we propose a new public key cryptosystem based on a probably subexponential time problem over a modular matrix ring. Our new cryptosystem is similar to GGH(O. Goldreich, S. Goldwasser, and S. Halevi) cryptosystem but the attack which breaks the GGH system is not applicable to ours. The security of the new construction is based on the computational difficulty of integer factorizations.

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

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

U2 - 10.1007/10718964_4

DO - 10.1007/10718964_4

M3 - Conference contribution

AN - SCOPUS:84958949883

SN - 3540677429

VL - 1841

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 41

EP - 48

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -