Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ISEC, IT, WBS |
2020-03-10 14:50 |
Hyogo |
University of Hyogo (Cancelled but technical report was issued) |
Construction of Efficient Decodable Sequence-Subset Codes Based on Constant Weight Codes Tomokazu Emoto, Takayuki Nozaki (Yamaguchi Univ.) IT2019-106 ISEC2019-102 WBS2019-55 |
Each codeword of sequence-subset codes is represented by a set of sequences.
The subset-sequence codes are used for err... [more] |
IT2019-106 ISEC2019-102 WBS2019-55 pp.107-112 |
VLD, DC, CPSY, RECONF, CPM, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2018-12-07 09:50 |
Hiroshima |
Satellite Campus Hiroshima |
A study on estimating the degradation of critical path delay using replica sensors Kunihiro Oshima, Son Bian, Masayuki Hiromoto, Takashi Sato (Kyoto Univ.) VLD2018-67 DC2018-53 |
In this paper, we propose a novel method to estimate the aging-induced timing degradation of logic circuits. In the prop... [more] |
VLD2018-67 DC2018-53 pp.195-200 |
IT, EMM |
2018-05-17 16:25 |
Tokyo |
Ookayama Campus, Tokyo Institute of Technology |
Public key attack on knapsak PKC based on subset sum decision problem Ryuichi Sakai, Yasuyuki Murakami (Osaka Electro-Communication Univ.) IT2018-6 EMM2018-6 |
In 2012, Murakami, Hamasho and Kasahara have proposed a knapsack PKC based on the subset sum decision problem. An attack... [more] |
IT2018-6 EMM2018-6 pp.31-34 |
IA, ICSS |
2015-06-12 11:10 |
Fukuoka |
Kyushu Institute of Technology Univ. |
Knapsack Cryptosystems with Random Secret Sequences using Logical And Operation Yasuyuki Murakami, Shinsuke Hamasho (OECU), Masao Kasahara (WU/CU) IA2015-11 ICSS2015-11 |
In 2012, the present authors proposed a knapsack public-key cryptosystem using a random secret sequence, which will be r... [more] |
IA2015-11 ICSS2015-11 pp.57-62 |
ISEC, IT, WBS |
2015-03-03 10:55 |
Fukuoka |
The University of Kitakyushu |
Knapsack Cryptosystem Using Three Random Secret Sequences Yasuyuki Murakami, Shinsuke Hamasho (OECU), Masao Kasahara (WU/CU) IT2014-91 ISEC2014-104 WBS2014-83 |
In 2012, the present authors proposed a knapsack public-key cryptosystem using a random secret sequence, which will be r... [more] |
IT2014-91 ISEC2014-104 WBS2014-83 pp.187-192 |
PRMU, IPSJ-CVIM, MVE [detail] |
2015-01-23 15:15 |
Nara |
|
Multi-Class Discrimination by Parallel Underdetermined System of Weight Equations Wataru Inoue, Tsuyoshi Fukuda, Hisayoshi Chugan, Takeshi Shakunaga (Okayama Univ.) PRMU2014-105 MVE2014-67 |
This paper discusses a parallel underdetermined approach for large-scale face recognition using the weight equations of ... [more] |
PRMU2014-105 MVE2014-67 pp.227-232 |
PRMU, IBISML, IPSJ-CVIM [detail] |
2014-09-01 11:00 |
Ibaraki |
|
Multi-Class Discrimination by Multi-Stage Configuration of 2-Layer Weight Equation Systems Takeshi Shakunaga, Tsuyoshi Fukuda, Hisayoshi Chugan (Okayama Univ) PRMU2014-38 IBISML2014-19 |
This paper discusses a novel hierarchical overdetermined approach for face tracking and recognition using the augmented ... [more] |
PRMU2014-38 IBISML2014-19 pp.13-19 |
ICSS, IA |
2014-06-05 16:15 |
Hyogo |
Takikawa Memorial Hall, Kobe University |
Attack on Knapsack Cryptography by Using Intermediary Plaintext Yoshihiro Kusanagi, Atsushi Nagao, Masakatu Morii (Kobe Univ.) IA2014-3 ICSS2014-3 |
Knapsack cryptography is the public key cryptosystem based on knapsack problem (especially subset sum problem).
Density... [more] |
IA2014-3 ICSS2014-3 pp.9-14 |
IBISML |
2012-03-12 10:00 |
Tokyo |
The Institute of Statistical Mathematics |
Chance Adjusted Infinite Relational Model for Asymmetric and Individually Different Relational Data Analysis Iku Ohama, Hiromi Iida (Panasonic), Takuya Kida, Hiroki Arimura (Hokkaido Univ.) IBISML2011-87 |
We propose a new generative model which analyses asymmetric and individually different relational data. In our proposed ... [more] |
IBISML2011-87 pp.1-8 |
AP, RCS (Joint) |
2011-11-16 09:45 |
Aichi |
Nagoya Congress Center |
Effect of antenna subset switching delay on reception performance in MIMO systems Kazuhiko Mitsuyama (NHK/Keio Univ.), Tetsuomi Ikeda (NHK), Tomoaki Ohtsuki (Keio Univ.) RCS2011-190 |
We have been studying a MIMO system that exploits macrodiversity effect to transmit high-quality videos across wide area... [more] |
RCS2011-190 pp.7-12 |
ISEC, IPSJ-CSEC, SITE, ICSS, EMM, IPSJ-SPT [detail] |
2011-07-13 14:55 |
Shizuoka |
Shizuoka University |
Construction of New Classes of Product-Sum Type Public Key Cryptosystem, K(IV)ΣPKC and K(I)ΣΠPKC Masao Kasahara (Osaka Gakuin Univ) ISEC2011-24 SITE2011-21 ICSS2011-29 EMM2011-23 |
In this paper, we present a new class of knapsack type PKC referred to as K(IV)$\Sigma$PKC. In a sharp contrast with the... [more] |
ISEC2011-24 SITE2011-21 ICSS2011-29 EMM2011-23 pp.137-144 |
COMP |
2011-03-09 14:10 |
Tokyo |
Chuo Univ. |
Constant-time approximation algorithms for the knapsack problem Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida (Kyoto Univ.) COMP2010-51 |
In this paper, we give constant-time approximation algorithms
for the knapsack problem.
A randomized algorithm is cal... [more] |
COMP2010-51 pp.29-36 |
ISEC, IT, WBS |
2011-03-04 13:25 |
Osaka |
Osaka University |
A Construction of New Class of Knapsack-Type Public Key Cryptosystem, K(III)ΣPKC Masao Kasahara (Osaka Gakuin Univ.) IT2010-124 ISEC2010-128 WBS2010-103 |
In this paper, we present a new class of knapsack type PKC referred to as K(?)ΣPKC. In a sharp contrast with the convent... [more] |
IT2010-124 ISEC2010-128 WBS2010-103 pp.373-376 |
ISEC |
2010-09-10 13:00 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Construction of New Class of Knapsack-Type Public Key Cryptosystem, K(I)ΣPKC, Constructed Based on K(I)Scheme Masao Kasahara (Osaka Gakuin Univ.) ISEC2010-41 |
The present author previously proposed a new scheme of strengthening a wide class of PKC's, referred to as K(I)Scheme.
... [more] |
ISEC2010-41 pp.21-25 |
ISEC |
2010-09-10 13:25 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Construction of New Class of Knapsack-Type Public Key Cryptosystem, K(II)ΣPKC Masao Kasahara (Osaka Gakuin Univ.) ISEC2010-42 |
In this paper, we present a new class of knapsack type PKC referred to as K(II)$\Sigma$PKC.
In a sharp contrast with th... [more] |
ISEC2010-42 pp.27-30 |
ISEC |
2009-05-22 14:40 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Another Experimental Security Analysis of OTU2000 through Attacks Based on Lattice Theory Daewoo Kim, Masahiro Mambo, Eiji Okamoto (Univ. of Tsukuba.) ISEC2009-10 |
OTU 2000 was proposed as a quantum cyrptosystem which may not be broken even if quantum computers are constructed. In th... [more] |
ISEC2009-10 pp.61-68 |
ISEC |
2005-12-16 13:25 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Improvement of Subset Difference Method Using Commutative Function Mai Nakagawa, Wataru Kishimoto (Chiba Univ.) |
When we bradcast some kind of data such as music or movie,
we employ a revocation scheme to protect its copyright.
N... [more] |
ISEC2005-114 pp.23-29 |
MBE, NC (Joint) |
2005-12-09 15:20 |
Aichi |
|
Splitting the feature subset selection of multiclass support vector machines Xin Hu, Mauricio Kugler (NIT), Anto Satriyo Nugroho (Chukyo Univ.), Susumu Kuroyanagi, Akira Iwata (NIT) |
One drawback on the use of Support Vector Machines (SVM) in real
applications is its slow classification speed, proport... [more] |
NC2005-86 pp.31-36 |
PRMU |
2004-09-10 - 2004-09-11 |
Kyoto |
|
A Vector Set Similarity Measure based on Bi-directional Mapping and Its Upper Bounds Takanori Yokoyama, Toshinori Watanabe, Hisashi Koga (UEC) |
We have proposed a fractal code retrieval method.
There, we interpreted a fractal code as a vector set, and introduced... [more] |
|
OCS, OFT |
2004-08-27 15:15 |
Hokkaido |
Muroran Institute of Technology |
Image Reconstruction in Time-Resolved Optical Tomography Khota Ichitsubo, Takumi Ishikawa, Takashi Ohtomo, Tadatoshi Tanifuji (KIT) |
Image reconstruction in time-resolved optical tomography (OT) utilizing only reflectance of inhomogeneous scattering med... [more] |
OCS2004-80 OFT2004-43 pp.69-72 |