Java implementation for pairing-based cryptosystems


Tan, Syh-Yuan and Heng, Swee-Huay and Goi, Bok-Min (2010) Java implementation for pairing-based cryptosystems. In: Computational Science and Its Applications – ICCSA 2010. Lecture Notes in Computer Science (6019). Springer Berlin Heidelberg, pp. 188-198. ISBN 978-3-642-12188-3

[img] Text
Java implementation for pairing-based cryptosystems.pdf
Restricted to Repository staff only

Download (240kB)


We present a Java implementation for Tate pairing over the supersingular curve y 2 = x 3 + x in \mathbbFp\mathbb{F}_p. We show some available optimisations for group operations by manipulating the mathematical equations. Besides, we also show that it is easy to hash a string into a point for our chosen parameters. A variant of Java’s BigInteger data type, namely CpxBigInteger is created to serve equation with complex number and the Java data types are constructed: Curve, Point and Line based on CpxBigInteger. Using these data types and J2SE JDK 1.6.0_02, we implement BLS identity-based identification (IBI) scheme, which is the first rigorously defined pairing-based IBI scheme. The timings show that the Tate pairing took only 133.12 milliseconds.

Item Type: Book Section
Additional Information: International Conference, Fukuoka, Japan, March 23-26, 2010, Proceedings, Part IV
Subjects: Q Science > Q Science (General)
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 30 Dec 2013 03:50
Last Modified: 30 Dec 2013 03:51


Downloads per month over past year

View ItemEdit (login required)