Paper 2021/385 Original: eprint.iacr.org/2021/385 ↗
Solving the problem of Blockwise Isomorphism of Polynomials with Circulant matrices
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2021-03-27: last updated
- 2021-03-27: published
- Short URL
- https://ia.cr/2021/385
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/385,
author = {Yasufumi Hashimoto},
title = {Solving the problem of Blockwise Isomorphism of Polynomials with Circulant matrices},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/385},
year = {2021},
url = {https://eprint.iacr.org/2021/385}
}