Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Toom–Cook multiplication"'
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.
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.
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2020, Iss 2 (2020)
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively. Due to its faster quasilinear time complexity, it has been the preferred cho
Externí odkaz:
https://doaj.org/article/69835e0c88114e4f954875076183b0e5
Publikováno v:
Applied Sciences, Vol 11, Iss 9, p 3752 (2021)
In classical computation, Toom–Cook is one of the multiplication methods for large numbers which offers faster execution time compared to other algorithms such as schoolbook and Karatsuba multiplication. For the use in quantum computation, prior wo
Externí odkaz:
https://doaj.org/article/e643cc3b20bd4043b6abffcda0300a4a
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.
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2020, Iss 2 (2020)
[Abstract] Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively. Due to its faster quasilinear time complexity, it has been the pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01b06a3ade941b02f7f415b2ba1478c2
https://doi.org/10.13154/tches.v2020.i2.222-244
https://doi.org/10.13154/tches.v2020.i2.222-244
Publikováno v:
IEEE Transactions on Circuits and Systems II: Express Briefs. 66:1401-1405
Toom–Cook multiplication is a theoretically more efficient multiplication algorithm than traditionally used Karatsuba and schoolbook multiplication but is rarely used in practical hardware designs due to its inherent exact divisions, which are time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d87f922b53712e47d6dd94bdbd89f04
https://doi.org/10.1109/tcsii.2018.2886962
https://doi.org/10.1109/tcsii.2018.2886962
Publikováno v:
IEEE Transactions on Circuits and Systems I: Regular Papers. 66:1003-1016
In this paper, a high-speed elliptic curve cryptography (ECC) processor specialized for primes recommended by the National Institute of Standards and Technology (NIST) was constructed. Toom–Cook multiplication without division was proposed to imple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62dede2d249447f7c1d5e6929249cb60
https://doi.org/10.1109/tcsi.2018.2878598
https://doi.org/10.1109/tcsi.2018.2878598
Publikováno v:
Applied Sciences, Vol 11, Iss 3752, p 3752 (2021)
Applied Sciences
Volume 11
Issue 9
Applied Sciences
Volume 11
Issue 9
In classical computation, Toom–Cook is one of the multiplication methods for large numbers which offers faster execution time compared to other algorithms such as schoolbook and Karatsuba multiplication. For the use in quantum computation, prior wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efe2d3ee6b8a2ccd567e67b5f84a4de4
https://www.mdpi.com/2076-3417/11/9/3752
https://www.mdpi.com/2076-3417/11/9/3752
Publikováno v:
ISCAS
Approximate Computing has paved way for elaborate savings in design area and latency of modern system architectures processing images or signals, by a deliberate yet tolerable loss of functional accuracy. This paper thus proposes a design of an appro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7da95117cdd35b8a35df9f1891091389
https://doi.org/10.1109/iscas45731.2020.9181069
https://doi.org/10.1109/iscas45731.2020.9181069