Applied Cryptography and Network Security

DOI10.1007/B98360zbMATH Open1103.68537OpenAlexW4301861138MaRDI QIDQ4680967FDOQ4680967

Authors: Palash Sarkar, Pradeep Kumar Mishra, Rana Barua 

Publication date: 13 June 2005

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

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

Recommendations

• Faster Multiplication in GF(2)[x]
• scientific article; zbMATH DE number 1955799
• Information Security and Cryptology - ICISC 2003
• Public Key Cryptography – PKC 2004
• Fast scalar multiplications on the curve \(v^2 = u^p-au-b\) over the finite field of characteristic \(p\)
• Publication:4502774
• Generalised fast algorithm for computing multiplicative inverses inGF(2^m)
• Accelerating twisted Ate pairing with Frobenius map, small scalar multiplication, and multi-pairing
• Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>

zbMATH Keywords

elliptic curveshyperelliptic curvesFrobenius mapnormal basislook-up tableScalar multiplicationwindow methods

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (2)

• Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography
• Information Security and Cryptology - ICISC 2003

This page was built for publication: Applied Cryptography and Network Security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680967)