Zobrazeno 1 - 10
of 114
pro vyhledávání: '"Ku-Young Chang"'
Space Efficient $GF(2^m)$ Multiplier for Special Pentanomials Based on $n$ -Term Karatsuba Algorithm
Publikováno v:
IEEE Access, Vol 8, Pp 27342-27360 (2020)
Recently, new multiplication schemes over the binary extension field GF(2m) based on an n-term Karatsuba algorithm have been proposed for irreducible trinomials. In this paper, we extend these schemes for trinomials to any irreducible polynomials. We
Externí odkaz:
https://doaj.org/article/ba391f2954334f7abf850a2492266664
Publikováno v:
IEEE Access, Vol 8, Pp 173491-173507 (2020)
Recently, hybrid multiplication schemes over the binary extension field $GF(2^{m})$ based on $n$ -term Karatsuba algorithm (KA) have been proposed for irreducible trinomials. Their complexities depend on a decomposition of $m$ and the choice of a gen
Externí odkaz:
https://doaj.org/article/70fbca0e60ac43e98eae7319ae38a59d
Publikováno v:
IEEE Access, Vol 7, Pp 27047-27064 (2019)
We propose bit-parallel GF(2m) multipliers for irreducible trinomials using an n-term Karatsuba algorithm and Mastrovito approach, which are generalizations of the newly proposed multiplication scheme for a specific trinomial. The complexities of the
Externí odkaz:
https://doaj.org/article/8a5672dbef2a4bd08ce36da3f338199e
Publikováno v:
IEEE Access, Vol 6, Pp 26578-26587 (2018)
At present, there is a considerable increase in the amount of data stored in storage services, along with dramatic evolution of networking techniques. In storage services with huge data, the storage servers may want to reduce the volume of stored dat
Externí odkaz:
https://doaj.org/article/2c7968915a234ebc924fc78c351d1ee1
Publikováno v:
Energies, Vol 13, Iss 11, p 2742 (2020)
Deduplication of encrypted data is a significant function for both the privacy of stored data and efficient storage management. Several deduplication techniques have been designed to provide improved security or efficiency. In this study, we focus on
Externí odkaz:
https://doaj.org/article/687155cff4ea4cd6a59fee51fa3dc63f
Publikováno v:
IEEE Access, Vol 8, Pp 173491-173507 (2020)
Recently, hybrid multiplication schemes over the binary extension field $GF(2^{m})$ based on $n$ -term Karatsuba algorithm (KA) have been proposed for irreducible trinomials. Their complexities depend on a decomposition of $m$ and the choice of a gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6000e5766a98882067b3ca7ca35b595e
https://ieeexplore.ieee.org/document/9195527/
https://ieeexplore.ieee.org/document/9195527/
Space Efficient $GF(2^m)$ Multiplier for Special Pentanomials Based on $n$ -Term Karatsuba Algorithm
Publikováno v:
IEEE Access, Vol 8, Pp 27342-27360 (2020)
Recently, new multiplication schemes over the binary extension field $GF(2^{m})$ based on an $n$ -term Karatsuba algorithm have been proposed for irreducible trinomials. In this paper, we extend these schemes for trinomials to any irreducible polynom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3ec0866cc9c3f3d7543b1148663e7c7
https://ieeexplore.ieee.org/document/8984363/
https://ieeexplore.ieee.org/document/8984363/
Publikováno v:
IEEE Access. 7:27047-27064
We propose bit-parallel GF(2 m ) multipliers for irreducible trinomials using an n-term Karatsuba algorithm and Mastrovito approach, which are generalizations of the newly proposed multiplication scheme for a specific trinomial. The complexities of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b36e16f1fdc38e33f0fdb7e0a874402
https://doi.org/10.1109/access.2019.2901242
https://doi.org/10.1109/access.2019.2901242
Publikováno v:
IEEE Access, Vol 7, Pp 27047-27064 (2019)
We propose bit-parallel GF(2m) multipliers for irreducible trinomials using an n-term Karatsuba algorithm and Mastrovito approach, which are generalizations of the newly proposed multiplication scheme for a specific trinomial. The complexities of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doajarticles::853e3885241d430603bebe0f51905a8c
https://ieeexplore.ieee.org/document/8649611/
https://ieeexplore.ieee.org/document/8649611/
Publikováno v:
IEEE Transactions on Computers. 67:1794-1805
Multiplication schemes based on Toeplitz matrix-vector product (TMVP) have been proposed by many researchers. TMVP can be computed using the recursive two-way and three-way split methods, which are composed of four blocks. Among them, we improve the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f04505fefebdd4baddf55f9ddb5c2b75
https://doi.org/10.1109/tc.2018.2836425
https://doi.org/10.1109/tc.2018.2836425