Generalizing Cryptosystems Based on the Subset Sum Problem

International Journal of Information Security - Germany
doi 10.1007/s10207-011-0129-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Approximability of the Subset Sum Reconfiguration Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Predicting Subset Sum Pseudorandom Generators

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Chosen-Ciphertext Security From Subset Sum

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Multi-Bit Cryptosystems Based on Lattice Problems

English

Public-Key Cryptosystems From the Worst-Case Shortest Vector Problem

2009English

On Constructing Certificateless Cryptosystems From Identity Based Encryption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Cryptosystems Based on an Analog of Heat Flow

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1988English

Divisibility: A Problem Solving Approach Through Generalizing and Specializing

Humanistic Mathematics Network Journal
1999English

Divisibility: A Problem Solving Approach Through Generalizing and Specializing

Humanistic Mathematics Network Journal
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy