Semantic Scholar uses AI to extract papers important to this topic.
Given a multiset ofn positive integers, the NP-complete problem of number partitioning is to assign each integer to one of k… Expand Subset sum or Knapsack problems of dimension n are known to be hardest for knapsacks of density close to 1. These problems are NP… Expand At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time O(20… Expand In this paper, we study the complexity of solving hard knapsack problems, i.e., knapsacks with a density close to 1 where lattice… Expand By means of an almost trivial statement of matrix algebra, we prove two conjectures proposed by Gosper and Schroeppel [R.W… Expand We present a careful analysis of elliptic curve point multiplication methods that use the point halving technique of Knudsen and… Expand Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a… Expand The recently proposed multiplicative masking countermeasure against power analysis attacks on AES is interesting as it does not… Expand This paper describes three contributions for efficient implementation of elliptic curve cryptosystems in GF(2n). The first is a… Expand Recently, A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse and J .M. Pollard [5,6] have introduced a new algorithm for factoring… Expand