Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이향숙 | * |
dc.contributor.author | 조국화 | * |
dc.date.accessioned | 2019-04-16T16:30:07Z | - |
dc.date.available | 2019-04-16T16:30:07Z | - |
dc.date.issued | 2019 | * |
dc.identifier.issn | 1015-8634 | * |
dc.identifier.other | OAK-24619 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/249608 | - |
dc.description.abstract | In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and Padro-Saez algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and Padro-Saez algorithm by using a smaller base for exponentiation. Our method can reduce the average number of F-q multiplications. | * |
dc.language | English | * |
dc.publisher | KOREAN MATHEMATICAL SOC | * |
dc.subject | cube root algorithm | * |
dc.subject | finite field | * |
dc.subject | Pocklington algorithm | * |
dc.subject | Adleman-Manders-Miller algorithm | * |
dc.subject | Cipolla-Lehmer algorithm | * |
dc.title | IMPROVING THE POCKLINGTON AND PADRO-SAEZ CUBE ROOT ALGORITHM | * |
dc.type | Article | * |
dc.relation.issue | 2 | * |
dc.relation.volume | 56 | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.index | KCI | * |
dc.relation.startpage | 277 | * |
dc.relation.lastpage | 283 | * |
dc.relation.journaltitle | BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY | * |
dc.identifier.doi | 10.4134/BKMS.b160769 | * |
dc.identifier.wosid | WOS:000462483900001 | * |
dc.author.google | Cho, Gook Hwa | * |
dc.author.google | Lee, Hyang-Sook | * |
dc.contributor.scopusid | 이향숙(34870017000) | * |
dc.contributor.scopusid | 조국화(55700404300) | * |
dc.date.modifydate | 20240201081004 | * |