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.

2016

2016

In this paper, we show efficient implementations of binary field multiplication over ARMv8. We exploit an advanced 64-bit… Expand

Is this relevant?

2013

2013

This paper presents a low complexity digit-serial GF(2m) multiplier. The proposed architecture use digit-serial combination… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

The authors describe how a simple way to split input operands allows for fast VLSI implementations of subquadratic GF (2)[ x… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private… Expand

Is this relevant?

2010

2010

This paper presents complexity analysis [both in application-specific integrated circuits (ASICs) and on field-programmable gate… Expand

Is this relevant?

2007

2007

Algorithms in cryptosystem such as RSA and Diffie-Hellman require the large integer multiplication. This paper introduces… Expand

Is this relevant?

2007

2007

Given floating-point arithmetic with $t$-digit base-$\beta$ significands in which all arithmetic operations are performed as if… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

In this work we generalize the classical Karatsuba Algorithm (KA) for polynomial multiplication to (i) polynomials of arbitrary… Expand

Is this relevant?

2006

2006

Karatsuba discovered the first algorithm that accomplishes multiprecision integer multiplication with complexity below that of… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

The Karatsuba-Ofman algorithm starts with a way to multiply two 2-term (i.e., linear) polynomials using three scalar… Expand

Is this relevant?