Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ISEC |
2015-09-04 14:05 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Proposal of Multivariate Public Key Cryptosystem based on numerous prime numbers and Chinese Remainder Theorem
-- For quantum proof MPKC -- Shigeo Tsujii, Ryo Fujita, Masahito Gotaishi (Chuo Univ.) ISEC2015-30 |
The studies of Multivariate Public Key Cryptosystem (MPKC) have been originated in Matsumoto-Imai cryptosystem and Tsuji... [more] |
ISEC2015-30 pp.35-41 |
IT |
2015-01-30 14:55 |
Chiba |
|
Proof of Conjecture on Nonexistence of Circulant Hadamard Matrices for Order > 4 Yoshimasa Oh-hashi IT2014-58 |
There are various kinds of binary periodic sequences with the two-level autocorrelation function. However, in case of th... [more] |
IT2014-58 pp.23-28 |
IT |
2015-01-30 15:20 |
Chiba |
|
Additional Proof on Circulant Hadamard Matrices Yoshimasa Oh-hashi IT2014-59 |
There are various kinds of binary periodic sequences with the two-level autocorrelation function. However,
in case of t... [more] |
IT2014-59 pp.29-34 |
ISEC, LOIS |
2012-11-22 13:15 |
Shizuoka |
Shizuoka City Industry-University Exchange Center |
Secret sharing using the Chinese remainder theorem and its application Toshio Tsuji, Masao Kasahara (Osaka Gakuin Univ.) ISEC2012-66 LOIS2012-41 |
This paper presents a method of secret sharing using Chinese remainder theorem. In particular, we develop a system whic... [more] |
ISEC2012-66 LOIS2012-41 pp.61-68 |
VLD, CPSY, RECONF, IPSJ-SLDM [detail] |
2012-01-26 10:50 |
Kanagawa |
Hiyoshi Campus, Keio University |
A residue - weighted number conversion algorithm based on signed-digit arithmetic for a three-moduli set Masaya Arai, Yuuki Tanaka, Shugang Wei (Gunma Univ.) VLD2011-110 CPSY2011-73 RECONF2011-69 |
In this paper, a residue-weighted number conversion algorithm using SD(signed-digit) arithmetic for a moduli set \{$2^n$... [more] |
VLD2011-110 CPSY2011-73 RECONF2011-69 pp.111-116 |
ISEC |
2010-09-10 13:50 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Knapsack Cryptosystem Using Addition and Subtraction for Encryption Kunikatsu Kobayashi (Yamagata Univ.), Kotaro Honda (Alpha Systems) ISEC2010-43 |
We propose a knapsack cryptosystem using addition and subtraction for encryption. Super increasing sequences which are u... [more] |
ISEC2010-43 pp.31-34 |
IPSJ-SLDM, VLD, CPSY, RECONF [detail] |
2010-01-26 15:55 |
Kanagawa |
Keio Univ (Hiyoshi Campus) |
Residue-Binary Conversion Using Signed-Digit Number Arithmetic Changjun Jiang, Shugang Wei (Gunma Univ.) VLD2009-80 CPSY2009-62 RECONF2009-65 |
By introducing a signed-digit(SD) number arithmetic into a residue number system (RNS), arithmetic operations can be per... [more] |
VLD2009-80 CPSY2009-62 RECONF2009-65 pp.71-76 |
WBS, IT, ISEC |
2009-03-09 11:15 |
Hokkaido |
Hakodate Mirai Univ. |
A Note on Security of Knapsack Type PKC with Random Sequence Yasuyuki Murakami (Osaka Electro-Comm Univ.) IT2008-48 ISEC2008-106 WBS2008-61 |
Present author proposed a new method for constructing knapsack PKC
by using a random sequence.
In this paper, we propo... [more] |
IT2008-48 ISEC2008-106 WBS2008-61 pp.35-40 |
ISEC |
2004-12-17 13:35 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Experiments on the moduli p+1 and p+2 method for modular multiplication Hidetaka Kojima, Akira Hayashi (Kanazawa Inst.Tech.) |
The algorithm proposed by A.Hayashi is one of the methods for fast modular multiplication, which is needed in many crypt... [more] |
ISEC2004-99 pp.7-10 |