Security and Unique Decipherability of Two-Dimensional Public Key Cryptosystems

Kenji KOYAMA

Security and Unique Decipherability of Two-Dimensional Public Key Cryptosystems

Kenji KOYAMA

Full Text Views

0

Share
Cite this

Summary :

In this paper, we propose two-dimensional public key cryptosystems. We show the cryptosystems based on three schemes: the Rabin, the Williams and the RSA. It is proved that complete breaking of the proposed two-dimensional cryptosystems based on the Rabin scheme or the Williams scheme is computationally equivalent to factoring n used as the modulus. It is also proved that solving for relational information such as the ratio of plaintext pair for these systems is computationally equivalent to factoring n. It is shown that both two-dimensional cryptosystems based on the Williams scheme and the RSA scheme are uniquely decipherable.

Publication: IEICE TRANSACTIONS on transactions Vol.E73-E No.7 pp.1058-1067

Publication Date: 1990/07/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Cryptography and Information Security)

Category: Public-Key Systems

Authors

Kenji KOYAMA

Keyword

Cite this

Copy

Kenji KOYAMA, "Security and Unique Decipherability of Two-Dimensional Public Key Cryptosystems" in IEICE TRANSACTIONS on transactions, vol. E73-E, no. 7, pp. 1058-1067, July 1990, doi: .
Abstract: In this paper, we propose two-dimensional public key cryptosystems. We show the cryptosystems based on three schemes: the Rabin, the Williams and the RSA. It is proved that complete breaking of the proposed two-dimensional cryptosystems based on the Rabin scheme or the Williams scheme is computationally equivalent to factoring n used as the modulus. It is also proved that solving for relational information such as the ratio of plaintext pair for these systems is computationally equivalent to factoring n. It is shown that both two-dimensional cryptosystems based on the Williams scheme and the RSA scheme are uniquely decipherable.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e73-e_7_1058/_p

Copy

@ARTICLE{e73-e_7_1058,
author={Kenji KOYAMA, },
journal={IEICE TRANSACTIONS on transactions},
title={Security and Unique Decipherability of Two-Dimensional Public Key Cryptosystems},
year={1990},
volume={E73-E},
number={7},
pages={1058-1067},
abstract={In this paper, we propose two-dimensional public key cryptosystems. We show the cryptosystems based on three schemes: the Rabin, the Williams and the RSA. It is proved that complete breaking of the proposed two-dimensional cryptosystems based on the Rabin scheme or the Williams scheme is computationally equivalent to factoring n used as the modulus. It is also proved that solving for relational information such as the ratio of plaintext pair for these systems is computationally equivalent to factoring n. It is shown that both two-dimensional cryptosystems based on the Williams scheme and the RSA scheme are uniquely decipherable.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Security and Unique Decipherability of Two-Dimensional Public Key Cryptosystems
T2 - IEICE TRANSACTIONS on transactions
SP - 1058
EP - 1067
AU - Kenji KOYAMA
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1990
AB - In this paper, we propose two-dimensional public key cryptosystems. We show the cryptosystems based on three schemes: the Rabin, the Williams and the RSA. It is proved that complete breaking of the proposed two-dimensional cryptosystems based on the Rabin scheme or the Williams scheme is computationally equivalent to factoring n used as the modulus. It is also proved that solving for relational information such as the ratio of plaintext pair for these systems is computationally equivalent to factoring n. It is shown that both two-dimensional cryptosystems based on the Williams scheme and the RSA scheme are uniquely decipherable.
ER -