Paper 2022/1308 Original: eprint.iacr.org/2022/1308 ↗
Jacobi Symbol Parity Checking Algorithm for Subset Product
Abstract
It is well-known that the subset product problem is NP-hard. We give a probabilistic polynomial time algorithm for the special case of high F_2-rank.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2022-10-02: last updated
- 2022-10-02: published
- Short URL
- https://ia.cr/2022/1308
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/1308,
author = {Trey Li},
title = {Jacobi Symbol Parity Checking Algorithm for Subset Product},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/1308},
year = {2022},
url = {https://eprint.iacr.org/2022/1308}
}