default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatsuyuki Okeya
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j19]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Recursive Double-Size Modular Multiplications from Euclidean and Montgomery Multipliers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(1): 180-187 (2010)- [j18]Erik Dahmen, Katsuyuki Okeya:
Sole Inversion Precomputation for Elliptic Curve Scalar Multiplications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(6): 1140-1147 (2010) - [c36]Katsuyuki Okeya, Hidehiro Katou, Yasuyuki Nogami:
Width-3 Joint Sparse Form. ISPEC 2010: 67-84
2000 – 2009
- 2009
- [j17]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Faster Double-Size Bipartite Multiplication out of Montgomery Multipliers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 1851-1858 (2009) - [j16]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Bipartite modular multiplication with twice the bit-length of multipliers. Int. J. Inf. Sec. 8(1): 13-23 (2009) - [c35]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients. CT-RSA 2009: 340-356 - 2008
- [j15]Katsuyuki Okeya:
Side Channel Attacks against Hash-Based MACs with PGV Compression Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 168-175 (2008) - [j14]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Montgomery Multiplication with Twice the Bit-Length of Multipliers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 203-210 (2008) - [j13]Camille Vuillaume, Katsuyuki Okeya, Tsuyoshi Takagi:
Short-Memory Scalar Multiplication for Koblitz Curves. IEEE Trans. Computers 57(4): 481-489 (2008) - [c34]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 - [c33]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
A Black Hen Lays White Eggs. CARDIS 2008: 74-88 - [c32]Praveen Gauravaram, Katsuyuki Okeya:
Side Channel Analysis of Some Hash Based MACs: A Response to SHA-3 Requirements. ICICS 2008: 111-127 - [c31]Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume:
Digital Signatures Out of Second-Preimage Resistant Hash Functions. PQCrypto 2008: 109-123 - [c30]Camille Vuillaume, Katsuyuki Okeya, Erik Dahmen, Johannes Buchmann:
Public Key Authentication with Memory Tokens. WISA 2008: 84-98 - 2007
- [j12]Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi:
A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 952-959 (2007) - [c29]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Double-Size Bipartite Modular Multiplication. ACISP 2007: 230-244 - [c28]Erik Dahmen, Katsuyuki Okeya, Daniel Schepers:
Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography. ACISP 2007: 245-258 - [c27]Johannes Buchmann, Erik Dahmen, Elena Klintsevich, Katsuyuki Okeya, Camille Vuillaume:
Merkle Signatures with Virtually Unlimited Signature Capacity. ACNS 2007: 31-45 - [c26]Hirotaka Yoshida, Dai Watanabe, Katsuyuki Okeya, Jun Kitahara, Hongjun Wu, Özgül Küçük
, Bart Preneel:
MAME: A Compression Function with Reduced Hardware Requirements. CHES 2007: 148-165 - [c25]Praveen Gauravaram, Katsuyuki Okeya:
An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions. INDOCRYPT 2007: 393-403 - [i2]Erik Dahmen, Katsuyuki Okeya, Daniel Schepers:
Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography. IACR Cryptol. ePrint Arch. 2007: 268 (2007) - 2006
- [j11]Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume:
Security Analysis of the SPA-Resistant Fractional Width Method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 161-168 (2006) - [j10]Dong-Guk Han, Katsuyuki Okeya, Tae Hyun Kim, Yoon Sung Hwang, Beomin Kim, Young-Ho Park:
Enhanced Exhaustive Search Attack on Randomized BSD Type Countermeasure. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1316-1327 (2006) - [j9]Camille Vuillaume, Katsuyuki Okeya, Tsuyoshi Takagi:
Defeating Simple Power Analysis on Koblitz Curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1362-1369 (2006) - [j8]Katsuyuki Okeya, Tsuyoshi Takagi:
Security analysis of CRT-based cryptosystems. Int. J. Inf. Sec. 5(3): 177-185 (2006) - [j7]Katsuyuki Okeya, Tetsu Iwata:
Side Channel Attacks on Message Authentication Codes. Inf. Media Technol. 1(2): 942-952 (2006) - [c24]Katsuyuki Okeya:
Side Channel Attacks Against HMACs Based on Block-Cipher Based Hash Functions. ACISP 2006: 432-443 - [c23]Camille Vuillaume, Katsuyuki Okeya:
Flexible Exponentiation with Resistance to Side Channel Attacks. ACNS 2006: 268-283 - [c22]Tae Hyun Kim, Dong-Guk Han, Katsuyuki Okeya, Jongin Lim:
Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations. CARDIS 2006: 119-134 - [c21]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication. Selected Areas in Cryptography 2006: 188-202 - 2005
- [j6]Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume:
On the Importance of Protecting in SFLASH against Side Channel Attacks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 123-131 (2005) - [j5]Katsuyuki Okeya, Dong-Guk Han:
Cryptanalysis of Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1140-1147 (2005) - [c20]Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume:
Efficient Representations on Koblitz Curves with Resistance to Side Channel Attacks. ACISP 2005: 218-229 - [c19]Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume:
Short Memory Scalar Multiplication on Koblitz Curves. CHES 2005: 91-105 - [c18]Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi:
An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices. ESAS 2005: 189-204 - [c17]Katsuyuki Okeya, Tetsu Iwata:
Side Channel Attacks on Message Authentication Codes. ESAS 2005: 205-217 - 2004
- [j4]Katsuyuki Okeya, Tsuyoshi Takagi:
SCA-Resistant and Fast Elliptic Scalar Multiplication Based on wNAF. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A(1): 75-84 (2004) - [c16]Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume:
On the Exact Flexibility of the Flexible Countermeasure Against Side Channel Attacks. ACISP 2004: 466-477 - [c15]Katsuyuki Okeya, Tsuyoshi Takagi:
Security Analysis of CRT-Based Cryptosystems. ACNS 2004: 383-397 - [c14]Dong-Guk Han, Katsuyuki Okeya, Tae Hyun Kim, Yoon Sung Hwang, Young-Ho Park, Souhwan Jung:
Cryptanalysis of the Countermeasures Using Randomized Binary Signed Digits. ACNS 2004: 398-413 - [c13]Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, Tsuyoshi Takagi:
Signed Binary Representations Revisited. CRYPTO 2004: 123-139 - [c12]Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume:
On the Importance of Protecting Delta in SFLASH against Side Channel Attacks. ITCC (2) 2004: 560-568 - [i1]Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, Tsuyoshi Takagi:
Signed Binary Representations Revisited. IACR Cryptol. ePrint Arch. 2004: 195 (2004) - 2003
- [j3]Katsuyuki Okeya, Kouichi Sakurai:
Use of Montgomery Trick in Precomputation of Multi-Scalar Multiplication in Elliptic Curve Cryptosystems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(1): 98-112 (2003) - [j2]Katsuyuki Okeya, Kouichi Sakurai:
A Simple Power Attack on a Randomized Addition-Subtraction Chains Method for Elliptic Curve Cryptosystems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1171-1180 (2003) - [c11]Katsuyuki Okeya, Tsuyoshi Takagi:
A More Flexible Countermeasure against Side Channel Attacks Using Window Method. CHES 2003: 397-410 - [c10]Katsuyuki Okeya, Tsuyoshi Takagi:
The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks. CT-RSA 2003: 328-342 - [c9]Katsuyuki Okeya, Dong-Guk Han:
Side Channel Attack on Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication. INDOCRYPT 2003: 334-348 - [c8]Katsuyuki Okeya, Kouichi Sakurai:
A multiple power analysis breaks the advanced version of the randomized addition-subtraction chains countermeasure against side channel attacks. ITW 2003: 175-178 - 2002
- [j1]Katsuyuki Okeya, Kouichi Sakurai:
A Scalar Multiplication Algorithm with Recovery of the y-Coordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(1): 84-93 (2002) - [c7]Katsuyuki Okeya, Kouichi Sakurai:
On Insecurity of the Side Channel Attack Countermeasure Using Addition-Subtraction Chains under Distinguishability between Addition and Doubling. ACISP 2002: 420-435 - [c6]Katsuyuki Okeya, Kouichi Sakurai:
Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick. CHES 2002: 564-578 - [c5]Katsuyuki Okeya, Kouichi Sakurai:
A Second-Order DPA Attack Breaks a Window-Method Based Countermeasure against Side Channel Attacks. ISC 2002: 389-401 - 2001
- [c4]Katsuyuki Okeya, Kouichi Sakurai:
Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve. CHES 2001: 126-141 - [c3]Katsuyuki Okeya, Kunihiko Miyazaki, Kouichi Sakurai:
A Fast Scalar Multiplication Method with Randomized Projective Coordinates on a Montgomery-Form Elliptic Curve Secure against Side Channel Attacks. ICISC 2001: 428-439 - 2000
- [c2]Katsuyuki Okeya, Kouichi Sakurai:
Power Analysis Breaks Elliptic Curve Cryptosystems even Secure against the Timing Attack. INDOCRYPT 2000: 178-190 - [c1]Katsuyuki Okeya, Hiroyuki Kurumatani, Kouichi Sakurai:
Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications. Public Key Cryptography 2000: 238-257
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 2025-01-09 13:02 CET 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:
