An improvement of tate paring with supersingular curve

Akito Kumano; Yasuyuki Nogami

doi:10.1109/ICISSEC.2015.7370982

An improvement of tate paring with supersingular curve

Akito Kumano, Yasuyuki Nogami

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

Vector decomposition problem has been proposed on some supersingular curves whose embedding degree is 2 for example. In order to apply the problem as a trapdoor for some innovative cryptosystems, it is necessary to make pairing-related calculations more efficient. Our previous work has considered an approach for Tate pairing on a supersingular curve of embedding degree 2 over extension field of extension degree 2. It improved both Miller's algorithm and final exponentiation that was required for the Tate pairing. In detail, one multiplication in the calculation of Miller's loop was eliminated by using a twist mapping. This paper shows a more improved calculation of pairing with some experimental result for the efficiency discussion.

Original language	English
Title of host publication	2015 IEEE 2nd International Conference on InformationScience and Security, ICISS 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Print)	9781467386111
DOIs	https://doi.org/10.1109/ICISSEC.2015.7370982
Publication status	Published - Jan 4 2016
Event	2nd IEEE International Conference on Information Science and Security, ICISS 2015 - Seoul, Korea, Republic of Duration: Dec 14 2015 → Dec 16 2015

Other

Other	2nd IEEE International Conference on Information Science and Security, ICISS 2015
Country/Territory	Korea, Republic of
City	Seoul
Period	12/14/15 → 12/16/15

ASJC Scopus subject areas

Safety, Risk, Reliability and Quality
Computer Networks and Communications
Information Systems

Access to Document

10.1109/ICISSEC.2015.7370982

Cite this

Kumano, A & Nogami, Y 2016, An improvement of tate paring with supersingular curve. in 2015 IEEE 2nd International Conference on InformationScience and Security, ICISS 2015., 7370982, Institute of Electrical and Electronics Engineers Inc., 2nd IEEE International Conference on Information Science and Security, ICISS 2015, Seoul, Korea, Republic of, 12/14/15. https://doi.org/10.1109/ICISSEC.2015.7370982

@inproceedings{6fcf23ba2abf44359d33403c98acd912,

title = "An improvement of tate paring with supersingular curve",

abstract = "Vector decomposition problem has been proposed on some supersingular curves whose embedding degree is 2 for example. In order to apply the problem as a trapdoor for some innovative cryptosystems, it is necessary to make pairing-related calculations more efficient. Our previous work has considered an approach for Tate pairing on a supersingular curve of embedding degree 2 over extension field of extension degree 2. It improved both Miller's algorithm and final exponentiation that was required for the Tate pairing. In detail, one multiplication in the calculation of Miller's loop was eliminated by using a twist mapping. This paper shows a more improved calculation of pairing with some experimental result for the efficiency discussion.",

author = "Akito Kumano and Yasuyuki Nogami",

year = "2016",

month = jan,

day = "4",

doi = "10.1109/ICISSEC.2015.7370982",

language = "English",

isbn = "9781467386111",

booktitle = "2015 IEEE 2nd International Conference on InformationScience and Security, ICISS 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2nd IEEE International Conference on Information Science and Security, ICISS 2015 ; Conference date: 14-12-2015 Through 16-12-2015",

}

TY - GEN

T1 - An improvement of tate paring with supersingular curve

AU - Kumano, Akito

AU - Nogami, Yasuyuki

PY - 2016/1/4

Y1 - 2016/1/4

N2 - Vector decomposition problem has been proposed on some supersingular curves whose embedding degree is 2 for example. In order to apply the problem as a trapdoor for some innovative cryptosystems, it is necessary to make pairing-related calculations more efficient. Our previous work has considered an approach for Tate pairing on a supersingular curve of embedding degree 2 over extension field of extension degree 2. It improved both Miller's algorithm and final exponentiation that was required for the Tate pairing. In detail, one multiplication in the calculation of Miller's loop was eliminated by using a twist mapping. This paper shows a more improved calculation of pairing with some experimental result for the efficiency discussion.

AB - Vector decomposition problem has been proposed on some supersingular curves whose embedding degree is 2 for example. In order to apply the problem as a trapdoor for some innovative cryptosystems, it is necessary to make pairing-related calculations more efficient. Our previous work has considered an approach for Tate pairing on a supersingular curve of embedding degree 2 over extension field of extension degree 2. It improved both Miller's algorithm and final exponentiation that was required for the Tate pairing. In detail, one multiplication in the calculation of Miller's loop was eliminated by using a twist mapping. This paper shows a more improved calculation of pairing with some experimental result for the efficiency discussion.

UR - http://www.scopus.com/inward/record.url?scp=84964575570&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964575570&partnerID=8YFLogxK

U2 - 10.1109/ICISSEC.2015.7370982

DO - 10.1109/ICISSEC.2015.7370982

M3 - Conference contribution

AN - SCOPUS:84964575570

SN - 9781467386111

BT - 2015 IEEE 2nd International Conference on InformationScience and Security, ICISS 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2nd IEEE International Conference on Information Science and Security, ICISS 2015

Y2 - 14 December 2015 through 16 December 2015

ER -

An improvement of tate paring with supersingular curve

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this