Algorithmic Number Theory
From MaRDI portal
Publication:5899270
DOI10.1007/11792086zbMath1143.94349WikidataQ29400612 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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11G20: Curves over finite and local fields
Related Items
Finding Invalid Signatures in Pairing-Based Batches, Another Approach to Pairing Computation in Edwards Coordinates, Compact structure-preserving signatures with almost tight security, Memory-saving computation of the pairing final exponentiation on BN curves, A taxonomy of pairing-friendly elliptic curves, Point Decomposition Problem in Binary Elliptic Curves, Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves, On the Final Exponentiation for Calculating Pairings on Ordinary 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}$, A Schnorr-Like Lightweight Identity-Based Signature Scheme, On Software Parallel Implementation of Cryptographic Pairings