✦ LIBER ✦

Generalizing cryptosystems based on the subset sum problem

✍ Scribed by Aniket Kate; Ian Goldberg

Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 293 KB
Volume: 10
Category: Article
ISSN: 1615-5262
DOI: 10.1007/s10207-011-0129-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the equal-subset-sum problem

✍ Gerhard J. Woeginger; Zhongliang Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 339 KB

On variations of the subset sum problem

✍ J.L. Ramírez Alfonsín 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 371 KB

In the well-known Subset Sum Problem, we are given positive integers a,, , a, and t and are to determine if some subset of the ai sums to t. We investigate the boundary between easy and hard variations of this problem. In particular, we consider the cases where the sequence 'A,~ .L' a,, \_\_\_ ,an i

Solving the generalized Subset Sum probl

Solving the generalized Subset Sum problem with a light based device

✍ Masud Hasan; Shabab Hossain; Md. Mahmudur Rahman; M. Sohel Rahman 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 352 KB

Solving the subset-sum problem with a li

Solving the subset-sum problem with a light-based device

✍ Mihai Oltean; Oana Muntean 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 218 KB

Probabilistic analysis of the subset-sum

Probabilistic analysis of the subset-sum problem

✍ Gianfranco D'Atri; Claude Puech 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Priority algorithms for the subset-sum p

Priority algorithms for the subset-sum problem

✍ Yuli Ye; Allan Borodin 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 732 KB