Efficient subgroup exponentiation in quadratic and sixth degree extensions

M. Stam, A.K. Lenstra

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

21 Citations (Scopus)

Abstract

This paper describes several speedups for computation in the order p + 1 subgroup of F p * 2 and the order p 2 - p + 1 subgroup of F p * 6 These results are in a way complementary to LUC and XTR, where computations in these groups are sped up using trace maps. As a side result, we present an efficient method for XTR with p = 3 mod 4.
Original languageEnglish
Title of host publicationCryptographic Hardware and Embedded Systems (CHES 2002, Redwood Shores CA, USA, August 13-15, 2002)
EditorsB.S. Kaliski, Jr., Ç.K. Koç, C. Paar
Place of PublicationBerlin
PublisherSpringer
Pages318-332
ISBN (Print)3-540-00409-2
DOIs
Publication statusPublished - 2003
Eventconference; San Francisco Bay (Redwood City), USA -
Duration: 1 Jan 2003 → …

Publication series

NameLecture Notes in Computer Science
Volume2523
ISSN (Print)0302-9743

Conference

Conferenceconference; San Francisco Bay (Redwood City), USA
Period1/01/03 → …
OtherSan Francisco Bay (Redwood City), USA

Fingerprint Dive into the research topics of 'Efficient subgroup exponentiation in quadratic and sixth degree extensions'. Together they form a unique fingerprint.

  • Cite this

    Stam, M., & Lenstra, A. K. (2003). Efficient subgroup exponentiation in quadratic and sixth degree extensions. In B. S. Kaliski, Jr., Ç. K. Koç, & C. Paar (Eds.), Cryptographic Hardware and Embedded Systems (CHES 2002, Redwood Shores CA, USA, August 13-15, 2002) (pp. 318-332). (Lecture Notes in Computer Science; Vol. 2523). Springer. https://doi.org/10.1007/3-540-36400-5_24