Výsledky vyhľadávania - Binary GCD algorithm
-
1
(1 +i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm
ISSN: 0747-7171Vydavateľské údaje: 01.10.2000Vydané v Journal of symbolic computation (01.10.2000)Získať plný text
Journal Article -
2
Memory Tampering Attack on Binary GCD Based Inversion Algorithms
ISSN: 0885-7458, 1573-7640Vydavateľské údaje: New York Springer US 01.08.2019Vydané v International journal of parallel programming (01.08.2019)“… limit the output space of binary GCD based modular inversion algorithm implementations…”
Získať plný text
Journal Article -
3
Existence of a limiting distribution for the binary GCD algorithm
ISSN: 1570-8667, 1570-8675Vydavateľské údaje: Elsevier B.V 01.03.2007Vydané v Journal of discrete algorithms (Amsterdam, Netherlands) (01.03.2007)“… 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
Journal Article -
4
On Acceleration of the k-ary GCD Algorithm
ISSN: 2541-7746, 2500-2198Vydavateľské údaje: Kazan Federal University 01.01.2019Vydané v Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki (01.01.2019)“…In this paper, methods of acceleration of GCD algorithms for natural numbers based on the k-ary GCD algorithm have been studied…”
Získať plný text
Journal Article -
5
Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding
ISSN: 0013-5194, 1350-911XVydavateľské údaje: London Institution of Electrical Engineers 23.06.2005Vydané v Electronics letters (23.06.2005)Získať plný text
Journal Article -
6
Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding
ISSN: 0013-5194, 1350-911XVydavateľské údaje: Stevenage John Wiley & Sons, Inc 23.06.2005Vydané v Electronics letters (23.06.2005)“…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
Journal Article -
7
Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure
ISSN: 2190-8508, 2190-8516Vydavateľské údaje: Berlin/Heidelberg Springer-Verlag 01.09.2012Vydané v Journal of cryptographic engineering (01.09.2012)“…A series of algorithms for evaluation of multi-exponentiation are proposed based on the binary greatest common divisor algorithm…”
Získať plný text
Journal Article -
8
Reversible circuit design for GCD computation in cryptography algorithms
ISSN: 0098-9886, 1097-007XVydavateľské údaje: Chichester, UK John Wiley & Sons, Ltd 01.02.2017Vydané v International journal of circuit theory and applications (01.02.2017)“…) computation using modified Binary GCD algorithm. We present the generalized design…”
Získať plný text
Journal Article -
9
Extending the binary gcd algorithms
ISBN: 3110170469, 9783110170467Vydavateľské údaje: Germany Walter de Gruyter GmbH 2001Vydané v Public-Key Cryptography and Computational Number Theory (2001)Získať plný text
Kapitola -
10
Existence of a Limiting Distribution for the Binary GCD Algorithm
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 06.06.2005Vydané v arXiv.org (06.06.2005)“… 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
Paper -
11
A redundant binary Euclidean GCD algorithm
ISBN: 0818691514, 9780818691515Vydavateľské údaje: IEEE Comput. Soc. Press 1991Vydané v Computer Arithmetic 1991 IEEE Symposium On (1991)“…An efficient implementation of the Euclidean GCD (greatest common divisor) algorithm employing the redundant binary number system is described…”
Získať plný text
Konferenčný príspevok.. -
12
A modular integer GCD algorithm
ISSN: 0196-6774, 1090-2678Vydavateľské údaje: San Diego, CA Elsevier Inc 01.02.2005Vydané v Journal of algorithms (01.02.2005)“… 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
Journal Article -
13
When one vulnerable primitive turns viral: Novel single-trace attacks on ECDSA and RSA
ISSN: 2569-2925Vydavateľské údaje: Ruhr-Universität Bochum 01.03.2020Vydané v IACR transactions on cryptographic hardware and embedded systems (01.03.2020)“… 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
Journal Article -
14
An Efficient All-to-All GCD Algorithm for Low Entropy RSA Key Factorization
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 06.05.2024Vydané v arXiv.org (06.05.2024)“…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…”
Získať plný text
Paper -
15
Hardware Implementation of Fast Division Algorithm for GF(2m)
ISBN: 8955191294, 9788955191295“… 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…”Vydavateľské údaje: IEEE 2006
Získať plný text
Konferenčný príspevok.. -
16
GCD Computation of n Integers
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 25.07.2014Vydané v arXiv.org (25.07.2014)“… 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
Paper -
17
The Mixed Binary Euclid Algorithm
ISSN: 1571-0653, 1571-0653Vydavateľské údaje: Elsevier B.V 01.12.2009Vydané v Electronic notes in discrete mathematics (01.12.2009)“…We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches…”
Získať plný text
Journal Article -
18
Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings
ISSN: 0747-7171, 1095-855XVydavateľské údaje: Elsevier Ltd 01.06.2009Vydané v Journal of symbolic computation (01.06.2009)“… In each imaginary, norm-Euclidean quadratic integer ring, a known binary-like gcd algorithm has complexity that is quadratic in our lower bound…”
Získať plný text
Journal Article -
19
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
ISSN: 0747-7171, 1095-855XVydavateľské údaje: Elsevier Ltd 01.06.2005Vydané v Journal of symbolic computation (01.06.2005)“… 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…”
Získať plný text
Journal Article -
20
Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor
Vydavateľské údaje: IEEE 01.08.2014Vydané v 2014 9th IEEE International Conference on Networking, Architecture, and Storage (01.08.2014)“… This paper presents a parallel binary GCD algorithm and its implementation for big integers on the Intel Xeon Phi coprocessor…”
Získať plný text
Konferenčný príspevok..

