The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
1978년 Merkle과 Hellman은 두 종류의 배낭형 공개키 암호체계를 발표했는데, 그 중 하나는 초증가형이고 다른 하나는 곱셈형이었습니다. 그러나 전자는 1982년 Shamir에 의해 깨졌고 후자는 1984년 Odlyzko에 의해 깨졌습니다. 최근 Chor와 Rivest는 GF의 산술을 기반으로 하는 새로운 곱셈 배낭형 암호 시스템을 제안했습니다(ph) Odlyzko 공격으로 깨질 수 없습니다. 이 논문은 공개 배낭 벡터에 값이 서로 가까운 세 개의 요소가 있거나 기본 다항식을 알고 있는 경우 새로운 암호 시스템이 손상된다는 것을 보여줍니다. 우리는 또한 원래 비밀 키뿐만 아니라 다른 많은 비밀 키도 암호 시스템을 해독할 수 있음을 제시합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kaoru KUROSAWA, Toshiya ITOH, Hiroo SHIGETA, Shigeo TSUJII, "An Attacking Method for Multiplicative Knapsack Type Public Key Cryptosystem Based on Finite Field" in IEICE TRANSACTIONS on transactions,
vol. E70-E, no. 1, pp. 37-41, January 1987, doi: .
Abstract: In 1978, Merkle and Hellman published two kinds of knapsack type public key cryptosystems, one of which was super-increasing type and the other was multiplicative type. However, the former was broken by Shamir in 1982 and latter was broken by Odlyzko in 1984. Recently, Chor and Rivest proposed a new multiplicative knapsack type cryptosystem based on arithmetic in GF (ph) which cannot be broken by the Odlyzko attack. This paper shows the new cryptosystem is broken if the public knapsack vector has three elements whose values are close to one another or if the primitive polynomial is known. We also present that not only the original secret-key also many other ones can decipher the cryptosystem.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e70-e_1_37/_p
부
@ARTICLE{e70-e_1_37,
author={Kaoru KUROSAWA, Toshiya ITOH, Hiroo SHIGETA, Shigeo TSUJII, },
journal={IEICE TRANSACTIONS on transactions},
title={An Attacking Method for Multiplicative Knapsack Type Public Key Cryptosystem Based on Finite Field},
year={1987},
volume={E70-E},
number={1},
pages={37-41},
abstract={In 1978, Merkle and Hellman published two kinds of knapsack type public key cryptosystems, one of which was super-increasing type and the other was multiplicative type. However, the former was broken by Shamir in 1982 and latter was broken by Odlyzko in 1984. Recently, Chor and Rivest proposed a new multiplicative knapsack type cryptosystem based on arithmetic in GF (ph) which cannot be broken by the Odlyzko attack. This paper shows the new cryptosystem is broken if the public knapsack vector has three elements whose values are close to one another or if the primitive polynomial is known. We also present that not only the original secret-key also many other ones can decipher the cryptosystem.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - An Attacking Method for Multiplicative Knapsack Type Public Key Cryptosystem Based on Finite Field
T2 - IEICE TRANSACTIONS on transactions
SP - 37
EP - 41
AU - Kaoru KUROSAWA
AU - Toshiya ITOH
AU - Hiroo SHIGETA
AU - Shigeo TSUJII
PY - 1987
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E70-E
IS - 1
JA - IEICE TRANSACTIONS on transactions
Y1 - January 1987
AB - In 1978, Merkle and Hellman published two kinds of knapsack type public key cryptosystems, one of which was super-increasing type and the other was multiplicative type. However, the former was broken by Shamir in 1982 and latter was broken by Odlyzko in 1984. Recently, Chor and Rivest proposed a new multiplicative knapsack type cryptosystem based on arithmetic in GF (ph) which cannot be broken by the Odlyzko attack. This paper shows the new cryptosystem is broken if the public knapsack vector has three elements whose values are close to one another or if the primitive polynomial is known. We also present that not only the original secret-key also many other ones can decipher the cryptosystem.
ER -