Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Tsuyoshi Takagi
Search web for home page
Program Committees
1
2013
PKC
pc
2
2012
Crypto
pc
3
2011
CHES
pc chair
4
2010
CHES
pc
5
2008
PKC
pc
6
2007
CHES
pc
7
2007
Asiacrypt
pc
8
2005
CHES
pc
9
2004
CHES
pc
10
2003
CHES
pc
Publications
year
title
booktitle
pages
1
2012
Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
asiacrypt
43-60
2
2010
Solving a 676-Bit Discrete Logarithm Problem in $GF(3^{6n})$
pkc
351-367
3
2010
On the Public Key Replacement and Universal Forgery Attacks of Short Certificateless Signature
eprint
online
4
2010
Solving a 676-bit Discrete Logarithm Problem in $GF(3^{6n})$
eprint
online
5
2008
FPGA and ASIC Implementations of the $\eta_T$ Pairing in Characteristic Three
eprint
online
6
2008
Analysis and Improvement of Authenticatable Ring Signcryption Scheme
eprint
online
7
2007
A Coprocessor for the Final Exponentiation of the $\eta_T$ Pairing in Characteristic Three
eprint
online
8
2007
A Refined Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three
eprint
online
9
2007
Efficient Implementation of the Pairing on Mobilephones using BREW
eprint
online
10
2007
Algorithms and Arithmetic Operators for Computing the $\eta_T$ Pairing in Characteristic Three
eprint
online
11
2006
Efficient Implementation of Tate Pairing on a Mobile Phone using Java
eprint
online
12
2006
New Approach for Selectively Convertible Undeniable Signature Schemes
asiacrypt
online
13
2006
An Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three and its Hardware Implementation
eprint
online
14
2006
Some Efficient Algorithms for the Final Exponentiation of $\eta_T$ Pairing
eprint
online
15
2006
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
eprint
online
16
2005
Collision Attack on XTR and a Countermeasure with a Fixed Pattern
eprint
online
17
2005
One-Wayness Equivalent to General Factoring
eprint
online
18
2005
Some Explicit Formulae of NAF and its Left-to-Right Analogue
eprint
online
19
2005
Some Analysis of Radix-r Representations
eprint
online
20
2005
Short Memory Scalar Multiplication on Koblitz Curves
ches
online
21
2005
Efficient Arithmetic on Subfield Elliptic Curves over Small Odd Characteristics
eprint
online
22
2004
Signed Binary Representations Revisited
crypto
online
23
2004
Signed Binary Representations Revisited
eprint
online
24
2004
A Complete Divisor Class Halving Algorithm for Hyperelliptic Curve Cryptosystems of Genus Two
eprint
online
25
2004
On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using Isogeny
pkc
online
26
2003
A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems
asiacrypt
online
27
2003
Some RSA-Based Encryption Schemes with Tight Security Reduction
asiacrypt
online
28
2003
Exceptional Procedure Attack on Elliptic Curve Cryptosystems
pkc
224-239
29
2003
Some RSA-based Encryption Schemes with Tight Security Reduction
eprint
online
30
2003
Novel Efficient Implementations of Hyperelliptic Curve Cryptosystems using Degenerate Divisors
eprint
online
31
2003
Generalized Powering Functions and Their Application to Digital Signatures
asiacrypt
online
32
2003
A More Flexible Countermeasure against Side Channel Attacks Using Window Method
ches
397-410
33
2002
A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks
pkc
280-296
34
2002
New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive
pkc
1-16
35
2000
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
jofc
263-272
36
1999
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
asiacrypt
219-231
37
1999
NICE - New Ideal Coset Encryption
ches
328-339
38
1998
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
eurocrypt
294-307
39
1998
Fast RSA-Type Cryptosystem Modulo p
k
q
crypto
318-326
40
1997
Fast RSA-Type Cryptosystems Using N-Adic Expansion
crypto
372-384
Coauthors of Tsuyoshi Takagi
Toru Akishita
Jean-Luc Beuchat
Nicolas Brisebarre
Kyo Il Chung
Jérémie Detrey
Hiroshi Doi
Kaoru Fujita
Keisuke Hakuta
Dong-Guk Han
Michael Hartmann
Takuya Hayashi
Detlef Hühnlein
Atsuo Inomata
Tetsuya Izu
Michael J. Jacobson Jr.
Akira Kanaoka
Masanobu Katagi
Masayoshi Katouno
Yuto Kawahara
Tae Hyun Kim
Ho Won Kim
Izuru Kitamura
Shinsaku Kiyomoto
Kaoru Kurosawa
Fagen Li
Jongin Lim
Masahiro Mambo
Shin'ichiro Matsuo
Takeshi Okamoto
Eiji Okamoto
Katsuyuki Okeya
Sachar Paulus
Kouichi Sakurai
Hisayoshi Sato
Katja Schmidt-Samoa
Takaaki Shiga
Takeshi Shimoyama
Naoyuki Shinohara
Masaaki Shirase
Ryuji Soga
Christian Spahn
Kazuo Takaragi
Toshiaki Tanaka
Satoru Tezuka
Ananda Vithanage
Camille Vuillaume
Lihua Wang
Hiroyasu Yamamoto
Bo Yang
Motoi Yoshitomi
Mingwu Zhang