Efficient reductions and algorithms for subset product

DOI10.1007/978-3-031-25211-2_1MaRDI QIDQ6132518zbMATH OpenOpenAlexFDO

Authors Pranjal Dutta, Mahesh Sreekumar Rajasree

Publication date 17 August 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-25211-2_1

zbMATH Keywords

FFTpower serieslogspacesimultaneoussubset productpseudo-prime-factor

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Rigorous Time Bound for Factoring Integers
• A generic approach to proving NP-hardness of partition type problems
• A near-linear pseudopolynomial time algorithm for subset sum
• Algebraic algorithms for variants of subset sum
• Approximating the product knapsack problem
• Chosen-ciphertext security from subset sum
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• On the interval containing at least one prime number
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Quantum algorithms for the subset-sum problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• Subset Sum Quantumly in 1.17 n .
• VSH, an Efficient and Provable Collision-Resistant Hash Function

Cited in

(2)

• scientific article; zbMATH DE number 4182020 (Why is no real title available?)
• scientific article; zbMATH DE number 1264215 (Why is no real title available?)

This page was built for publication: Efficient reductions and algorithms for subset product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132518)