Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Review

2014

Review

2014

Given a multiset ofn positive integers, the NP-complete problem of number partitioning is to assign each integer to one of k… Expand

2012

2012

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

Highly Cited

2011

Highly Cited

2011

At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time O(20… Expand

Highly Cited

2010

Highly Cited

2010

In this paper, we study the complexity of solving hard knapsack problems, i.e., knapsacks with a density close to 1 where lattice… Expand

2010

2010

By means of an almost trivial statement of matrix algebra, we prove two conjectures proposed by Gosper and Schroeppel [R.W… Expand

Highly Cited

2004

Highly Cited

2004

We present a careful analysis of elliptic curve point multiplication methods that use the point halving technique of Knudsen and… Expand

Highly Cited

2004

Highly Cited

2004

Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a… Expand

Highly Cited

2002

Highly Cited

2002

The recently proposed multiplicative masking countermeasure against power analysis attacks on AES is interesting as it does not… Expand

Highly Cited

1998

Highly Cited

1998

This paper describes three contributions for efficient implementation of elliptic curve cryptosystems in GF(2n). The first is a… Expand

Highly Cited

1991

Highly Cited

1991

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