Open Access System for Information Sharing

Login Library

 

Article
Cited 22 time in webofscience Cited 25 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorChoie, Y-
dc.contributor.authorLee, E-
dc.date.accessioned2016-03-31T12:33:56Z-
dc.date.available2016-03-31T12:33:56Z-
dc.date.created2009-08-06-
dc.date.issued2004-01-
dc.identifier.issn0302-9743-
dc.identifier.other2004-OAK-0000004087-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/18043-
dc.description.abstractSince Tate pairing was suggested to construct a cryptosystem, fast computation of Tate pairing has been researched recently. Barreto et. al[3] and Galbraith[8] provided efficient algorithms for Tate pairing on y(2) = x(3) - x + b in characteristic 3 and Duursma and Lee[6] gave a closed formula for Tate pairing on y(2) = x(P) - x + d in characteristic p. In this paper, we present completely general and explicit formulae for computing of Tate pairing on hyperelliptic curves of genus 2. We have computed Tate parings on a supersingular hyperelliptic curve over prime fields and the detailed algorithms are explained. This is the first attempt to present the implementation results for Tate pairing on a hyperelliptic curve of genus bigger than 1.-
dc.description.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherSPRINGER-VERLAG BERLIN-
dc.relation.isPartOfLECTURE NOTES IN COMPUTER SCIENCE-
dc.subjectelliptic curve cryptosystem-
dc.subjectTate pairing implementation-
dc.subjecthyperelliptic curve cryptosystem-
dc.titleImplementation of Tate pairing on hyperelliptic curves of genus 2-
dc.typeArticle-
dc.contributor.college수학과-
dc.identifier.doi10.1007/978-3-540-24691-6_9-
dc.author.googleChoie, Y-
dc.author.googleLee, E-
dc.relation.volume2971-
dc.relation.startpage97-
dc.relation.lastpage111-
dc.contributor.id10069856-
dc.relation.journalLECTURE NOTES IN COMPUTER SCIENCE-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCIE-
dc.collections.nameConference Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationLECTURE NOTES IN COMPUTER SCIENCE, v.2971, pp.97 - 111-
dc.identifier.wosid000189499400009-
dc.date.tcdate2019-01-01-
dc.citation.endPage111-
dc.citation.startPage97-
dc.citation.titleLECTURE NOTES IN COMPUTER SCIENCE-
dc.citation.volume2971-
dc.contributor.affiliatedAuthorChoie, Y-
dc.identifier.scopusid2-s2.0-23944466280-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc22-
dc.type.docTypeArticle; Proceedings Paper-
dc.subject.keywordAuthorelliptic curve cryptosystem-
dc.subject.keywordAuthorTate pairing implementation-
dc.subject.keywordAuthorhyperelliptic curve cryptosystem-
dc.relation.journalWebOfScienceCategoryComputer Science, Theory & Methods-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

최영주CHOIE, YOUNG JU
Dept of Mathematics
Read more

Views & Downloads

Browse