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.

2016

2016

The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular… Expand

Is this relevant?

Highly Cited

2014

Highly Cited

2014

Transnational governance initiatives increasingly face the problem of regime complexity in which a proliferation of regulatory… Expand

Is this relevant?

2012

2012

Este articulo es fruto de un estudio realizado por GRITS2 a partir de la obtencion de un premio a proyectos de investigacion… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

We present a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup… Expand

Is this relevant?

2009

2009

The last 16 000 cal. a of vegetation, fire and limnological history are described from the steppe-forest ecotone in the… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

We present an efficient construction of Yao's "garbled circuits" protocol for securely computing any two-party circuit on… Expand

Is this relevant?

2007

2007

In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the… Expand

Is this relevant?

1997

1997

Formal Method Integration via Heterogeneous Notations Richard Freeman Paige Doctor of Philosophy Graduate Department of Computer… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Abstract We consider the problem of factoring univariate polynomials over a finite field. We demonstrate that the new baby step… Expand

Is this relevant?

1988

1988

The comprehensive value added tax (VAT), now a principal source of revenue for some forty countries, was nowhere to be found only… Expand

Is this relevant?