A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

Published:2008 Issue: Volume: Page:297-315
ISSN:0302-9743
Container-title:Pairing-Based Cryptography – Pairing 2008
language:
Short-container-title:

Author:

Beuchat Jean-Luc,Brisebarre Nicolas,Detrey Jérémie,Okamoto Eiji,Rodríguez-Henríquez Francisco

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-85538-5_20

Reference34 articles.

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

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

3. Lecture Notes in Computer Science;J.-L. Beuchat,2007

4. Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Rodríguez-Henríquez, F.: A comparison between hardware accelerators for the modified Tate pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ . Cryptology ePrint Archive, Report 2008/115 (2008)

5. Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and arithmetic operators for computing the η T pairing in characteristic three. IEEE Transactions on Computers 57(11) (November 2008) (to appear) An extended version is available as Report 2007/417 of the Cryptology ePrint Archive

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

1. Koblitz Curves over Quadratic Fields;Journal of Cryptology;2018-04-25

2. An efficient implementation of pairing-based cryptography on MSP430 processor;The Journal of Supercomputing;2017-07-17

3. A survey of some recent bit-parallel GF(2n) multipliers;Finite Fields and Their Applications;2015-03

4. Bit-Parallel Cubing Computation over GF(3^m) for Irreducible Trinomials;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2014

5. Fast Symmetric Pairing Revisited;Pairing-Based Cryptography – Pairing 2013;2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3