Skip to search formSkip to main content

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

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

2015

2015

We prove that in a graph with n vertices, induced chordal and interval subgraphs with the maximum number of vertices can be found… Expand

Is this relevant?

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

2008

2008

This paper looks at the possibility of combining a block cipher and a stream cipher to get a strong hybrid cipher. It includes… Expand

Is this relevant?

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

Is this relevant?

Highly Cited

2004

Highly Cited

2004

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

1991

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

Is this relevant?