Výsledky vyhledávání - binary gcd algorithm

  1. 1
  2. 2

    Memory Tampering Attack on Binary GCD Based Inversion Algorithms Autor Aldaya, Alejandro Cabrera, Brumley, Billy Bob, Sarmiento, Alejandro J. Cabrera, Sánchez-Solano, Santiago

    ISSN: 0885-7458, 1573-7640
    Vydáno: New York Springer US 01.08.2019
    “… limit the output space of binary GCD based modular inversion algorithm implementations…”
    Získat plný text
    Journal Article
  3. 3

    Existence of a limiting distribution for the binary GCD algorithm Autor Maze, Gérard

    ISSN: 1570-8667, 1570-8675
    Vydáno: Elsevier B.V 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ískat plný text
    Journal Article
  4. 4

    On Acceleration of the k-ary GCD Algorithm Autor Amer, I., Ishmukhametov, S.T.

    ISSN: 2541-7746, 2500-2198
    Vydáno: Kazan Federal University 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ískat plný text
    Journal Article
  5. 5

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

    ISSN: 0013-5194, 1350-911X
    Vydáno: London Institution of Electrical Engineers 23.06.2005
    Vydáno v Electronics letters (23.06.2005)
    Získat plný text
    Journal Article
  6. 6

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

    ISSN: 0013-5194, 1350-911X
    Vydáno: Stevenage John Wiley & Sons, Inc 23.06.2005
    Vydáno 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ískat plný text
    Journal Article
  7. 7

    Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure Autor Yen, Sung-Ming, Chen, Chien-Ning, Moon, SangJae

    ISSN: 2190-8508, 2190-8516
    Vydáno: Berlin/Heidelberg Springer-Verlag 01.09.2012
    Vydáno 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ískat plný text
    Journal Article
  8. 8

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

    ISSN: 0098-9886, 1097-007X
    Vydáno: Chichester, UK John Wiley & Sons, Ltd 01.02.2017
    “…) computation using modified Binary GCD algorithm. We present the generalized design…”
    Získat plný text
    Journal Article
  9. 9

    Extending the binary gcd algorithms Autor Kubiak, Przemysław

    ISBN: 3110170469, 9783110170467
    Vydáno: Germany Walter de Gruyter GmbH 2001
    Získat plný text
    Kapitola
  10. 10

    Existence of a Limiting Distribution for the Binary GCD Algorithm Autor Maze, Gerard

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 06.06.2005
    Vydáno 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ískat plný text
    Paper
  11. 11

    A redundant binary Euclidean GCD algorithm Autor Parikh, S.N., Matula, D.W.

    ISBN: 0818691514, 9780818691515
    Vydáno: IEEE Comput. Soc. Press 1991
    “…An efficient implementation of the Euclidean GCD (greatest common divisor) algorithm employing the redundant binary number system is described…”
    Získat plný text
    Konferenční příspěvek
  12. 12

    A modular integer GCD algorithm Autor Weber, Kenneth, Trevisan, Vilmar, Martins, Luiz Felipe

    ISSN: 0196-6774, 1090-2678
    Vydáno: San Diego, CA Elsevier Inc 01.02.2005
    Vydáno 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ískat plný text
    Journal Article
  13. 13

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

    ISSN: 2569-2925
    Vydáno: Ruhr-Universität Bochum 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ískat plný text
    Journal Article
  14. 14

    An Efficient All-to-All GCD Algorithm for Low Entropy RSA Key Factorization Autor Pelofske, Elijah

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 06.05.2024
    Vydáno 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ískat plný text
    Paper
  15. 15

    Hardware Implementation of Fast Division Algorithm for GF(2m) Autor Min-Sup Kang, Kwang-Ho Lee

    ISBN: 8955191294, 9788955191295
    Vydáno: IEEE 2006
    “… 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…”
    Získat plný text
    Konferenční příspěvek
  16. 16

    GCD Computation of n Integers Autor Dwivedi, Shri Prakash

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 25.07.2014
    Vydáno 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ískat plný text
    Paper
  17. 17

    The Mixed Binary Euclid Algorithm Autor Sedjelmaci, Sidi Mohamed

    ISSN: 1571-0653, 1571-0653
    Vydáno: Elsevier B.V 01.12.2009
    “…We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches…”
    Získat plný text
    Journal Article
  18. 18

    Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings Autor Busch, J.

    ISSN: 0747-7171, 1095-855X
    Vydáno: Elsevier Ltd 01.06.2009
    Vydáno 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ískat plný text
    Journal Article
  19. 19

    Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers Autor Damgård, Ivan Bjerre, Frandsen, Gudmund Skovbjerg

    ISSN: 0747-7171, 1095-855X
    Vydáno: Elsevier Ltd 01.06.2005
    Vydáno 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ískat plný text
    Journal Article
  20. 20

    Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor Autor Jie Chen, Watson, William, Chen, Mayee F.

    Vydáno: IEEE 01.08.2014
    “… This paper presents a parallel binary GCD algorithm and its implementation for big integers on the Intel Xeon Phi coprocessor…”
    Získat plný text
    Konferenční příspěvek