Výsledky vyhľadávania - "Binary GCD algorithm"

Existence of a limiting distribution for the binary GCD algorithm Autor 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…”
Získať plný text

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

Získať plný text

Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding Autor 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…”
Získať plný text

On Acceleration of the k-ary GCD Algorithm Autor 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. The k-ary algorithm was…”
Získať plný text

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

Získať plný text

Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure Autor 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. The proposed algorithms are…”
Získať plný text

Existence of a Limiting Distribution for the Binary GCD Algorithm Autor 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…”
Získať plný text

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

“…) computation using modified Binary GCD algorithm. We present the generalized design…”
Získať plný text

Extending the binary gcd algorithms Autor Kubiak, Przemysław

Získať plný text

When one vulnerable primitive turns viral: Novel single-trace attacks on ECDSA and RSA Autor 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…”
Získať plný text

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

“… 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…”
Získať plný text

A hardware algorithm for modular multiplication/division Autor Kaihara, M.E., Takagi, N.

“… The algorithm is based on Montgomery method for modular multiplication and on the extended Binary GCD algorithm for modular division…”
Získať plný text

Greatest common divisor and its applications in security: Case study Autor Siddhartha, M, Rodriques, Jelwin, Chandavarkar, B. R.

“… The paper initially discusses four standard algorithms used in calculating GCD: Euclidean Algorithm, Binary GCD algorithm, Dijkstra's algorithm, and Lehmer's algorithm…”
Získať plný text

A modular integer GCD algorithm Autor 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…”
Získať plný text

A hardware algorithm for modular multiplication/division Autor Kaihara, M E, Takagi, N

“… The algorithm is based on Montgomery method for modular multiplication and on the extended Binary GCD algorithm for modular division…”
Získať plný text

GCD Computation of n Integers Autor 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…”
Získať plný text

Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor Autor 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…”
Získať plný text

A VLSI algorithm for modular multiplication/division Autor Kaihara, M.E., Takagi, N.

“… The algorithm is based on Montgomery's method for modular multiplication and on the extended binary GCD algorithm for modular division…”
Získať plný text

GCD computation of n integers Autor 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…”
Získať plný text

High-speed, low-complexity systolic designs of novel iterative division algorithms in GF(2/sup m/) Autor Wu, Chien-Hsing, Wu, Chien-Ming, Shieh, Ming-Der, Hwang, Yin-Tsung

“…We extend the binary algorithm invented by Stein and propose novel iterative division algorithms over GF(2/sup m/) for systolic VLSI realization. While…”
Získať plný text