default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHikaru Morita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i1]Hikaru Morita, Saeko Matsuura:
validation method to improve behavioral flows on uml requirements analysis model by cross-checking with state transition model. CoRR abs/2103.00781 (2021)
2010 – 2019
- 2019
- [j3]Hikaru Morita, Teruyuki Miyajima, Yoshiki Sugitani:
Adaptive FIR Filtering for PAPR Reduction in OFDM Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(8): 938-945 (2019)
2000 – 2009
- 2005
- [j2]Chung-Huang Yang, Hikaru Morita, Tatsuaki Okamoto:
Security and Performance Evaluation of ESIGN and RSA on IC Cards by Using Byte-Unit Modular Algorithms. IEICE Trans. Commun. 88-B(3): 1244-1248 (2005) - 2004
- [j1]Koji Chida, Kunio Kobayashi, Hikaru Morita:
An Auction Protocol Preserving Privacy of Losing Bids with a Secure Value Comparison Scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 173-181 (2004) - 2001
- [c11]Hikaru Morita, D. Sakamoto, Tetsu Ohishi, Yoshimitsu Komiya, Takashi Matsumoto:
On-Line Signature Verifier Incorporating Pen Position, Pen Pressure, and Pen Inclination Trajectories. AVBPA 2001: 318-323 - [c10]D. Sakamoto, Hikaru Morita, Tetsu Ohishi, Yoshimitsu Komiya, Takashi Matsumoto:
On-line signature verification algorithm incorporating pen position, pen pressure and pen inclination trajectories. ICASSP 2001: 993-996 - [c9]Tetsu Ohishi, Yoshimitsu Komiya, Hikaru Morita, Takashi Matsumoto:
Pen-input On-line Signature Verification with Position Pressure Inclination Trajectories. IPDPS 2001: 170 - [c8]Koji Chida, Kunio Kobayashi, Hikaru Morita:
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison. ISC 2001: 408-419 - 2000
- [c7]Koutarou Suzuki, Kunio Kobayashi, Hikaru Morita:
Efficient Sealed-Bid Auction Using Hash Chain. ICISC 2000: 183-191
1990 – 1999
- 1999
- [c6]Tetsutaro Kobayashi, Hikaru Morita, Kunio Kobayashi, Fumitaka Hoshino
:
Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic. EUROCRYPT 1999: 176-189 - 1994
- [c5]Masayuki Abe, Hikaru Morita:
Higher Radix Nonrestoring Modular Multiplication Algorithm and Public-key LSI Architecture with Limited Hardware Resources. ASIACRYPT 1994: 365-375 - 1991
- [c4]Hikaru Morita, Kazuo Ohta, Shoji Miyaguchi:
Results of Switching-Closure-Test on FEAL (Extended Abstract). ASIACRYPT 1991: 247-252 - [c3]Hikaru Morita, Kazuo Ohta, Shoji Miyaguchi:
A Switching Closure Test to Analyze Cryptosystems. CRYPTO 1991: 183-193 - 1990
- [c2]Hikaru Morita:
A Fast Modular-multiplication Module for Smart Cards. AUSCRYPT 1990: 406-409
1980 – 1989
- 1989
- [c1]Hikaru Morita:
A Fast Modular-multiplication Algorithm based on a Higher Radix. CRYPTO 1989: 387-399
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-24 22:46 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:
