The hardness of solving subset sum with preprocessing

DOI10.1109/18.53763zbMath0707.94018OpenAlexW2042339194MaRDI QIDQ5899944

Antoine C. Lobstein

Publication date: 1990

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.53763

zbMATH Keywords

NP-completeknapsacksubset sumpublic-key cryptosystemslinear decoding

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Related Items (2)

The inapproximability of lattice and coding problems with preprocessing ⋮ On the equivalence of two post-quantum cryptographic families

This page was built for publication: The hardness of solving subset sum with preprocessing