Výsledky vyhledávání - Binary GCD algorithm

Binary GCD Algorithm

Zdroj: Encyclopedia of Cryptography, Security and Privacy ISBN: 9783030715205

Existence of a limiting distribution for the binary GCD algorithm

Autoři: Gérard Maze

Zdroj: Journal of Discrete Algorithms. 5:176-186

Témata: Binary gcd algorithm, Fixed point, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Functional Analysis (math.FA), 68W40, 68Q25, 47H10, Mathematics - Functional Analysis, Computational Theory and Mathematics, General Mathematics (math.GM), 0103 physical sciences, FOS: Mathematics, Discrete Mathematics and Combinatorics, Analysis of algorithms, Mathematics - General Mathematics

Přístupová URL adresa: http://arxiv.org/abs/math/0504426
https://dblp.uni-trier.de/db/journals/jda/jda5.html#Maze07
https://core.ac.uk/display/82094294
https://www.sciencedirect.com/science/article/pii/S157086670600027X
http://user.math.uzh.ch/maze/Articles/BrentArxiv.pdf

Analysis of a left-shift binary GCD algorithm

Autoři: Shallit, Jeffrey Sorenson, Jonathan

Zdroj: Lecture Notes in Computer Science ISBN: 9783540586913

Témata: Computational Mathematics, Algebra and Number Theory, Theory and Algorithms, binary GCD algorithm, Analysis of algorithms and problem complexity, Number Theory, Multiplicative structure, Euclidean algorithm, greatest common divisors, 0102 computer and information sciences, 0101 mathematics, complexity, 01 natural sciences, Number-theoretic algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0747717184710303
https://digitalcommons.butler.edu/facsch_papers/1339/
https://dblp.uni-trier.de/db/journals/jsc/jsc17.html#ShallitS94
https://core.ac.uk/display/82485981
https://www.sciencedirect.com/science/article/abs/pii/S0747717184710303
https://link.springer.com/chapter/10.1007/3-540-58691-1_55
https://rd.springer.com/chapter/10.1007%2F3-540-58691-1_55
https://link.springer.com/content/pdf/10.1007%2F3-540-58691-1_55.pdf
https://dblp.uni-trier.de/db/conf/ants/ants1994.html#ShallitS94

On Acceleration of the k-ary GCD Algorithm

Autoři: Amer I. Ishmukhametov S.

Zdroj: Учёные записки Казанского университета: Серия Физико-математические науки, Vol 161, Iss 1, Pp 110-118 (2019)
SCOPUS25417746-2019-161-1-SID85071981073

Témata: binary gcd algorithm, euclidian gcd algorithm, Euclidian GCD algorithm, greatest common divisor for natural numbers, K-ary GCD algorithm, QA1-939, Binary GCD algorithm, Greatest common divisor for natural numbers, Mathematics, k-ary gcd algorithm

Přístupová URL adresa: https://doaj.org/article/52eeec2e44064236878b486603fc9ac2
https://openrepository.ru/article?id=198656

(1 +i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm

Autoři: André Weilert

Zdroj: Journal of Symbolic Computation. 30:605-617

Témata: Computational Mathematics, Algebra and Number Theory, 0101 mathematics, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jsc/jsc30.html#Weilert00
https://dialnet.unirioja.es/servlet/articulo?codigo=711638
https://dl.acm.org/doi/10.1006/jsco.2000.0422
https://www.sciencedirect.com/science/article/abs/pii/S074771710090422X
https://www.sciencedirect.com/science/article/pii/S074771710090422X
https://core.ac.uk/display/82515504

A generalization of the binary GCD algorithm

Autoři: Tudor Jebelean

Zdroj: Proceedings of the 1993 international symposium on Symbolic and algebraic computation - ISSAC '93. :111-116

Témata: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Binary GCD Like Algorithms for Some Complex Quadratic Rings

Autoři: Gudmund Skovbjerg Frandsen Saurabh Agarwal

Zdroj: Lecture Notes in Computer Science ISBN: 9783540221562

Přístupová URL adresa: https://link.springer.com/chapter/10.1007%2F978-3-540-24847-7_4
https://rd.springer.com/chapter/10.1007%2F978-3-540-24847-7_4
https://dblp.uni-trier.de/db/conf/ants/ants2004.html#AgarwalF04
http://cs.au.dk/~gudmund/Documents/complquadgcd.pdf

Binary GCD Algorithm

Zdroj: Encyclopedia of Cryptography and Security ISBN: 9781441959058

Existence of a limiting distribution for the binary GCD algorithm

Autoři: Maze, Gérard¹ gmaze@math.unizh.ch

Zdroj: Journal of Discrete Algorithms. Mar2007, Vol. 5 Issue 1, p176-186. 11p.

Témata: Distribution (Probability theory), Binary number system, Algorithms

People: Brent, Richard

FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers

Autoři: Tudor Jebelean Bogdan Matasaru

Zdroj: Lecture Notes in Computer Science ISBN: 9783540678991

Přístupová URL adresa: https://link.springer.com/chapter/10.1007%2F3-540-44614-1_91
https://link.springer.com/content/pdf/10.1007%2F3-540-44614-1_91.pdf
https://rd.springer.com/chapter/10.1007/3-540-44614-1_91
https://dblp.uni-trier.de/db/conf/fpl/fpl2000.html#MatasaruJ00
https://doi.org/10.1007/3-540-44614-1_91

New Modified Euclidean and Binary Greatest Common Divisor Algorithm.

Autoři: Tembhurne, Jitendra V. Sathe, Shailesh R.

Zdroj: IETE Journal of Research; Dec2016, Vol. 62 Issue 6, p852-858, 7p

Témata: DIVISOR theory, EUCLIDEAN geometry, ARITHMETIC, CRYPTOGRAPHY, PARALLEL algorithms

Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding

Autoři: Francisco Argüello

Zdroj: Electronics Letters. 41:754-755

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: http://ieeexplore.ieee.org/xpl/abstractAuthors.jsp?reload=true&arnumber=1459884
https://ui.adsabs.harvard.edu/abs/2005ElL....41..754A/abstract
https://digital-library.theiet.org/content/journals/10.1049/el_20050769
http://ieeexplore.ieee.org/document/1459884/

On Schönhage's Algorithm and Subquadratic Integer GCD Computation

Autoři: Möller, Niels

Zdroj: Mathematics of Computation, 2008 Jan 01. 77(261), 589-607.

Přístupová URL adresa: https://www.jstor.org/stable/40234522

Analysis of Another Left Shift Binary GCD Algorithm

Autoři: Chen, Yan-heng

Thesis Advisors: Chun-I Fan, Chia-Mei Chen, D. J. Guan

Témata: Self-test, Modular inverse, GCD

Popis souboru: application/pdf

Dostupnost: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0714109-121741

An analysis of the generalized binary GCD algorithm

Autoři: Jonathan P. Sorenson The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Jonathan P. Sorenson The Pennsylvania State University CiteSeerX Archives

Zdroj: http://euclid.butler.edu/~sorenson/papers/genbin.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.1142; http://euclid.butler.edu/~sorenson/papers/genbin.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.1142
http://euclid.butler.edu/~sorenson/papers/genbin.pdf

Existence of a Limiting Distribution for the Binary GCD Algorithm ∗

Autoři: Gérard Maze The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Gérard Maze The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/math/0504426v1.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.240.7861; http://arxiv.org/pdf/math/0504426v1.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.240.7861
http://arxiv.org/pdf/math/0504426v1.pdf

Extending the binary GCD algorithm

Autoři: Graham H. Norton

Zdroj: Lecture Notes in Computer Science ISBN: 9783540167761

Přístupová URL adresa: https://link.springer.com/chapter/10.1007%2F3-540-16776-5_741
https://rd.springer.com/chapter/10.1007/3-540-16776-5_741
https://dblp.uni-trier.de/db/conf/aaecc/aaecc1985.html#Norton85

Analysis of Another Left Shift Binary GCD Algorithm

另一種左移最大公因數演算法的分析

Autoři: Yan-heng Chen 陳彥亨

Thesis Advisors: Yan-heng Chen 陳彥亨

Popis souboru: 40

Dostupnost: http://ndltd.ncl.edu.tw/handle/c23hr9

Extending Stein’s GCD algorithm and a comparison to Euclid’s GCD algorithm

Autoři: Barkema, J.R. Tel, Gerard (Thesis Advisor)

Témata: Bachelor Thesis, Student Thesis

URL: https://studenttheses.uu.nl/handle/20.500.12932/33194

MODULO q GREATEST COMMON DIVISOR ALGORITHMS.

Autoři: Szabó, Sándor

Zdroj: Serdica Mathematical Journal; 2020, Vol. 46 Issue 2, p121-134, 14p, 10 Charts

Témata: QUADRATIC fields, ALGORITHMS, EUCLIDEAN algorithm