Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
D. G.T. Thomas
Min Lu
Hao Mao
Peter Malec
S. Srbljic
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
KATSUYUKI OKEYA
Author Info
Open Visualization
Name
Affiliation
Papers
KATSUYUKI OKEYA
Hitachi Ltd, Syst Dev Lab, Yokohama, Kanagawa 2440817, Japan
53
Collaborators
Citations
PageRank
37
447
38.47
Referers
Referees
References
622
344
496
Search Limit
100
622
Publications (53 rows)
Collaborators (37 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Sole Inversion Precomputation For Elliptic Curve Scalar Multiplications
0
0.34
2010
Recursive Double-Size Modular Multiplications From Euclidean And Montgomery Multipliers
0
0.34
2010
Width-3 joint sparse form
2
0.46
2010
Bipartite modular multiplication with twice the bit-length of multipliers
1
0.36
2009
Faster Double-Size Bipartite Multiplication Out Of Montgomery Multipliers
2
0.46
2009
Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
0
0.34
2009
Short-Memory Scalar Multiplication for Koblitz Curves
4
0.45
2008
Public Key Authentication with Memory Tokens
1
0.38
2008
Montgomery Multiplication with Twice the Bit-Length of Multipliers
0
0.34
2008
Side Channel Attacks against Hash-Based MACs with PGV Compression Functions
1
0.35
2008
A Black Hen Lays White Eggs
1
0.38
2008
Skew Frobenius Map and Efficient Scalar Multiplication for Pairing---Based Cryptography
13
0.71
2008
Side Channel Analysis of Some Hash Based MACs: A Response to SHA-3 Requirements
7
0.71
2008
Digital Signatures Out of Second-Preimage Resistant Hash Functions
14
0.92
2008
Affine precomputation with sole inversion in elliptic curve cryptography
13
0.89
2007
MAME: A Compression Function with Reduced Hardware Requirements
14
0.87
2007
An update on the side channel cryptanalysis of MACs based on cryptographic hash functions
8
0.62
2007
A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems
3
0.48
2007
Merkle Signatures with Virtually Unlimited Signature Capacity
28
1.19
2007
Double-size bipartite modular multiplication
4
0.60
2007
Generic cryptanalysis of combined countermeasures with randomized BSD representations
1
0.41
2006
Enhanced Exhaustive Search Attack On Randomized Bsd Type Countermeasure
0
0.34
2006
Unbridle the bit-length of a crypto-coprocessor with montgomery multiplication
6
0.70
2006
Security Analysis of the SPA-Resistant Fractional Width Method*Preliminary version presented at ACISP'04.
0
0.34
2006
Enhanced Exhaustive Search Attack on Randomized BSD Type Countermeasure*A preliminary version of this paper was presented at ACNS 2004 [9].
0
0.34
2006
Security Analysis Of The Spa-Resistant Fractional Width Method
0
0.34
2006
Security analysis of CRT-based cryptosystems
0
0.34
2006
Flexible exponentiation with resistance to side channel attacks
7
0.51
2006
Defeating Simple Power Analysis on Koblitz Curves*The preliminary version of this paper was presented at the 10th Australasian Conference on Information Security and Privacy, ACISP'05.
2
0.37
2006
Side channel attacks against HMACs based on block-cipher based hash functions
18
1.10
2006
Defeating Simple Power Analysis On Koblitz Curves
1
0.35
2006
Cryptanalysis of Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication*
0
0.34
2005
On the Importance of Protecting in SFLASH against Side Channel Attacks.
0
0.34
2005
Short memory scalar multiplication on koblitz curves
8
0.61
2005
On the Importance of Protecting " in SFLASH against Side Channel Attacks
0
0.34
2005
Efficient representations on koblitz curves with resistance to side channel attacks
8
0.58
2005
An advanced method for joint scalar multiplications on memory constraint devices
3
0.50
2005
Cryptanalysis of the Countermeasures Using Randomized Binary Signed Digits
2
0.38
2004
SCA-Resistant and Fast Elliptic Scalar Multiplication Based on wNAF.
0
0.34
2004
On the Importance of Protecting Delta in SFLASH against Side Channel Attacks
0
0.34
2004
Sca-Resistant And Fast Elliptic Scalar Multiplication Based On Wnaf
2
0.46
2004
Signed Binary Representations Revisited.
32
1.70
2004
Use Of Montgomery Trick In Precomputation Of Multi-Scalar Multiplication In Elliptic Curve Cryptosystems
0
0.34
2003
A Multiple Power Analysis Breaks The Advanced Version Of The Randomized Addition-Subtraction Chains Countermeasure Against Side Channel Attacks
4
0.50
2003
Side Channel Attack on Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication
6
0.57
2003
The width-W NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks
36
1.35
2003
A Second-Order DPA Attack Breaks a Window-Method Based Countermeasure against Side Channel Attacks
17
0.87
2002
On Insecurity of the Side Channel Attack Countermeasure Using Addition-Subtraction Chains under Distinguishability between Addition and Doubling
24
1.21
2002
Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick
7
0.58
2002
A Fast Scalar Multiplication Method with Randomized Projective Coordinates on a Montgomery-Form Elliptic Curve Secure against Side Channel Attacks
14
1.08
2001
1
2
50 / page
