70 research outputs found
A Simple Scheme, for Strengthening Product-sum Type PKC
In this paper we present a very simple scheme for strengthening the conventional product-sum type PKC which has been long considered insecure against the various attacks such as the secret key attack, LLL attack, etc.
We show that with the proposed strengthening scheme, the securities of the conventional product-sum type PKC\u27s can be much improved
Multiple Subset Problem as an encryption scheme for communication
Using well-known mathematical problems for encryption is a widely used
technique because they are computationally hard and provide security against
potential attacks on the encryption method. The subset sum problem (SSP) can be
defined as finding a subset of integers from a given set, whose sum is equal to
a specified integer. The classic SSP has various variants, one of which is the
multiple-subset problem (MSSP). In the MSSP, the goal is to select items from a
given set and distribute them among multiple bins, en-suring that the capacity
of each bin is not exceeded while maximizing the total weight of the selected
items. This approach addresses a related problem with a different perspective.
Here a related different kind of problem is approached: given a set of sets
A={A1, A2..., An}, find an integer s for which every subset of the given sets
is summed up to, if such an integer exists. The problem is NP-complete when
considering it as a variant of SSP. However, there exists an algorithm that is
relatively efficient for known pri-vate keys. This algorithm is based on
dispensing non-relevant values of the potential sums. In this paper we present
the encryption scheme based on MSSP and present its novel usage and
implementation in communication
- …