Some Efficient Algorithms for the Final Exponentiation of ηT Pairing
スポンサーリンク
概要
- 論文の詳細を見る
Recently Tate pairing and its variations are attracted in cryptography. Their operations consist of a main iteration loop and a final exponentiation. The final exponentiation is necessary for generating a unique value of the bilinear pairing in the extension fields. The speed of the main loop has become fast by the recent improvements, e. g., the Duursma-Lee algorithm and ηT pairing. In this paper we discuss how to enhance the speed of the final exponentiation of the ηT pairing in the extension field F36n. Indeed, we propose some efficient algorithms using the torus T2(F33n) that can efficiently compute an inversion and a powering by 3n+1. Consequently, the total processing cost of computing the ηT pairing can be reduced by 16% for n=97.
- 電子情報通信学会の論文
- 2008-01-01
著者
-
SHIRASE Masaaki
Future University Hakodate (FUN)
-
Takagi Tsuyoshi
Future Univ.‐hakodate Hakodate‐shi Jpn
-
Okamoto Eiji
Univ. Tsukuba Tsukuba‐shi Jpn
-
Okamoto Eiji
University Of Tsukuba
-
Shirase Masaaki
Future University-hakodate
-
Shirase Masaaki
Future Univ. Hakodate (fun) Hakodate‐shi Jpn
関連論文
- An ID-SP-M4M Scheme and Its Security Analysis(Signatures,Cryptography and Information Security)
- Authorization-Limited Transformation-Free Proxy Cryptosystems and Their Security Analyses(Protocol, Cryptography and Information Security)
- A Share-Correctable Protocol for the Shamir Threshod Scheme and Its Application to Participant Enrollment (特集 多様な社会的責任を担うコンピュータセキュリティ技術)
- How to Verify the Threshold t of Shamir's (t,n)-Threshold Scheme (特集 多様な社会的責任を担うコンピュータセキュリティ技術)
- Universal Construction of a 12th Degree Extension Field for Asymmetric Pairing
- Efficient Implementation of the Pairing on Mobilephones Using BREW
- Generalized Powering Functions and Their Application to Digital Signatures(Digital Signature, Cryptography and Information Security)
- Distributed Noise Generation for Density Estimation Based Clustering without Trusted Third Party
- Security and Correctness Analysis on Privacy-Preserving k-Means Clustering Schemes
- Defeating Simple Power Analysis on Koblitz Curves(Discrete Mathematics and Its Applications)
- Security Analysis of the SPA-Resistant Fractional Width Method(Elliptic Curve Cryptography, Cryptography and Information Security)
- A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems(Discrete Mathematics and Its Applications)
- Universal Construction of a 12th Degree Extension Field for Asymmetric Pairing
- Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3
- Proposal for New E-cash System Using Message Recovery Signature (特集 情報セキュリティの理論と応用)
- A More Compact Representation of XTR Cryptosystem
- Efficient Hyperelliptic Curve Cryptosystems Using Theta Divisors(Elliptic Curve Cryptography, Cryptography and Information Security)
- Some Efficient Algorithms for the Final Exponentiation of ηT Pairing
- Universal ηT pairing algorithm over arbitrary extension degree (ワイドバンドシステム)
- Universal ηT pairing algorithm over arbitrary extension degree (情報セキュリティ)
- Universal ηT pairing algorithm over arbitrary extension degree (情報理論)
- Forecasting of Information Security Related Incidents: Amount of Spam Messages as a Case Study
- Efficient Implementation of Pairing-Based Cryptography on a Sensor Node
- Special Section on Discrete Mathematics and Its Applications
- An Approach to Perform Quantitative Information Security Risk Assessment in IT Landscapes
- Detection of Unexpected Services and Communication Paths in Networked Systems
- Detection of Unexpected Services and Communication Paths in Networked Systems