Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$

DOI10.1007/978-3-642-35999-6_12zbMath1327.94024OpenAlexW2118828585MaRDI QIDQ3455496

Christophe Negre, Jithra Adikari, M. Anwarul Hasan

Publication date: 4 December 2015

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35999-6_12

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

Cites Work

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Short signatures from the Weil pairing
• Efficient pairing computation on supersingular abelian varieties
• Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
• Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
• High Speed Flexible Pairing Cryptoprocessor on FPGA Platform
• FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
• High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields
• A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
• Faster $\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves
• Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
• Identity-Based Encryption from the Weil Pairing
• Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves
• Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves

This page was built for publication: Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$