default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasaaki Shirase
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i14]Masaaki Shirase:
Reduction of Search-LWE Problem to Integer Programming Problem. IACR Cryptol. ePrint Arch. 2023: 1162 (2023)- 2022
- [j16]Yuki Nanjo, Masaaki Shirase, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami:
Efficient Final Exponentiation for Cyclotomic Families of Pairing-Friendly Elliptic Curves with Any Prime Embedding Degrees. Int. J. Netw. Comput. 12(2): 317-338 (2022) - 2021
- [j15]Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami:
Improvement of Final Exponentiation for Pairings on BLS Curves with Embedding Degree 15. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 315-318 (2021) - [j14]Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami:
Restrictions of Integer Parameters for Generating Attractive BLS Subfamilies of Pairing-Friendly Elliptic Curves with Specific Embedding Degrees. Int. J. Netw. Comput. 11(2): 383-411 (2021) - [c25]Yuki Nanjo, Masaaki Shirase, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami:
Efficient Final Exponentiation for Pairings on Several Curves Resistant to Special TNFS. CANDAR 2021: 48-55 - [c24]Yuki Nanjo, Masaaki Shirase, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami:
A Construction Method of Final Exponentiation for a Specific Cyclotomic Family of Pairing-Friendly Elliptic Curves with Prime Embedding Degrees. CANDAR 2021: 148-154 - 2020
- [j13]Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami:
A Construction Method of an Isomorphic Map between Quadratic Extension Fields Applicable for SIDH. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(12): 1403-1406 (2020) - [j12]Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami:
A Performance Analysis and Evaluation of SIDH Applied Several Implementation-Friendly Quadratic Extension Fields. Int. J. Netw. Comput. 10(2): 227-241 (2020) - [c23]Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami:
Specific Congruence Classes of Integer Parameters for Generating BLS Curves for Fast Pairings. CANDAR (Workshops) 2020: 348-354
2010 – 2019
- 2019
- [j11]Yusuke Aikawa, Koji Nuida
, Masaaki Shirase:
Elliptic Curve Method Using Complex Multiplication Method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(1): 74-80 (2019) - [c22]Yuki Nanjo, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami:
A Performance Analysis and Evaluation of SIDH with Implementation-Friendly Classes of Quadratic Extension Fields. CANDAR 2019: 178-184 - 2018
- [c21]Yuki Nanjo, Md. Al-Amin Khandaker, Masaaki Shirase, Takuya Kusaka, Yasuyuki Nogami:
Efficient Ate-Based Pairing over the Attractive Classes of BN Curves. WISA 2018: 55-67 - 2017
- [i13]Masaaki Shirase:
Condition on composite numbers easily factored with elliptic curve method. IACR Cryptol. ePrint Arch. 2017: 403 (2017) - 2016
- [c20]Masaaki Shirase:
Coordinate system for elliptic curve cryptosystem on twisted Edwards curve. ICCE-TW 2016: 1-2 - [c19]Md. Al-Amin Khandaker, Hirotaka Ono, Yasuyuki Nogami, Masaaki Shirase, Sylvain Duquesne:
An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication. ICISC 2016: 208-219 - 2014
- [c18]Yoshitaka Nagai, Masaaki Shirase, Tetsuya Izu:
Elliptic Curve Scalar Multiplication with a Bijective Transform. IMIS 2014: 280-286 - 2013
- [j10]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Certificateless hybrid signcryption. Math. Comput. Model. 57(3-4): 324-343 (2013) - [c17]Yumi Sakemi, Tetsuya Izu, Masaaki Shirase:
Faster Scalar Multiplication for Elliptic Curve Cryptosystems. NBiS 2013: 523-527 - [c16]Masaaki Shirase:
An Improved Addition Formula on Elliptic Curves Given by Weierstrass Normal Form. NBiS 2013: 528-533 - [c15]Yuki Mori, Shoichi Akagi, Yasuyuki Nogami, Masaaki Shirase:
Pseudo 8-Sparse Multiplication for Efficient Ate-Based Pairing on Barreto-Naehrig Curve. Pairing 2013: 186-198 - 2012
- [j9]Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin'ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi:
Solving a 676-Bit Discrete Logarithm Problem in GF(36n). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(1): 204-212 (2012) - 2011
- [j8]Masaaki Shirase:
Universal Construction of a 12th Degree Extension Field for Asymmetric Pairing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 156-164 (2011) - 2010
- [j7]Jean-Luc Beuchat, Hiroshi Doi, Kaoru Fujita, Atsuo Inomata, Piseth Ith, Akira Kanaoka, Masayoshi Katouno, Masahiro Mambo, Eiji Okamoto, Takeshi Okamoto, Takaaki Shiga, Masaaki Shirase, Ryuji Soga, Tsuyoshi Takagi, Ananda Vithanage, Hiroyasu Yamamoto:
FPGA and ASIC implementations of the etaT pairing in characteristic three. Comput. Electr. Eng. 36(1): 73-87 (2010) - [j6]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Cryptanalysis of efficient proxy signature schemes for mobile communication. Sci. China Inf. Sci. 53(10): 2016-2021 (2010) - [c14]Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin'ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi:
Solving a 676-Bit Discrete Logarithm Problem in GF(36n). Public Key Cryptography 2010: 351-367 - [i12]Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin'ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi:
Solving a 676-bit Discrete Logarithm Problem in GF(36n). IACR Cryptol. ePrint Arch. 2010: 90 (2010) - [i11]Masaaki Shirase:
Barreto-Naehrig Curve With Fixed Coefficient - Efficiently Constructing Pairing-Friendly Curves -. IACR Cryptol. ePrint Arch. 2010: 134 (2010)
2000 – 2009
- 2009
- [j5]Masaaki Shirase, Yukinori Miyazaki, Tsuyoshi Takagi, Dong-Guk Han, Dooho Choi:
Efficient Implementation of Pairing-Based Cryptography on a Sensor Node. IEICE Trans. Inf. Syst. 92-D(5): 909-917 (2009) - [c13]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Identity-Based Hybrid Signcryption. ARES 2009: 534-539 - [c12]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Certificateless Hybrid Signcryption. ISPEC 2009: 112-123 - [c11]Yuta Sasaki, Satsuki Nishina, Masaaki Shirase, Tsuyoshi Takagi:
An Efficient Residue Group Multiplication for the etaT Pairing over F3m. Selected Areas in Cryptography 2009: 364-375 - [i10]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Certificateless Hybrid Signcryption. IACR Cryptol. ePrint Arch. 2009: 162 (2009) - [i9]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Identity-Based Hybrid Signcryption. IACR Cryptol. ePrint Arch. 2009: 455 (2009) - [i8]Masaaki Shirase:
Universally Constructing 12-th Degree Extension Field for Ate Pairing. IACR Cryptol. ePrint Arch. 2009: 623 (2009) - 2008
- [j4]Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
Some Efficient Algorithms for the Final Exponentiation of etaT Pairing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 221-228 (2008) - [j3]Masaaki Shirase, Dong-Guk Han, Yasushi Hibino, Howon Kim, Tsuyoshi Takagi:
A More Compact Representation of XTR Cryptosystem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(10): 2843-2850 (2008) - [j2]Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, Tsuyoshi Takagi:
Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three. IEEE Trans. Computers 57(11): 1454-1468 (2008) - [c10]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
On the Security of Online/Offline Signatures and Multisignatures from ACISP'06. CANS 2008: 108-119 - [c9]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Efficient Signcryption Key Encapsulation without Random Oracles. Inscrypt 2008: 47-59 - [c8]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Efficient Multi-PKG ID-Based Signcryption for Ad Hoc Networks. Inscrypt 2008: 289-304 - [c7]Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
An Efficient Countermeasure against Side Channel Attacks for Pairing Computation. ISPEC 2008: 290-303 - [c6]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Key Management Using Certificateless Public Key Cryptography in Ad Hoc Networks. NPC 2008: 116-126 - [i7]Jean-Luc Beuchat, Hiroshi Doi, Kaoru Fujita, Atsuo Inomata, Piseth Ith, Akira Kanaoka, Masayoshi Katouno, Masahiro Mambo, Eiji Okamoto, Takeshi Okamoto, Takaaki Shiga, Masaaki Shirase, Ryuji Soga, Tsuyoshi Takagi, Ananda Vithanage, Hiroyasu Yamamoto:
FPGA and ASIC Implementations of the etaT Pairing in Characteristic Three. IACR Cryptol. ePrint Arch. 2008: 280 (2008) - [i6]Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
Analysis and Improvement of Authenticatable Ring Signcryption Scheme. IACR Cryptol. ePrint Arch. 2008: 373 (2008) - 2007
- [c5]Masaaki Shirase, Dong-Guk Han, Yasushi Hibino, Ho Won Kim, Tsuyoshi Takagi:
Compressed XTR. ACNS 2007: 420-431 - [c4]Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation. IEEE Symposium on Computer Arithmetic 2007: 97-104 - [c3]Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
Some Efficient Algorithms for the Final Exponentiation of eta T Pairing. ISPEC 2007: 254-268 - [c2]Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
A Coprocessor for the Final Exponentiation of the eta T Pairing in Characteristic Three. WAIFI 2007: 25-39 - [c1]Masaaki Shirase, Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto:
Universal etaT Pairing Algorithm over Arbitrary Extension Degree. WISA 2007: 1-15 - [i5]Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
A Coprocessor for the Final Exponentiation of the etaT Pairing in Characteristic Three. IACR Cryptol. ePrint Arch. 2007: 45 (2007) - [i4]Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
A Refined Algorithm for the etaT Pairing Calculation in Characteristic Three. IACR Cryptol. ePrint Arch. 2007: 311 (2007) - [i3]Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, Tsuyoshi Takagi:
Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three. IACR Cryptol. ePrint Arch. 2007: 417 (2007) - 2006
- [i2]Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
An Algorithm for the ηT Pairing Calculation in Characteristic Three and its Hardware Implementation. IACR Cryptol. ePrint Arch. 2006: 327 (2006) - [i1]Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
Some Efficient Algorithms for the Final Exponentiation of ηT Pairing. IACR Cryptol. ePrint Arch. 2006: 431 (2006) - 2005
- [j1]Masaaki Shirase, Yasushi Hibino:
An architecture for elliptic curve cryptograph computation. SIGARCH Comput. Archit. News 33(1): 124-133 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
