default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoshitaka Morikawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j19]Yasuyuki Nogami, Hidehiro Kato, Kenta Nekado, Satoshi Uehara, Yoshitaka Morikawa:
Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group. IEEE Trans. Inf. Theory 58(7): 4936-4947 (2012)- 2011
- [j18]Kenta Nekado, Yasuyuki Nogami, Hidehiro Kato, Yoshitaka Morikawa:
Cyclic Vector Multiplication Algorithm and Existence Probability of Gauss Period Normal Basis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 172-179 (2011) - [j17]Yasuyuki Nogami, Kenta Nekado, Tetsumi Toyota, Naoto Hongo, Yoshitaka Morikawa:
Mixed Bases for Efficient Inversion in F((22)2)2 and Conversion Matrices of SubBytes of AES. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1318-1327 (2011) - [j16]Yumi Sakemi, Yasuyuki Nogami, Shoichi Takeuchi, Yoshitaka Morikawa:
An Improvement of Twisted Ate Pairing Efficient for Multi-Pairing and Thread Computing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1356-1367 (2011) - [c14]Tetsuya Izu, Yoshitaka Morikawa, Yasuyuki Nogami, Yumi Sakemi, Masahiko Takenaka:
Detailed Cost Estimation of CNTW Attack against EMV Signature Scheme. Financial Cryptography Workshops 2011: 13-26 - [c13]Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa:
Efficient Non Symmetric Pairing Groups on Ordinary Pairing Friendly Curve of Embedding Degree 1. ICC 2011: 1-5 - 2010
- [j15]Yumi Sakemi, Hidehiro Kato, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa:
Two Improvements of Twisted Ate Pairing with Barreto-Naehrig Curve by Dividing Miller's Algorithm. Adv. Inf. Sci. Serv. Sci. 2(4): 1-13 (2010) - [c12]Yasuyuki Nogami, Kenta Nekado, Tetsumi Toyota, Naoto Hongo, Yoshitaka Morikawa:
Mixed Bases for Efficient Inversion in \mathbb F((22)2) and Conversion Matrices of SubBytes of AES. CHES 2010: 234-247 - [c11]Yumi Sakemi, Kazushi Nishii, Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa:
Accelerating Cross Twisted Ate Pairing with Ordinary Pairing Friendly Curve of Composite Order That Has Two Large Prime Factors. NBiS 2010: 552-557 - [c10]Kenta Nekado, Tatsuya Yuasa, Yasuyuki Nogami, Yoshitaka Morikawa:
Efficient Squaring Algorithm in 2-nd Tower Field Available for Various Pairing-Based Cryptographies. NBiS 2010: 569-574
2000 – 2009
- 2009
- [j14]Hidehiro Katou, Yasuyuki Nogami, Tomoki Yoshida, Yoshitaka Morikawa:
A Multiplication Algorithm in Fpm Such That p>m with a Special Class of Gauss Period Normal Bases. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 173-181 (2009) - [j13]Yasuyuki Nogami, Yumi Sakemi, Takumi Okimoto, Kenta Nekado, Masataka Akane, Yoshitaka Morikawa:
Scalar Multiplication Using Frobenius Expansion over Twisted Elliptic Curve for Ate Pairing Based Cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 182-189 (2009) - [j12]Masataka Akane, Yasuyuki Nogami, Yoshitaka Morikawa:
Fast Ate Pairing Computation of Embedding Degree 12 Using Subfield-Twisted Elliptic Curve. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(2): 508-516 (2009) - [j11]Yasuyuki Nogami, Ryo Namba, Yoshitaka Morikawa:
Finding a Basis Conversion Matrix via Prime Gauss Period Normal Basis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(6): 1500-1507 (2009) - [j10]Yasuyuki Nogami, Yumi Sakemi, Hidehiro Kato, Masataka Akane, Yoshitaka Morikawa:
Integer Variable chi-Based Cross Twisted Ate Pairing and Its Optimization for Barreto-Naehrig Curve. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 1859-1867 (2009) - [j9]Nobumoto Yamane, Motohiro Tabuchi, Yoshitaka Morikawa:
Image Restoration Using a Universal GMM Learning and Adaptive Wiener Filter. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(10): 2560-2571 (2009) - [c9]Yumi Sakemi, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa:
Accelerating Twisted Ate Pairing with Frobenius Map, Small Scalar Multiplication, and Multi-pairing. ICISC 2009: 47-64 - [c8]Yumi Sakemi, Yoshitaka Morikawa, Yasuyuki Nogami, Hidehiro Kato:
Cross twisted Xate pairing with Barreto-Naehrig curve for multi-pairing technique. ISIT 2009: 2386-2390 - 2008
- [j8]Hiroaki Nasu, Yasuyuki Nogami, Satoshi Uehara, Ryo Namba, Yoshitaka Morikawa:
A Method for Constructing a Pseudo Self-Dual Normal Basis. Cybern. Syst. 39(6): 563-582 (2008) - [j7]Yasuyuki Nogami, Hiroaki Nasu, Yoshitaka Morikawa, Satoshi Uehara:
A method for constructing a self-dual normal basis in odd characteristic extension fields. Finite Fields Their Appl. 14(4): 867-876 (2008) - [j6]Yasuyuki Nogami, Ryo Namba, Yoshitaka Morikawa:
A Necessary Condition for Gauss Period Normal Bases to Be the Same Normal Basis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(4): 1229-1232 (2008) - [j5]Yoshihiko Hashidume, Yoshitaka Morikawa, Shuichi Maki:
Minimum Mean Absolute Error Predictors for Lossless Image Coding. IEICE Trans. Inf. Syst. 91-D(6): 1783-1792 (2008) - [c7]Yumi Sakemi, Yasuyuki Nogami, Katsuyuki Okeya, Hidehiro Katou, Yoshitaka Morikawa:
Skew Frobenius Map and Efficient Scalar Multiplication for Pairing-Based Cryptography. CANS 2008: 226-239 - [c6]Yasuyuki Nogami, Masataka Akane, Yumi Sakemi, Hidehiro Katou, Yoshitaka Morikawa:
Integer Variable chi-Based Ate Pairing. Pairing 2008: 178-191 - 2006
- [c5]Hidehiro Katou, Feng Wang, Yasuyuki Nogami, Yoshitaka Morikawa:
A High-Speed Square Root Algorithm in Extension Fields. ICISC 2006: 94-106 - 2005
- [j4]Yasuyuki Nogami, Shigeru Shinonaga, Yoshitaka Morikawa:
Fast Implementation of Extension Fields with TypeII ONB and Cyclic Vector Multiplication Algorithm. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1200-1208 (2005) - [j3]Feng Wang, Yasuyuki Nogami, Yoshitaka Morikawa:
An Efficient Square Root Computation in Finite Fields GF(p2d). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2792-2799 (2005) - 2004
- [c4]Yasuyuki Nogami, Yoshitaka Morikawa:
A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method. ICISC 2004: 249-260 - 2003
- [j2]Yasuyuki Nogami, Akinori Saito, Yoshitaka Morikawa:
Finite Extension Field with Modulus of All-One Polynomial and Representation of Its Elements for Fast Arithmetic Operations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(9): 2376-2387 (2003) - [c3]Feng Wang, Yasuyuki Nogami, Yoshitaka Morikawa:
A Fast Square Root Computation Using the Frobenius Mapping. ICICS 2003: 1-10
1980 – 1989
- 1987
- [j1]Nobumoto Yamane, Yoshitaka Morikawa, Hiroshi Hamada:
A fast image filtering processor using the Fermat number transform. Syst. Comput. Jpn. 18(1): 67-78 (1987) - 1986
- [c2]Nobumoto Yamane, Yoshitaka Morikawa, Hiroshi Hamada:
A fast image filtering processor-FIFP. ICASSP 1986: 565-568 - 1983
- [c1]Yoshitaka Morikawa, Hiroshi Hamada:
Implementation for two-dimensional FIR filters using the number theoretic transform. ICASSP 1983: 1248-1251
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-04-25 05:48 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:
