Suchergebnisse - Binary GCD algorithm

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

Volltext

Memory Tampering Attack on Binary GCD Based Inversion Algorithms von 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 …”
Volltext

Existence of a limiting distribution for the binary GCD algorithm von 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 …”
Volltext

On Acceleration of the k-ary GCD Algorithm von 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 …”
Volltext

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

Volltext

Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding von 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 …”
Volltext

Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure von 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 …”
Volltext

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

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

Extending the binary gcd algorithms von Kubiak, Przemysław

Volltext

Existence of a Limiting Distribution for the Binary GCD Algorithm von 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 …”
Volltext

A redundant binary Euclidean GCD algorithm von 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 …”
Volltext

A modular integer GCD algorithm von 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 …”
Volltext

When one vulnerable primitive turns viral: Novel single-trace attacks on ECDSA and RSA von 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 …”
Volltext

An Efficient All-to-All GCD Algorithm for Low Entropy RSA Key Factorization von 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 …”
Volltext

Hardware Implementation of Fast Division Algorithm for GF(2m) von 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 …”
Volltext

GCD Computation of n Integers von 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 …”
Volltext

The Mixed Binary Euclid Algorithm von Sedjelmaci, Sidi Mohamed

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

Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings von 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 …”
Volltext

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers von 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 …”
Volltext

Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor von 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 …”
Volltext