Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves-Reference-Cited by-同舟云学术

Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves

Published:2010 Issue: Volume: Page:397-416
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Estibals Nicolas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17455-1_25.pdf

Reference49 articles.

1. Lecture Notes in Computer Science;L.M. Adleman,1994

2. Barenghi, A., Bertoni, G., Breveglieri, L., Pelosi, G.: A FPGA coprocessor for the cryptographic Tate pairing over $\mathbb{F}_p$ . In: Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2008). IEEE Computer Society, Los Alamitos (2008)

3. Lecture Notes in Computer Science;P.S.L.M. Barreto,2002

4. Lecture Notes in Computer Science;P.S.L.M. Barreto,2005

5. Barreto, P., Galbraith, S., hÉigeartaigh, C.Ó., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42(3), 239–271 (2007)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. FlexiPair: An Automated Programmable Framework for Pairing Cryptosystems;IEEE Transactions on Computers;2021

2. Decentralized Attribute-Based Encryption and Signatures;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2020-01-01

3. A New Family of Pairing-Friendly Elliptic Curves;Arithmetic of Finite Fields;2018

4. Karatsuba-like formulae and their associated techniques;Journal of Cryptographic Engineering;2017-03-06

5. Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a,b)$-Way Karatsuba Algorithm;IEEE Transactions on Circuits and Systems I: Regular Papers;2015