Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT, ISEC, WBS |
2013-03-07 10:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Universal Coding for Asynchronous Slepian-Wolf Coding Systems Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2012-62 ISEC2012-80 WBS2012-48 |
Slepian-Wolf (SW) coding system is the most fundamental source coding system in multi-terminal information theory. In t... [more] |
IT2012-62 ISEC2012-80 WBS2012-48 pp.1-6 |
IT, ISEC, WBS |
2013-03-07 10:55 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
On a channel-simulation scheme based on reverse Shannon theorem Daichi Nagai, Tomohiro Ogawa (Univ. of Electro- Comm.) IT2012-63 ISEC2012-81 WBS2012-49 |
Reverse Shannon theorem (RST) was established by Bennett et al. in 2002.
RST shows that an arbitrarily given discrete m... [more] |
IT2012-63 ISEC2012-81 WBS2012-49 pp.7-11 |
IT, ISEC, WBS |
2013-03-07 11:20 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A Numerical Study on a Noisy Order of Quantum Channels and Information Quantities Taishi Okazawa, Jun Suzuki, Tomohiro Ogawa (Univ. of Electro- Comm.) IT2012-64 ISEC2012-82 WBS2012-50 |
We study a noisy order of quantum channels called the degraded order,
which shows that one channel is a degraded versio... [more] |
IT2012-64 ISEC2012-82 WBS2012-50 pp.13-17 |
IT, ISEC, WBS |
2013-03-07 11:45 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Order Estimator of Stationary Markov Sources Using Codeword Length of Universal Code Shinji Kanazawa, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2012-65 ISEC2012-83 WBS2012-51 |
Merhav et al. studied the problem of estimating the order of stationary Markov sources. They proposed an order estimator... [more] |
IT2012-65 ISEC2012-83 WBS2012-51 pp.19-24 |
IT, ISEC, WBS |
2013-03-07 10:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A discussion about efficient double length hash function Tsuyoshi Sawada, Atsuko Miyaji (JAIST) IT2012-66 ISEC2012-84 WBS2012-52 |
[more] |
IT2012-66 ISEC2012-84 WBS2012-52 pp.25-30 |
IT, ISEC, WBS |
2013-03-07 10:55 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Consideration on Security Requirements of Fail-stop Signature Schemes Masahiro Nomura, Katsuhiro Nakamura (Chiba Univ.) IT2012-67 ISEC2012-85 WBS2012-53 |
A fail-stop signature (FSS) scheme is a digital signature scheme with forgery-proof function, in which even if an advers... [more] |
IT2012-67 ISEC2012-85 WBS2012-53 pp.31-38 |
IT, ISEC, WBS |
2013-03-07 11:20 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Improved Elliptic Curve Scalar Multiplication Using Triple Formula Atsuko Miyaji, Cuinan Yang (JAIST) IT2012-68 ISEC2012-86 WBS2012-54 |
Elliptic Curve Cryptosystems (ECC) has attracted much attention because of its short key size in comparison to other pub... [more] |
IT2012-68 ISEC2012-86 WBS2012-54 pp.39-44 |
IT, ISEC, WBS |
2013-03-07 11:45 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A report on Indocrypt2012 Takanori Yasuda (ISIT), Yu Sasaki (NTT), Kouichi Sakurai (Kyushu Univ.) IT2012-69 ISEC2012-87 WBS2012-55 |
This paper reports on the 13th International Conference on Cryptology
in India (Indocrypt2012), held on December 9 to ... [more] |
IT2012-69 ISEC2012-87 WBS2012-55 pp.45-51 |
IT, ISEC, WBS |
2013-03-07 13:40 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Construction of A Large Class of Optimum Linear Constant Weight Codes Masao Kasahara, Shigeichi Hirasawa (Waseda Univ.) IT2012-70 ISEC2012-88 WBS2012-56 |
[more] |
IT2012-70 ISEC2012-88 WBS2012-56 pp.53-58 |
IT, ISEC, WBS |
2013-03-07 14:05 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A Probabilistic Method for Computing the Weight Distribution of Non-Binary LDPC Codes (II) Jun'ichi Tsurumi (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) IT2012-71 ISEC2012-89 WBS2012-57 |
[more] |
IT2012-71 ISEC2012-89 WBS2012-57 pp.59-64 |
IT, ISEC, WBS |
2013-03-07 14:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Performance Evaluation of a Combination of Sum-Product and Two-bit Bit Flipping Decoding Algorithms Koh Matsushita, Hiroshi Kamabe (Gifu Univ.) IT2012-72 ISEC2012-90 WBS2012-58 |
A Bit-Flipping algorith which uses only two bits for each node has been proposed. The bit error probability of the metho... [more] |
IT2012-72 ISEC2012-90 WBS2012-58 pp.65-70 |
IT, ISEC, WBS |
2013-03-07 13:40 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Side Channel Security Evaluation of AES Software Implementation by Chosen-Input Method Shohei Saito, Takeshi Kishikawa, Tsutomu Matsumoto (Yokohama National Univ.) IT2012-73 ISEC2012-91 WBS2012-59 |
[more] |
IT2012-73 ISEC2012-91 WBS2012-59 pp.71-78 |
IT, ISEC, WBS |
2013-03-07 14:05 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Extensive Performance Analysis of Cryptographic Primitives on the RL78 microcontroller Yumiko Murakami, Mitsuru Matsui (Mitsubishi Electric) IT2012-74 ISEC2012-92 WBS2012-60 |
[more] |
IT2012-74 ISEC2012-92 WBS2012-60 pp.79-85 |
IT, ISEC, WBS |
2013-03-07 14:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Impact of High-Speed Photodetector on Side Channel Attack through LED Pilot Lamp Shohei Saito, Tsutomu Matsumoto (Yokohama National Univ.) IT2012-75 ISEC2012-93 WBS2012-61 |
[more] |
IT2012-75 ISEC2012-93 WBS2012-61 pp.87-94 |
IT, ISEC, WBS |
2013-03-07 13:40 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. Tech.), Yuki Shima (Univ. of Fukui) IT2012-76 ISEC2012-94 WBS2012-62 |
Dub\'{e} and Beaudoin proposed a technique of lossless data compression called compression via substring enumeration (CS... [more] |
IT2012-76 ISEC2012-94 WBS2012-62 pp.95-100 |
IT, ISEC, WBS |
2013-03-07 14:05 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
An Approach to Multisource-Multicast Problem using Linear Network Code Shigeki Miyake (NTT) IT2012-77 ISEC2012-95 WBS2012-63 |
When network coding is applied to multicast problem
that consists of one source and multi sinks,
the maximum value of ... [more] |
IT2012-77 ISEC2012-95 WBS2012-63 pp.101-106 |
IT, ISEC, WBS |
2013-03-07 14:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A consideration on minimum storage regenerating codes for functions Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2012-78 ISEC2012-96 WBS2012-64 |
We consider regenerating codes for functions. Regenerating codes are a class of codes for distributed storage systems th... [more] |
IT2012-78 ISEC2012-96 WBS2012-64 pp.107-112 |
IT, ISEC, WBS |
2013-03-07 15:05 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Construction of Minimal dominating set for the Rank Modulation based on the Compressed Encoding Yuya Kanbayashi, Tomoharu Shibuya (Sophia Univ.) IT2012-79 ISEC2012-97 WBS2012-65 |
Rank Modulation code is a recoding code expressing information by using the mutual relation between the level of electri... [more] |
IT2012-79 ISEC2012-97 WBS2012-65 pp.113-118 |
IT, ISEC, WBS |
2013-03-07 15:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Verification of a Conjecture on Performance of Floating codes using Hamming Codes Naoyoshi Okamae, Toru Fujiwara (Osaka Univ.), Yuichi Kaji (NAIST) IT2012-80 ISEC2012-98 WBS2012-66 |
Floating codes aim to store rewritable data in irreversible memories
like flash memories, whose value can only transit ... [more] |
IT2012-80 ISEC2012-98 WBS2012-66 pp.119-124 |
IT, ISEC, WBS |
2013-03-07 15:55 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Iterative Coset Coding Algorithms for Two-Dimensional Weight Constraint Yutaka Kobayashi, Tadashi Wadayama (Nagoya Inst. of Tech.) IT2012-81 ISEC2012-99 WBS2012-67 |
In this paper, we propose iterative coset coding algorithms for two-dimensional weight constraint.
Coset coding algorit... [more] |
IT2012-81 ISEC2012-99 WBS2012-67 pp.125-130 |