Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Gook Hwa Cho"'
Publikováno v:
Linear Algebra and its Applications. 613:183-200
Computing HNF has a long history, but designing a storage efficient algorithm is a challenging issue for matrices of large sizes. One of the main challenges in the design of storage efficient HNF algorithm is to control the rank and the size of the i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd85d4d20e7c5c85b5df87d82c70ca0b
https://doi.org/10.1016/j.laa.2020.12.022
https://doi.org/10.1016/j.laa.2020.12.022
Publikováno v:
Fundamenta Informaticae. 177:115-139
In LATTE, a lattice based hierarchical identity-based encryption (HIBE) scheme, each hierarchical level user delegates a trapdoor basis to the next level by solving a generalized NTRU equation of level ℓ ≥ 3. For ℓ = 2, Howgrave-Graham, Pipher,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0374179206bf72d516c0ef64b302c63f
https://doi.org/10.3233/fi-2020-1982
https://doi.org/10.3233/fi-2020-1982
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 30:135-145
In this paper, we present a refinement of the Cipolla–Lehmer type algorithm given by H. C. Williams in 1972, and later improved by K. S. Williams and K. Hardy in 1993. For a given r-th power residue $$c\in \mathbb {F}_q$$ where r is an odd prime, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36733df45d3a080599039f2327d0f4f1
https://doi.org/10.1007/s00200-018-0362-2
https://doi.org/10.1007/s00200-018-0362-2
Autor:
Gook Hwa Cho
Publikováno v:
The Journal of Korean Institute of Communications and Information Sciences. 41:499-503
We study algorithms that can efficiently find cube roots by modifying Cipolla-Lehmer algorithm. In this paper, we present two type algorithms for finding cube roots in finite field, which improves Cipolla-Lehmer algorithm. If the number of multiplica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a378bb0afee942895ff98d28777b5ee4
https://doi.org/10.7840/kics.2016.41.5.499
https://doi.org/10.7840/kics.2016.41.5.499
Publikováno v:
Bulletin of the Korean Mathematical Society. 53:1-20
The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial selection (being used in factoring RSA challenge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a5151600e2e9cd24c7e7de7560c65eb
https://doi.org/10.4134/bkms.2016.53.1.001
https://doi.org/10.4134/bkms.2016.53.1.001
Publikováno v:
IEEE Transactions on Computers. 65:322-325
We present an $r$ -th root extraction algorithm over a finite field $\mathbb {F}_q$ . Our algorithm precomputes a primitive $r^s$ -th root of unity $\xi$ where $s$ is the largest positive integer satisfying $r^s| q-1$ , and is applicable for the case
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25cae512b433c13aada13cc32d8bb25a
https://doi.org/10.1109/tc.2015.2417562
https://doi.org/10.1109/tc.2015.2417562
Publikováno v:
Finite Fields and Their Applications. 67:101708
Let p be a prime such that p ≡ 1 ( mod 3 ) . Let c be a cubic residue ( mod p ) such that c p − 1 3 ≡ 1 ( mod p ) . In this paper, we present a refinement of Muller's algorithm for computing a cube root of c [11] , which also improves Williams'
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::517fb19464325438dd83befc13cc5ca0
https://doi.org/10.1016/j.ffa.2020.101708
https://doi.org/10.1016/j.ffa.2020.101708
Publikováno v:
Designs, Codes and Cryptography. 75:483-495
In this paper, we present a new cube root algorithm in the finite field $$\mathbb {F}_{q}$$ F q with $$q$$ q a power of prime, which extends the Cipolla---Lehmer type algorithms (Cipolla, Un metodo per la risolutione della congruenza di secondo grado
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8d7046d350cb17fd7554b6e8ca036bd
https://doi.org/10.1007/s10623-013-9910-8
https://doi.org/10.1007/s10623-013-9910-8
Publikováno v:
The Journal of Korean Institute of Communications and Information Sciences. :1031-1037
We study an algorithm that can efficiently find square roots and cube roots by modifying Tonelli-Shanks algorithm, which has an application in Number Field Sieve (NFS). The Number Field Sieve, the fastest known factoring algorithm, is a powerful tool
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2311116a9afbeae2118176e1fd74677
https://doi.org/10.7840/kics.2012.37a.12.1031
https://doi.org/10.7840/kics.2012.37a.12.1031