scientific article; zbMATH DE number 1979293

zbMath1020.94525MaRDI QIDQ4425716

Martijn Stam, Arjen K. Lenstra

Publication date: 11 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2523/25230318.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite fieldXTRcyclotomic polynomialLUC

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (8)

Effective compression maps for torus-based cryptography ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ XTR Algorithm: Efficient and Compact Subgroup Trace Representation ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Efficient Compression of SIDH Public Keys ⋮ Exponentiation in Pairing-Friendly Groups Using Homomorphisms ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Improving the computation of the optimal ate pairing for a high security level

This page was built for publication: