Zobrazeno 1 - 10
of 3 082
pro vyhledávání: '"Extended Euclidean Algorithm"'
Publikováno v:
In Information Sciences February 2020 512:641-660
Autor:
LEVRIE, PAUL, PENNE, RUDI
Publikováno v:
The Mathematical Gazette, 2016 Mar 01. 100(547), 147-149.
Externí odkaz:
http://www.jstor.org/stable/44161724
Autor:
Thi-Nhung Nguyen
Publikováno v:
Tạp chí Khoa học - Trường Đại học Sư phạm Hà Nội 2. 1:53-63
RSA cryptography is a strong encryption method widely used in online transactions. Using the extended Euclidean algorithm is an important and efficient technique for finding the secret key in RSA cryptography. This study provides an implementation of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21e0911cdcc0fb974fdb3cad99ac8543
https://doi.org/10.56764/hpu2.jos.2023.1.2.53-63
https://doi.org/10.56764/hpu2.jos.2023.1.2.53-63
Autor:
Kampf, Sabine, Bossert, Martin
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).
Comment: ISIT Austin 2010
Comment: ISIT Austin 2010
Externí odkaz:
http://arxiv.org/abs/1006.0170
Autor:
Feig, Ephraim, Feig, Vivian
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
Comment: 2-page c
Comment: 2-page c
Externí odkaz:
http://arxiv.org/abs/0801.2187
Autor:
Ergin Diko, Mushab Ibraimi
Publikováno v:
Vision International Refereed Scientific Journal. 8:161-175
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::941b58a316e451114a88bcc6749b40e8
https://doi.org/10.55843/ivisum23810161d
https://doi.org/10.55843/ivisum23810161d
Publikováno v:
Information Sciences. 512:641-660
Cloud computing gives resource-constrained clients great conveniences to outsource exorbitant computations to a public cloud. The extended Euclidean algorithm with large-scale polynomials over finite fields is fundamental and widespread in computer s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2fbbdc322a433aabbb0e6a188b5823a
https://doi.org/10.1016/j.ins.2019.10.007
https://doi.org/10.1016/j.ins.2019.10.007
Autor:
A A Ibrahim
Publikováno v:
International Journal of Mathematics and Computer Research.
Finite fields is considered to be the most widely used algebraic structures today due to its applications in cryptography, coding theory, error correcting codes among others. This paper reports the use of extended Euclidean algorithm in computing the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7095718553bdb62ca51fd3d7daef9856
https://doi.org/10.47191/ijmcr/v9i9.02
https://doi.org/10.47191/ijmcr/v9i9.02
Finite fields is considered to be the most widely used algebraic structures today due to its applications in cryptography, coding theory, error correcting codes among others. This paper reports the use of extended Euclidean algorithm in computing the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2659::4bb33d32257dcc3ce5bba1f764d66bda
https://zenodo.org/record/5526326
https://zenodo.org/record/5526326
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.