Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT, ISEC, WBS |
2013-03-07 15:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A knapsack cryptosystem with a randomly signed key Akira Hayashi (Kanazawa Inst. of Tech.) IT2012-83 ISEC2012-101 WBS2012-69 |
The knapsack cryptosystem invented by Merkle and Hellman is broken with high probability by Shamir's attack. A novel cr... [more] |
IT2012-83 ISEC2012-101 WBS2012-69 pp.139-141 |
MBE, NC (Joint) |
2012-03-15 13:20 |
Tokyo |
Tamagawa University |
Time Series Alignment with Gaussian Process Priors Shinji Akimoto, Nobuo Suematsu, Akira Hayashi, Kazunori Iwata (Hiroshima City Univ.) NC2011-163 |
We propose a nonparametric Bayesian approach to time series alignment. Given a set of time series data, we can sometimes... [more] |
NC2011-163 pp.245-250 |
IT, ISEC, WBS |
2012-03-02 11:15 |
Kanagawa |
|
Properties of Public-Keys for Knapsack Cryptosystems and the Low-density Attack Shogo Takai, Akira Hayashi (KIT) IT2011-71 ISEC2011-98 WBS2011-72 |
The knapsack cryptosystem invented by Merkle and Hellman is known to be broken with high probability
by the low density... [more] |
IT2011-71 ISEC2011-98 WBS2011-72 pp.157-161 |
IT, ISEC, WBS |
2012-03-02 11:40 |
Kanagawa |
|
Computer experiments on Shamir's attack against knapsack cryptosystems Jun Hashimoto, Akira Hayashi (KIT) IT2011-72 ISEC2011-99 WBS2011-73 |
The knapsack cryptosystem invented by Merkle and Hellman is known to be insecure against the low density attack of Lagar... [more] |
IT2011-72 ISEC2011-99 WBS2011-73 pp.163-169 |
ISEC, LOIS |
2011-11-14 11:15 |
Osaka |
Osaka Electro-Communication University |
An element-selective knapsack cryptosystem with encryption multipliers Yuki Okada, Akira Hayashi (KIT) ISEC2011-37 LOIS2011-31 |
The Merkle-Hellman knapsack cryptosystem is known to be vulnerable to the low density attack by Lagarias-Odlyzko. In thi... [more] |
ISEC2011-37 LOIS2011-31 pp.19-23 |
ISEC, LOIS |
2011-11-14 14:20 |
Osaka |
Osaka Electro-Communication University |
Three dimensional Dyck Path Cipher Jun Hashimoto, Akira Hayashi (KIT) ISEC2011-41 LOIS2011-35 |
The knapsack cryptosystem invented by Merkle and Hellman is known to be insecure against the low density attack of Lagar... [more] |
ISEC2011-41 LOIS2011-35 pp.47-54 |
ISEC |
2011-09-09 16:20 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Experimental results of the low density attack on the high density kanpsack cryptosystem Yuichi Ooki, Shogo Takai, Akira Hayashi (KIT) ISEC2011-32 |
[more] |
ISEC2011-32 pp.37-41 |
ISEC, IPSJ-CSEC, SITE, ICSS, EMM, IPSJ-SPT [detail] |
2011-07-13 09:50 |
Shizuoka |
Shizuoka University |
A Low Density Multiple Choice Knapsack Cryptosystem Akira Hayashi, Toshihiro Koike (KIT) ISEC2011-17 SITE2011-14 ICSS2011-22 EMM2011-16 |
The knapsack cryptosystem invented by Merkle and Hellman is known to be insecure against the low density attack by Lagar... [more] |
ISEC2011-17 SITE2011-14 ICSS2011-22 EMM2011-16 pp.91-96 |
NC, MBE (Joint) |
2010-03-09 13:45 |
Tokyo |
Tamagawa University |
A Comparison of HHMMs and HHCRFs in State Sequence Estimation Hirotaka Tamada, Akira Hayashi, Nobuo Suematsu, Kazunori Iwata (Hiroshima City Univ.) NC2009-105 |
HMMs (hidden Markov models) are well-known generative models for time series data. Recently, however, CRFs (conditional ... [more] |
NC2009-105 pp.101-106 |
NC, MBE (Joint) |
2010-03-09 14:10 |
Tokyo |
Tamagawa University |
Introducing a New Function to Save the Trouble of Parameter Tuning of Softmax Action-Selection Kenji Ono, Kazunori Iwata, Akira Hayashi, Nobuo Suematsu (Hiroshima City Univ.) NC2009-106 |
Markov decision processes are one of the most popular frameworks for reinforcement learning. The entropy of probability ... [more] |
NC2009-106 pp.107-112 |
NC, MBE (Joint) |
2010-03-10 13:20 |
Tokyo |
Tamagawa University |
ARMA Model Based Time Series Clustering Using Dirichlet Process Mixture Models Yuki Washizu, Nobuo Suematsu, Akira Hayashi, Kazunori Iwata (Hiroshima City Univ) NC2009-135 |
Dirichlet Process Mixture (DPM) models allow nonparametric mixture modeling in which the number of mixture components is... [more] |
NC2009-135 pp.279-284 |
IT, ISEC, WBS |
2010-03-04 10:15 |
Nagano |
Nagano-Engineering Campus, Shinshu University |
A Low Density Knapsack Cryptosystem Akira Hayashi (Kanazawa Inst. of Tech.) IT2009-128 ISEC2009-136 WBS2009-107 |
The knapsack cryptosystem invented by Merkle-Hellman has been proven to be insecure against the low density attack by La... [more] |
IT2009-128 ISEC2009-136 WBS2009-107 pp.367-372 |
ISEC, LOIS |
2008-11-14 10:20 |
Aichi |
Nagoya Noh Theater |
Uniquely decipherable Rabin cryptosystem with modulus p^kq Kensuke Takamura, Akira Hayashi (Kanazawa Institute of Technology) ISEC2008-84 OIS2008-60 |
T. Takagi proposed and analyzed variants of the RSA cryptosystem, in which the modulus is $p^k q$. He also suggested a v... [more] |
ISEC2008-84 OIS2008-60 pp.73-78 |
ISEC, LOIS |
2008-11-14 10:45 |
Aichi |
Nagoya Noh Theater |
On lattice bases for the Lagarias-Odlyzko attack against TSP cryptosystems Takeshi Taniguchi, Akira Hayashi (Kanazawa Institute of Technology) ISEC2008-85 OIS2008-61 |
The Lagarias-Odlyzko (LO) method is a tool for attacks against many variants of knapsack cryptosystems.Specifically it i... [more] |
ISEC2008-85 OIS2008-61 pp.79-82 |
NC, MBE (Joint) |
2008-03-14 11:10 |
Tokyo |
Tamagawa Univ |
Hierarchical Cluster Analysis of Phoneme Data Using the RDSP Method Yuta Onoshiro, Kazunori Iwata, Nobuo Suematsu, Akira Hayashi (Hiroshima City Univ.) NC2007-177 |
The RDSP method is an effective method in hierarchical cluster analysis
when the population of samples is characterize... [more] |
NC2007-177 pp.385-390 |
PRMU, IE |
2008-03-10 09:00 |
Ishikawa |
|
An Improvement of Graph Cut Segmentation Using Quadtree Representation Yukiya Okuda, Nobuo Suematsu, Akira Hayashi (Hiroshima City Univ.) IE2007-264 PRMU2007-248 |
In this paper, we propose a graph cut segmentation technique using quadtree representation. The graph cut approach to im... [more] |
IE2007-264 PRMU2007-248 pp.17-22 |
IE, IPSJ-AVM, CS, ITE-BCT |
2007-12-13 12:30 |
Aichi |
Nagoya Univ. |
On the relations of parameters in the steganography by the discrete cosine transformed images Minoru Watanabe, Akira Hayashi (KIT) CS2007-30 IE2007-113 |
Performance of steganography using discrete cosine transformed images depends on various factors and parameters. We inve... [more] |
CS2007-30 IE2007-113 pp.1-5 |
ISEC, LOIS |
2007-11-22 10:45 |
Hyogo |
Kobe University |
Comparative study of Rabin encryption and RSA encryption Kensuke Takamura, Akira Hayashi (KIT) ISEC2007-101 OIS2007-73 |
The Rabin cryptosystem is a public key system that is proven to be as intractable as integer factoring. One of its featu... [more] |
ISEC2007-101 OIS2007-73 pp.19-21 |
ISEC, LOIS |
2007-11-22 11:10 |
Hyogo |
Kobe University |
Cryptanalysis experiment of OTU2000 using the Lagarias-Odlyzko method Naoto Yamaguchi, Akira Hayashi (KIT) ISEC2007-102 OIS2007-74 |
Okamoto-Tanaka-Uchiyama proposed a public key cryptosystem in 2000, which we call OTU2000 in this paper. OTU2000 is a kn... [more] |
ISEC2007-102 OIS2007-74 pp.23-26 |
PRMU, HIP |
2007-09-04 15:30 |
Aichi |
Nagoya Univ. |
Cluster Analysis for Identifying the Hierarchical Structure of Subpopulations in Mixture Models Kazunori Iwata, Akira Hayashi (Hiroshima City Univ.) PRMU2007-86 HIP2007-95 |
This paper provides analysis of clusters of labeled samples to
identify their underlying hierarchical structure.
The k... [more] |
PRMU2007-86 HIP2007-95 pp.245-250 |