Welcome to the resource topic for 2022/1308
Title:
Jacobi Symbol Parity Checking Algorithm for Subset Product
Authors: Trey Li
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.
ePrint: https://eprint.iacr.org/2022/1308
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .