Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT |
2016-07-29 10:15 |
Fukuoka |
Seminar House, Fukuoka Univ. |
A Consideration of an Efficient Calculation over the Extension Field of Degree 4 for Elliptic Curve Pairing Cryptography Akihito Sanada (Okayama Univ.), Sylvain Duquesne (Univ. Rennes 1), Masaaki Shirase (FUN), Yasuyuki Nogami (Okayama Univ.) IT2016-29 |
Pairing based cryptography with BLS(Boneh-Lynn-Shacham) curve is defined over extension field of degree 24 .
Base exten... [more] |
IT2016-29 pp.45-50 |
IT |
2016-07-29 10:40 |
Fukuoka |
Seminar House, Fukuoka Univ. |
A Consideration of an Efficient Calculation over the Extension Field of Degree 3 for Elliptic Curve Pairing Cryptography Yuta Kodera (Okayama Univ.), Sylvain Duquesne (Univ. Rennes 1), Masaaki Shirase (FUN), Yasuyuki Nogami (Okayama Univ.) IT2016-30 |
Recently, pairing based cryptography, which is one of public-key cryptographies, has been paid attention. Mathematically... [more] |
IT2016-30 pp.51-56 |
IT |
2015-09-04 10:50 |
Ishikawa |
Hakusan Shobutei |
A Consideration on Trace Sequence over Finite Field Yasuyuki Nogami, Hiroto Ino (Okayama Univ.), Kazuyoshi Tsuchiya (Koden), Satoshi Uehara (Kitakyu Univ.), Robert H, Morelos Zaragoza (SJSU) IT2015-38 |
The authors have proposed a class of pseudo multi-value sequences generated by trace and power residue over nite eld. ... [more] |
IT2015-38 pp.25-29 |
ISEC, IT, WBS |
2015-03-02 10:55 |
Fukuoka |
The University of Kitakyushu |
A Consideration of NTRU Whose Modular Polynomial Is All One Polynomial Koki Misumi, Yasuyuki Nogami (Okayama Univ) IT2014-63 ISEC2014-76 WBS2014-55 |
Quantum computer will break most of recent public key cryptosystems by Shor's algorithm.
Post-quantum cryptosystem whic... [more] |
IT2014-63 ISEC2014-76 WBS2014-55 pp.5-10 |
ISEC, IT, WBS |
2015-03-02 11:20 |
Fukuoka |
The University of Kitakyushu |
Efficient Calculation of Pairing with Supersingular Curve on 2-dimentional Extension Field Akito Kumano, Yasuyuki Nogami (Okayama Univ.), Masaaki Shirase (Future University Hakodate) IT2014-64 ISEC2014-77 WBS2014-56 |
[more] |
IT2014-64 ISEC2014-77 WBS2014-56 pp.11-17 |
ISEC, IT, WBS |
2015-03-02 16:00 |
Fukuoka |
The University of Kitakyushu |
A Relation between Autocorrelations of Sequences Generated by the Logistic Map over Prime Fields and Loops whose Periods are Almost Same as Precisions Takeru Miyazaki (The Univ. of Kitakyushu), Shunsuke Araki (Kyushu Inst. of Tech.), Satoshi Uehara (The Univ. of Kitakyushu), Yasuyuki Nogami (Okayama Univ.) IT2014-77 ISEC2014-90 WBS2014-69 |
Logistic map over prime fields is one of maps to calculate iteratively by using computers. Though a sequence generated b... [more] |
IT2014-77 ISEC2014-90 WBS2014-69 pp.97-102 |
IT |
2014-12-09 16:35 |
Toyama |
Unazuki New Otani Hotel |
[Invited Talk]
Pairing-based cryptography with elliptic curve and vector decomposition problem Yasuyuki Nogami (Okayama Univ.) IT2014-53 |
As non--symmetric public key cryptographies defined over finite field, especially extension field, elliptic curve crypto... [more] |
IT2014-53 pp.19-24 |
DC |
2014-10-27 14:55 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Dynamic Switching of Job Selection Methods in Volunteer Computing Shinya Yasuda, Kan Watanabe (Okayama Univ.), Masaru Fukushi (Yamaguchi Univ.), Yasuyuki Nogami (Okayama Univ.) DC2014-22 |
This paper proposes a dynamic switching method of job selection methods in volunteer computing (VC) systems, where the c... [more] |
DC2014-22 pp.5-10 |
CPSY, DC (Joint) |
2014-07-29 16:05 |
Niigata |
Toki Messe, Niigata |
A Job Scheduling Method Based on Completion Probability of Voting in Volunteer Computing Yuto Miyakoshi, Kan Watanabe (Okayama Univ.), Masaru Fukushi (Yamaguchi Univ.), Yasuyuki Nogami (Okayama Univ.) DC2014-20 |
This paper proposes a job scheduling method based on an expected probability of completion of voting in volunteer comput... [more] |
DC2014-20 pp.17-24 |
CPSY, DC (Joint) |
2014-07-30 09:00 |
Niigata |
Toki Messe, Niigata |
An Implementation of Credibility-based Job Scheduling in Volunteer Computing Systems Shun-ichiro Tani, Kan Watanabe (Okayama Univ.), Masaru Fukushi (Yamaguchi Univ.), Yasuyuki Nogami (Okayama Univ.) CPSY2014-32 |
This paper presents an implementation of credibility-based job-scheduling in Volunteer Computing (VC) systems with 10-50... [more] |
CPSY2014-32 pp.131-136 |
ISEC, IT, WBS |
2014-03-11 11:25 |
Aichi |
Nagoya Univ., Higashiyama Campus |
A Distribution Related to The Exponentiation Inversion Problem Reduced from Fixed Argument Pairing Inversion 2 Problem over Barreto-Naehrig Curve Shoichi Akagi, Yasuyuki Nogami (Okayama Univ.) IT2013-80 ISEC2013-109 WBS2013-69 |
As one of problems that guarantee the security of pairing--based cryptography, {em pairing inversion} problem is studied... [more] |
IT2013-80 ISEC2013-109 WBS2013-69 pp.163-168 |
IPSJ-SLDM, CPSY, RECONF, VLD [detail] |
2014-01-29 08:55 |
Kanagawa |
Hiyoshi Campus, Keio University |
Evaluation of parallelization for multiple-precision Cyclic Vector Multiplication Algorithm using CUDA Satoshi Haramura, Hiroto Kagotani, Yasuyuki Nogami, Yuji Sugiyama (Okayama Univ.) VLD2013-120 CPSY2013-91 RECONF2013-74 |
[more] |
VLD2013-120 CPSY2013-91 RECONF2013-74 pp.109-112 |
IT |
2014-01-27 15:50 |
Osaka |
Osaka City University |
An Implementation of Elliptic Curve Scalar Multiplication with Improved Quadrupling of Rational Point Gegerihu, Yasuyuki Nogami (Okayama Univ.), Masaaki Shirase (Future Univ. Hakodate) IT2013-53 |
This paper introduces a fast implementation of elliptic curve scalar multiplication with an improved quadrupling in Jaco... [more] |
IT2013-53 pp.45-49 |
IT |
2013-05-24 10:25 |
Fukui |
Hotel Matuya Sensen at Awara-onsen, Fukui Pref. |
A Binary Sequence Generated by Legendre Symbol and Primitive Polynomial over Odd Characteristic Yasuyuki Nogami (Okayama Univ.), Satoshi Uehara (Univ. of Kitakyushu), Kazuki Tada (Okayama Univ.) IT2013-2 |
[more] |
IT2013-2 pp.5-8 |
ISEC |
2013-05-23 15:10 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Consideration on Pairing Inversion Problem of Pairing Based Cryptography with BN Curve Yasuyuki Nogami, Yuki Kono, Shoichi Akagi (Okayama Univ.) ISEC2013-6 |
[more] |
ISEC2013-6 pp.35-37 |
IT |
2012-07-19 13:50 |
Aichi |
Toyota Technological Institute |
Representative Decision Algorithm Efficient for Pollard's Rho Method on G2 over Barreto-Naehring Curve Yuki Kono, Kenta Nekado, Yuki Mori, Tomonori Arii, Yasuyuki Nogami (Okayama Univ) IT2012-9 |
Pollard's rho method is well-known as an efficient method solving Elliptic Curve Discrete Logarithm Problem (ECDLP).
T... [more] |
IT2012-9 pp.1-6 |
ISEC |
2012-05-18 14:15 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
An Approach for Constructing Primitive Polynomials of Degree 2^i over Odd Characteristic Prime Field Yasuyuki Nogami, Yusuke Takai (Okayama Univ.), Shigeki Kobayashi (Nagano National College of Technology), Tatsuo Sugimura (Shinsyu Univ.), Satoshi Uehara (Kitakyushu City Univ.) ISEC2012-4 |
This paper considers an approach to obtain primitive polynomials over odd characteristic field $\mathbb{F}_{p}$ for whic... [more] |
ISEC2012-4 pp.19-24 |
ET |
2012-03-10 11:40 |
Kagawa |
|
Development of Management System for Open Source Software Usage Manuals Using Content Management System Yukikazu Murakami (Kagawa NCT), Denzai Ri, Nobuo Funabiki, Yasuyuki Nogami (Okayama Univ) ET2011-133 |
[more] |
ET2011-133 pp.191-196 |
IT |
2011-07-22 10:20 |
Okayama |
Okayama University |
Paring-Friendly Curve over Extension Field of Degree r where r is The Group Order Yuki Mori, Taichi Sumo, Yasuyuki Nogami (Okayama Univ.), Tomoko K. Matsushima (Polytechnic Univ.), Satoshi Uehara (Kitakyusyu City Univ.) IT2011-18 |
This paper considers the torsion group structure
when the extension degree of the definition field of
the non-supersin... [more] |
IT2011-18 pp.47-52 |
ISEC, IPSJ-CSEC, SITE, ICSS, EMM, IPSJ-SPT [detail] |
2011-07-13 13:50 |
Shizuoka |
Shizuoka University |
Memory saving implementation of Cyclic Vector Multiplication Algorithm Ryosuke Takahashi, Kenta Nekado, Yusuke Takai, Yasuyuki Nogami, Hiroto Kagotani (Okayama Univ.), Takashi Narita (TEL) ISEC2011-25 SITE2011-22 ICSS2011-30 EMM2011-24 |
The authors have proposed a cyclic vector multiplication algorithm abbreviated as CVMA
that is flexible to the paramet... [more] |
ISEC2011-25 SITE2011-22 ICSS2011-30 EMM2011-24 pp.145-150 |