Suchergebnisse - "Binary Euclidean algorithm"
-
1
A rigorous version of R.P. Brent's model for the binary Euclidean algorithm
ISSN: 0001-8708, 1090-2082Veröffentlicht: Elsevier Inc 26.02.2016Veröffentlicht in Advances in mathematics (New York. 1965) (26.02.2016)“… The binary Euclidean algorithm is a modification of the classical Euclidean algorithm for computation of greatest common divisors which avoids ordinary integer division in favour of division by powers of two …”
Volltext
Journal Article -
2
Side‐channel analysis of the modular inversion step in the RSA key generation algorithm
ISSN: 0098-9886, 1097-007XVeröffentlicht: Bognor Regis Wiley Subscription Services, Inc 01.02.2017Veröffentlicht in International journal of circuit theory and applications (01.02.2017)“… Summary This paper studies the security of the RSA key generation algorithm with regard to side‐channel analysis and presents a novel approach that targets the …”
Volltext
Journal Article -
3
SPA vulnerabilities of the binary extended Euclidean algorithm
ISSN: 2190-8508, 2190-8516Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2017Veröffentlicht in Journal of cryptographic engineering (01.11.2017)“… The execution flow of the binary extended Euclidean algorithm (BEEA) is heavily dependent on its inputs. Taking advantage of that fact, this work presents a …”
Volltext
Journal Article -
4
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
ISSN: 0178-4617Veröffentlicht: New York, NY Springer 01.12.1998Veröffentlicht in Algorithmica (01.12.1998)Volltext
Journal Article -
5
Further analysis of the binary Euclidean algorithm
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 12.03.2013Veröffentlicht in arXiv.org (12.03.2013)“… The binary Euclidean algorithm is a variant of the classical Euclidean algorithm …”
Volltext
Paper -
6
A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 02.09.2014Veröffentlicht in arXiv.org (02.09.2014)“… The binary Euclidean algorithm is a modification of the classical Euclidean algorithm for computation of greatest common divisors which avoids ordinary integer division in favour of division by powers of two …”
Volltext
Paper -
7
Existence of a limiting distribution for the binary GCD algorithm
ISSN: 1570-8667, 1570-8675Veröffentlicht: Elsevier B.V 01.03.2007Veröffentlicht in Journal of discrete algorithms (Amsterdam, Netherlands) (01.03.2007)“… Brent, Analysis of the binary Euclidean algorithm, in: J.F. Traub (Ed.), New Directions and Recent Results in Algorithms and Complexity, Academic Press, New York, 1976, pp. 321–355 …”
Volltext
Journal Article -
8
Scalable elliptic curve encryption processor for portable application
ISBN: 0780378946, 078037889X, 9780780378940, 9780780378896ISSN: 1523-553XVeröffentlicht: IEEE 2003Veröffentlicht in ASIC, 2003. Proceedings. 5th International Conference on (2003)“… In order to realize the reconfigurable architecture for portable application, we also adopt Montgomery's affine algorithm, MSB-first bit-serial multiplication and an extended binary Euclidean …”
Volltext
Tagungsbericht -
9
Design and VLSI implementation of low power rational arithmetic unit
ISBN: 9781267346551, 1267346558Veröffentlicht: ProQuest Dissertations & Theses 01.01.2012“… Computer arithmetic continues to be an important topic in computer architecture as the primary design focus shifts to mobile processors. Advances in computer …”
Volltext
Dissertation -
10
Improved Modular Inversion over GF(p)
ISSN: 1738-6764, 2093-7504Veröffentlicht: 2007Veröffentlicht in International JOURNAL OF CONTENTS (2007)“… This paper proposed a new modular inverse algorithm based on the right-shifting binary Euclidean algorithm …”
Volltext
Journal Article -
11
Improved quantum circuits for elliptic curve discrete logarithms
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 27.01.2020Veröffentlicht in arXiv.org (27.01.2020)“… circuits for modular inversion by reformulating the binary Euclidean algorithm. Overall, we obtain an affine Weierstrass point addition circuit that has lower depth and uses fewer …”
Volltext
Paper -
12
An architecture for a rational arithmetic unit
ISBN: 9798206642346Veröffentlicht: ProQuest Dissertations & Theses 01.01.1988“… A nonrestoring redundant binary Euclidean algorithm is developed to drive the arithmetic unit. The algorithmic efficiency of the unit is shown to be competitive with floating point division in terms of number of shifts and add/sub operations …”
Volltext
Dissertation

