Katsuyuki Okeya
According to our database1,
Katsuyuki Okeya
authored at least 52 papers
between 2000 and 2010.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2010
Recursive Double-Size Modular Multiplications from Euclidean and Montgomery Multipliers.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
2009
Int. J. Inf. Sec., 2009
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients.
Proceedings of the Topics in Cryptology, 2009
2008
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
Proceedings of the Information Security Applications, 9th International Workshop, 2008
Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008
Proceedings of the Information and Communications Security, 10th International Conference, 2008
Proceedings of the Smart Card Research and Advanced Applications, 2008
Skew Frobenius Map and Efficient Scalar Multiplication for Pairing-Based Cryptography.
Proceedings of the Cryptology and Network Security, 7th International Conference, 2008
2007
A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
IACR Cryptol. ePrint Arch., 2007
An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions.
Proceedings of the Progress in Cryptology, 2007
Proceedings of the Cryptographic Hardware and Embedded Systems, 2007
Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007
Proceedings of the Information Security and Privacy, 12th Australasian Conference, 2007
2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
Proceedings of the Selected Areas in Cryptography, 13th International Workshop, 2006
Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations.
Proceedings of the Smart Card Research and Advanced Applications, 2006
Proceedings of the Applied Cryptography and Network Security, 4th International Conference, 2006
Proceedings of the Information Security and Privacy, 11th Australasian Conference, 2006
2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
Cryptanalysis of Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
Proceedings of the Security and Privacy in Ad-hoc and Sensor Networks, 2005
Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005
2004
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2004
Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004
Proceedings of the Applied Cryptography and Network Security, 2004
On the Exact Flexibility of the Flexible Countermeasure Against Side Channel Attacks.
Proceedings of the Information Security and Privacy: 9th Australasian Conference, 2004
2003
A Simple Power Attack on a Randomized Addition-Subtraction Chains Method for Elliptic Curve Cryptosystems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
Use of Montgomery Trick in Precomputation of Multi-Scalar Multiplication in Elliptic Curve Cryptosystems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
A multiple power analysis breaks the advanced version of the randomized addition-subtraction chains countermeasure against side channel attacks.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003
Side Channel Attack on Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication.
Proceedings of the Progress in Cryptology, 2003
The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks.
Proceedings of the Topics in Cryptology, 2003
Proceedings of the Cryptographic Hardware and Embedded Systems, 2003
2002
A Scalar Multiplication Algorithm with Recovery of the <i>y</i>-Coordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002
A Second-Order DPA Attack Breaks a Window-Method Based Countermeasure against Side Channel Attacks.
Proceedings of the Information Security, 5th International Conference, 2002
Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2002
On Insecurity of the Side Channel Attack Countermeasure Using Addition-Subtraction Chains under Distinguishability between Addition and Doubling.
Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002
2001
A Fast Scalar Multiplication Method with Randomized Projective Coordinates on a Montgomery-Form Elliptic Curve Secure against Side Channel Attacks.
Proceedings of the Information Security and Cryptology, 2001
Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2001
2000
Proceedings of the Public Key Cryptography, 2000
Power Analysis Breaks Elliptic Curve Cryptosystems even Secure against the Timing Attack.
Proceedings of the Progress in Cryptology, 2000