Efficient subgroup exponentiation in quadratic and sixth degree extensions

M Stam, AK Lenstra

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

Abstract

This paper describes several speedups for computation in the order $p+1$ subgroup of $\GaF{p^2}^*$ and the order $p^2-p+1$ subgroup of~$\GaF{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\equiv3\bmod 4$.
Translated title of the contribution Efficient subgroup exponentiation in quadratic and sixth degree extensions
Original languageEnglish
Title of host publicationCryptographic Hardware and Embedded Systems - CHES 2002
PublisherSpringer Berlin Heidelberg
Pages318 - 332
Number of pages14
Volume2523
ISBN (Print)3540004092
Publication statusPublished - 2002

Bibliographical note

Conference Proceedings/Title of Journal: Cryptographic Hardware and Embedded Systems - CHES 2002, 4th
International Workshop, Redwood Shores, CA, USA, August 13-15,
2002, Revised Papers

Fingerprint

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

Cite this