Multiple Modular Unique Factorization Domain Subset Product with Errors

Trey Li

Paper 2022/1312

Multiple Modular Unique Factorization Domain Subset Product with Errors

Trey Li

Abstract

We propose the multiple modular subset product with errors problem over unique factorization domains and give search-to-decision reduction as well as average-case-solution to worst-case-solution reduction for it.

Note: This is the 4th paper of the series.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
Keywords: Subset product with errors Subset sum with errors Search-to-decision Worst-case Average-case Solution Reduction
Contact author(s): treyquantum @ gmail com
History: 2022-10-05: approved; 2022-10-04: received; See all versions
Short URL: https://ia.cr/2022/1312
License: CC BY

BibTeX

@misc{cryptoeprint:2022/1312,
      author = {Trey Li},
      title = {Multiple Modular Unique Factorization Domain Subset Product with Errors},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1312},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/1312}},
      url = {https://eprint.iacr.org/2022/1312}
}