You are looking at a specific version 20210327:071158 of this paper.
See the latest version.
Paper 2021/385
Solving the problem of Blockwise Isomorphism of Polynomials with Circulant matrices
Yasufumi Hashimoto
Abstract
The problem of Blockwise Isomorphism of Polynomials was introduced by Santoso at PQCrypto 2020 as a generalization of the problem of Isomorphism of Polynomials. In the present paper, we describe how to solve this problem with circulant matrices, used in Santoso's Diffie-Hellman type encryption scheme.
Note: 13 pages
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Isomorphism of PolynomialsBlockwise Isomorphism of Polynomialscirculant matrix
- Contact author(s)
- hashimoto @ math u-ryukyu ac jp
- History
- 2021-03-27: received
- Short URL
- https://ia.cr/2021/385
- License
-
CC BY