DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hwang, YH | - |
dc.contributor.author | Sim, SG | - |
dc.contributor.author | Lee, PJ | - |
dc.date.accessioned | 2016-03-31T12:25:04Z | - |
dc.date.available | 2016-03-31T12:25:04Z | - |
dc.date.created | 2009-03-20 | - |
dc.date.issued | 2004-01 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.other | 2004-OAK-0000004314 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/17889 | - |
dc.description.abstract | Finite field GF(2(m)) is important to many practical application of modern communication. Exponentiation, division, and inversion are time-consuming operations that slow down the arithmetic over finite field GF(2(m)). They can be implemented by the iterative application of multiplication and squaring. However, it is efficient to use AB(2) operations rather than multiplication and squaring for computing exponentiation, division, and inversion. In ICCSA 2003 Lee et al. proposed a bit-serial AB(2) multiplier, which is more efficient than previous works. We propose new AB(2) multipliers using irreducible AOP (All One Polynomial) in this paper. Our multipliers require a smaller numbers of gates and have less latency than Lee et al.'s multiplier. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.relation.isPartOf | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.subject | bit-serial multiplier | - |
dc.subject | finite field | - |
dc.subject | exponentiation | - |
dc.subject | irreducible AOP | - |
dc.subject | FINITE-FIELDS | - |
dc.subject | ALL-ONE | - |
dc.subject | POLYNOMIALS | - |
dc.title | Bit-serial multipliers for exponentiation and division in GF(2(m)) using irreducible AOP | - |
dc.type | Article | - |
dc.contributor.college | 전자전기공학과 | - |
dc.author.google | Hwang, YH | - |
dc.author.google | Sim, SG | - |
dc.author.google | Lee, PJ | - |
dc.relation.volume | 3043 | - |
dc.relation.startpage | 442 | - |
dc.relation.lastpage | 450 | - |
dc.contributor.id | 10051689 | - |
dc.relation.journal | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Conference Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | LECTURE NOTES IN COMPUTER SCIENCE, v.3043, pp.442 - 450 | - |
dc.identifier.wosid | 000221909000055 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 450 | - |
dc.citation.startPage | 442 | - |
dc.citation.title | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.citation.volume | 3043 | - |
dc.contributor.affiliatedAuthor | Lee, PJ | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 1 | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.subject.keywordPlus | FINITE-FIELDS | - |
dc.subject.keywordPlus | ALL-ONE | - |
dc.subject.keywordPlus | POLYNOMIALS | - |
dc.subject.keywordAuthor | bit-serial multiplier | - |
dc.subject.keywordAuthor | finite field | - |
dc.subject.keywordAuthor | exponentiation | - |
dc.subject.keywordAuthor | irreducible AOP | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Telecommunications | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.