Factor-4 and 6 Compression of Cyclotomic Subgroups

  title={Factor-4 and 6 Compression of Cyclotomic Subgroups},
  author={Koray Karabina},
  journal={IACR Cryptology ePrint Archive},
Bilinear pairings derived from supersingular elliptic curves of embedding degrees 4 and 6 over finite fields F2m and F3m , respectively, have been used to implement pairing-based cryptographic protocols. The pairing values lie in certain prime-order subgroups of the cyclotomic subgroups of orders 22m +1 and 32m−3m +1, respectively, of the multiplicative groups F∗ 24m and F∗ 36m . It was previously known how to compress the pairing values over characteristic two fields by a factor of 2, and the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-4 of 4 extracted citations

The Final Exponentiation in Pairing-Based Cryptography

Barış Bülent Kırlar
View 4 Excerpts
Highly Influenced

Squaring in cyclotomic subgroups

IACR Cryptology ePrint Archive • 2010
View 1 Excerpt

Torus-Based Compression by Factor 4 and 6

IEEE Transactions on Information Theory • 2010

Double-Exponentiation in Factor-4 Groups and its Applications

IACR Cryptology ePrint Archive • 2009
View 9 Excerpts


Publications referenced by this paper.
Showing 1-10 of 28 references

Compressed Pairings

IACR Cryptology ePrint Archive • 2004
View 6 Excerpts
Highly Influenced

Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number

IACR Cryptology ePrint Archive • 2002
View 4 Excerpts
Highly Influenced

Efficient Algorithms for Pairing-Based Cryptosystems

IACR Cryptology ePrint Archive • 2002
View 5 Excerpts
Highly Influenced

Doing More with Fewer Bits

View 12 Excerpts
Highly Influenced

The XTR Public Key System

View 10 Excerpts
Highly Influenced

Evaluating recurrences of form Xm+n = f(Xm, Xn, Xm−n) via Lucas chains, www.cwi.nl/ftp/pmontgom/Lucas.ps.gz

P. Montgomery
December 13, • 1983
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…