Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.94349OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899270

Robert Granger, Nigel P. Smart, Dan Page

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11792086

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20)

Related Items (12)

Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ Compact structure-preserving signatures with almost tight security ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition ⋮ A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ ⋮ Finding Invalid Signatures in Pairing-Based Batches ⋮ Point Decomposition Problem in Binary Elliptic Curves ⋮ A Schnorr-Like Lightweight Identity-Based Signature Scheme ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ On Software Parallel Implementation of Cryptographic Pairings ⋮ Another Approach to Pairing Computation in Edwards Coordinates

This page was built for publication: Algorithmic Number Theory