Search Results - Binary GCD algorithm

(1 +i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm by Weilert, André

Get full text

Memory Tampering Attack on Binary GCD Based Inversion Algorithms by Aldaya, Alejandro Cabrera, Brumley, Billy Bob, Sarmiento, Alejandro J. Cabrera, Sánchez-Solano, Santiago

“… limit the output space of binary GCD based modular inversion algorithm implementations…”
Get full text

Existence of a limiting distribution for the binary GCD algorithm by Maze, Gérard

“… This distribution appears in Brent's model of the analysis of the binary gcd algorithm. The existence and uniqueness of such a function was conjectured by Richard Brent in his original paper [R.P…”
Get full text

On Acceleration of the k-ary GCD Algorithm by Amer, I., Ishmukhametov, S.T.

“…In this paper, methods of acceleration of GCD algorithms for natural numbers based on the k-ary GCD algorithm have been studied…”
Get full text

Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding by ARGIIELLO, F

Get full text

Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding by Argueello, F

“…The binary GCD algorithm, discovered by Stein, is an alternative to the Euclidean algorithm for computing the greatest common divisor of two integers…”
Get full text

Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure by Yen, Sung-Ming, Chen, Chien-Ning, Moon, SangJae

“…A series of algorithms for evaluation of multi-exponentiation are proposed based on the binary greatest common divisor algorithm…”
Get full text

Reversible circuit design for GCD computation in cryptography algorithms by Jayashree, H. V., Kotethota, Skanda, Agrawal, V. K.

“…) computation using modified Binary GCD algorithm. We present the generalized design…”
Get full text

Extending the binary gcd algorithms by Kubiak, Przemysław

Get full text

Existence of a Limiting Distribution for the Binary GCD Algorithm by Maze, Gerard

“… This distribution appears in Brent's model of the analysis of the binary gcd algorithm. The existence and uniqueness of such a function has been conjectured by Richard Brent in his original paper \cite{brent…”
Get full text

A redundant binary Euclidean GCD algorithm by Parikh, S.N., Matula, D.W.

“…An efficient implementation of the Euclidean GCD (greatest common divisor) algorithm employing the redundant binary number system is described…”
Get full text

A modular integer GCD algorithm by Weber, Kenneth, Trevisan, Vilmar, Martins, Luiz Felipe

“… It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93…”
Get full text

When one vulnerable primitive turns viral: Novel single-trace attacks on ECDSA and RSA by Alejandro Cabrera Aldaya, Billy Bob Brumley

“… In this paper, we analyze the security of the mbedTLS binary GCD algorithm, an implementation that offers interesting challenges when compared for example with OpenSSL, due to the usage of very tight…”
Get full text

An Efficient All-to-All GCD Algorithm for Low Entropy RSA Key Factorization by Pelofske, Elijah

“…RSA is an incredibly successful and useful asymmetric encryption algorithm. One of the types of implementation flaws in RSA is low entropy of the key generation, specifically the prime number creation stage…”
Get full text

Hardware Implementation of Fast Division Algorithm for GF(2m) by Min-Sup Kang, Kwang-Ho Lee

“… The algorithm implemented is based on the binary extended GCD algorithm. We have shown that the computation speed of the proposed algorithm is significantly improved than the previous approach…”
Get full text

GCD Computation of n Integers by Dwivedi, Shri Prakash

“… In this paper we present the algorithms for GCD computation of \(n\) integers. We extend the Euclid's algorithm and binary GCD algorithm to compute the GCD of more than…”
Get full text

The Mixed Binary Euclid Algorithm by Sedjelmaci, Sidi Mohamed

“…We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches…”
Get full text

Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings by Busch, J.

“… In each imaginary, norm-Euclidean quadratic integer ring, a known binary-like gcd algorithm has complexity that is quadratic in our lower bound…”
Get full text

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers by Damgård, Ivan Bjerre, Frandsen, Gudmund Skovbjerg

“… the integers extended with ζ , a complex primitive third root of unity. The algorithms are similar and may be seen as generalisations of the binary integer gcd and derived Jacobi symbol algorithms…”
Get full text

Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor by Jie Chen, Watson, William, Chen, Mayee F.

“… This paper presents a parallel binary GCD algorithm and its implementation for big integers on the Intel Xeon Phi coprocessor…”
Get full text