Faster $\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves
From MaRDI portal
Publication:3642938
DOI10.1007/978-3-642-04138-9_18zbMath1189.14031OpenAlexW2218949749MaRDI QIDQ3642938
Frederik Vercauteren, Junfeng Fan, Ingrid Verbauwhede
Publication date: 10 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04138-9_18
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$, Parallelizing the Weil and Tate Pairings