搜索结果: 1-11 共查到“Knapsack”相关记录11条 . 查询时间(0.046 秒)
TACHYON: Fast Signatures from Compact Knapsack
Digital signatures post-quantum security authentication
2018/11/13
We introduce a simple, yet efficient digital signature scheme which offers post-quantum security promise. Our scheme, named TACHYONTACHYON, is based on a novel approach for extending one-time hash-bas...
Given this scheme's algebraic structure it is interesting to systematically explore its variants and generalizations. In particular it might be useful to enhance NS with features such as semantic secu...
Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices
public-key cryptography / Shortest vector problem Kolmogorov complexity Knapsack lattice NTRU lattice
2012/3/29
Finding the shortest vector of a lattice is one of the most important problems in computational lattice theory. For a random lattice, one can estimate the length of the shortest vector using the Gauss...
A Construction of A New Class of Knapsack-Type Public Key Cryptosystem, K(III)$\Sigma$PKC
public-key cryptography / Public-key cryptosystem(PKC) Knapsack type PKC Subset-sum problem LLL algorithm PQC
2012/3/29
In this paper, we present a new class of knapsack type PKC referred to as K(III)$\Sigma$PKC. In a sharp contrast with the conventional knapsack type PKC's, in our proposed scheme, K(III)$\Sigma$PKC, n...
Cryptanalysis of two knapsack public-key cryptosystems
Knapsack public-key cryptosystem Cryptanalysis
2009/11/18
In this paper, we cryptanalyze two knapsack cryptosystems.
The first one is proposed by Hwang et al [4], which is based on a new
permutation algorithm named Permutation Combination Algorithm. We
sh...
A New Lattice-Based Cryptosystem Mixed with a Knapsack
Lattice Public-key Cryptosystem Knapsack
2009/7/14
In this paper, we present a new lattice-based public-key cryptosystem mixed
with a knapsack, which has reasonable key size and quick encryption and decryption.
The module strategy in our cryptosyste...
The LLL algorithm is strong algorithm that decrypts
the additional type Knapsack cryptosystem. However, the
LLL algorithm is not applicable in the addition in the group that
rational points of elli...
Knapsack cryptosystems built on NP-hard instances
Knapsack cryptosystems NP-hard instances Probabilistic polynomial reductions
2009/6/3
We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy
instances of the knapsack problem and have been broken. The systems considered in the article face
thi...
Optimal partial hedging in a discrete-time market as a knapsack problem
Optimal partial discrete-time market knapsack problem
2010/11/2
Optimal partial hedging in a discrete-time market as a knapsack problem.
Two Topics in Dominance Relations for the Unbounded Knapsack Problem
Combinatorial optimisation Unbounded knapsack problem Dominance relation Polynomially solvable special case
2008/11/10
On the unbounded knapsack problem, dominance relations play a crucial role to reduce items to be considered in a given instance. This article picks up two topics in dominance relations. One is a conne...
Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem
knapsack public-key cryptosystem subset sum problem low-density attack
2008/9/8
he realization of the quantum computer will enable to break publickey
cryptosystems based on factoring problem and discrete logarithm problem. It
is considered that even the quantum computer can not...