Skip to search formSkip to main content>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.

Highly Cited

2010

Highly Cited

2010

We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

In this paper, we present new techniques for collision search in the hash function SHA-0. Using the new techniques, we can find… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We consider the lattice-reduction-aided detection scheme for 2/spl times/2 channels recently proposed by H. Yao and G.W. Wornell… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect matching… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We consider parameter estimation in linear models when some of the parameters are known to be integers. Such problems arise, for… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

A sound pressure level meter adapted for use in monitoring noise levels, particularly for use by law enforcement agencies wherein… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

The paper presents an algorithm for solving Integer Programming problems whose running time depends on the number n of variables… Expand

Is this relevant?

Highly Cited

1983

Highly Cited

1983

The integer programming problem is: Given m×n and m×l matrices A and b respectively of integers, find whether, there exists an… Expand

Is this relevant?

Highly Cited

1983

Highly Cited

1983

The subset sum problem is to decide whether or not the 0-1 integer programming problem Σi=1n aixi = M; all xi = 0 or 1; has a… Expand

Is this relevant?