Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Hikaru Morita

dblp:56/5869 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2001
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 3 first-authorSystems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography		 0.011999
Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic · EUROCRYPT 1999
Cryptographic primitives and cryptanalysis › public-key cryptography
modular multiplication		 0.021994
Higher Radix Nonrestoring Modular Multiplication Algorithm and Public-key LSI Architecture with Limited Hardware Resources · ASIACRYPT 1994
A Fast Modular-multiplication Algorithm based on a Higher Radix · CRYPTO 1989
Cryptographic primitives and cryptanalysis
block cipher cryptanalysis		 0.011991
Results of Switching-Closure-Test on FEAL (Extended Abstract) · ASIACRYPT 1991
Cryptographic primitives and cryptanalysis › block cipher cryptanalysis
FEAL		 0.011991
Results of Switching-Closure-Test on FEAL (Extended Abstract) · ASIACRYPT 1991
Integrated circuit design › finite field arithmetic
modular multiplier design		 0.011994
Higher Radix Nonrestoring Modular Multiplication Algorithm and Public-key LSI Architecture with Limited Hardware Resources · ASIACRYPT 1994

Methods — techniques the papers use, named apart from their topics

higher radix algorithm · 0.0frobenius map · 0.0
YearPublicationVenuePosition
2001 On-line signature verification algorithm incorporating pen position, pen pressure and pen inclination trajectories
abstract
A new algorithm is proposed for pen-input on-line signature verification incorporating pen-position, pen-pressure and pen-inclinations trajectories. Preliminary experimental result looks encouraging.
D. Sakamoto, Hikaru Morita, Tetsu Ohishi, Yoshimitsu Komiya, Takashi Matsumoto 0001
 ICASSP2
2001 Pen-input On-line Signature Verification with Position Pressure Inclination Trajectories
Tetsu Ohishi, Yoshimitsu Komiya, Hikaru Morita, Takashi Matsumoto 0001
 IPDPS3
2001 Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison
Koji Chida, Kunio Kobayashi, Hikaru Morita
 ISC3
1999 Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
Tetsutaro Kobayashi, Hikaru Morita, Kunio Kobayashi, Fumitaka Hoshino
 EUROCRYPT2
1994 Higher Radix Nonrestoring Modular Multiplication Algorithm and Public-key LSI Architecture with Limited Hardware Resources
Masayuki Abe, Hikaru Morita
 ASIACRYPT2
1991 Results of Switching-Closure-Test on FEAL (Extended Abstract)
Hikaru Morita, Kazuo Ohta, Shoji Miyaguchi
 ASIACRYPT1
1991 A Switching Closure Test to Analyze Cryptosystems
Hikaru Morita, Kazuo Ohta, Shoji Miyaguchi
 CRYPTO1
1989 A Fast Modular-multiplication Algorithm based on a Higher Radix
Hikaru Morita
 CRYPTO1