IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 21  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
SITE, ISEC, HWS, EMM, BioX, IPSJ-CSEC, IPSJ-SPT, ICSS [detail] 2020-07-21
16:10
Online Online Generalization of the hard part computation of final exponentiation for arbitrary BLS curves
Masaaki Shirase (FUN), Yuki Nanjo (Okayama Univ.) ISEC2020-30 SITE2020-27 BioX2020-33 HWS2020-23 ICSS2020-17 EMM2020-27
 [more] ISEC2020-30 SITE2020-27 BioX2020-33 HWS2020-23 ICSS2020-17 EMM2020-27
pp.105-110
ISEC, SITE, LOIS 2019-11-01
13:10
Osaka Osaka Univ. Character on elliptic curves over finite fields and even-oddness of the order of points
Masaaki Shirase (FUN) ISEC2019-66 SITE2019-60 LOIS2019-25
Let $p$ be a prime $ge 5$, $q$ be a power of $p$, and $Fq$ be a finite field with $q$ elements. Let $E/Fq$ be an ellipti... [more] ISEC2019-66 SITE2019-60 LOIS2019-25
pp.25-32
ISEC, SITE, ICSS, EMM, HWS, BioX, IPSJ-CSEC, IPSJ-SPT [detail] 2019-07-24
09:55
Kochi Kochi University of Technology A Performance Analysis of Supersingular Isogeny Diffie-Hellman with Several Classes of the Quadratic Extension Fields
Yuki Nanjo (Okayama Univ.), Masaaki Shirase (Future Univ. Hakodate), Takuya Kusaka, Yasuyuki Nogami (Okayama Univ.) ISEC2019-36 SITE2019-30 BioX2019-28 HWS2019-31 ICSS2019-34 EMM2019-39
It is well-known that the class of binomial extension field (BEF) is widely used to construct a quadratic extension fiel... [more] ISEC2019-36 SITE2019-30 BioX2019-28 HWS2019-31 ICSS2019-34 EMM2019-39
pp.207-214
ISEC 2018-05-16
10:00
Tokyo Ookayama Campus, Tokyo Institute of Technology Hardness of Discrete Logarithm Problem Based on New Operation on Elliptic Curve over Finite Field and New Digital Signature
Masaaki Shirase (FUN) ISEC2018-1
In the previous works, a new operation on elliptic curve over finite field $E(Fp)$, the Me operation $oplus$, is defined... [more] ISEC2018-1
pp.1-8
ISEC 2018-05-16
10:25
Tokyo Ookayama Campus, Tokyo Institute of Technology Determining BLS Curves for Pairing over Efficient Tower of Extension Field
Yuki Nanjo, Md. Al-Amin Khandaker (Okayama Univ.), Masaaki Shirase (Future Univ. Hakodate), Takuya Kusaka, Yasuyuki Nogami (Okayama Univ.) ISEC2018-2
Pairing-based cryptography (PBC) is receiving a lot of attention since it enables many innovative and multi-functional c... [more] ISEC2018-2
pp.9-16
ISEC, LOIS, SITE 2016-11-07
14:55
Fukui Community Hall & AOSSA Mall, Fukui Factorization of Composite Numbers having a Prime of Special Form with Elliptic Curve Method
Masaaki Shirase (FUN) ISEC2016-54 SITE2016-44 LOIS2016-32
A previous work cite{Shirase16}
considered when the elliptic curve method (ECM) successes with a scalar value $N$
fo... [more]
ISEC2016-54 SITE2016-44 LOIS2016-32
pp.19-26
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
ISEC 2015-09-04
10:30
Tokyo Kikai-Shinko-Kaikan Bldg. Improved addition algorithm for Edwards Curve
Masaaki Shirase (Future Univ Hakodate) ISEC2015-25
This paper introduces a new coordinate system (named ${cal P}times {cal P}$ coordinate system) in which a point $(x,y)$ ... [more] ISEC2015-25
pp.1-8
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
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
ISEC 2013-05-23
15:35
Tokyo Kikai-Shinko-Kaikan Bldg. Improvement in Addition formula on Elliptic Curves
Yoshitaka Nagai (Future Univ. Hakodate), Tetsuya Izu (Fujitsu Lab), Masaaki Shirase (Future Univ. Hakodate) ISEC2013-7
It is important to speed up scalar multiplication in elliptic curve cryptosystem and then various speeding-up techniques... [more] ISEC2013-7
pp.39-46
ISEC, LOIS 2011-11-15
14:50
Osaka Osaka Electro-Communication University On Definition Fields of Pairing Friendly Curves With Embedding Degree 4, 6, 8
Masaaki Shirase (FUN) ISEC2011-58 LOIS2011-52
The BN prime $p$, which is required for constructing the BN curve, is given by $p=36z^4+36z^3+24z^2+6z+1$. By the way, t... [more] ISEC2011-58 LOIS2011-52
pp.163-170
ISEC 2011-05-13
15:50
Tokyo Kikai-Shinko-Kaikan Bldg. Order of Elliptic Curve $y^2=x^3+2^i3^j$ Over Barreto-Naehrig Field
Masaaki Shirase (FUN) ISEC2011-6
Barreto-Naehrig (BN) curve is an elliptic curve over $\FP$ whose order is $36z^4+36z^3+18z^2+6z+1$ and the embedding deg... [more] ISEC2011-6
pp.37-44
ISEC 2010-05-21
17:10
Tokyo Kikai-Shinko-Kaikan Bldg. Applying Numerical Analysis Technique To Prime Factorization
Masaaki Shirase (FUN) ISEC2010-9
It is important to analyze the hardness of prime factorization
which the security of RSA cryptosystems is based on.
... [more]
ISEC2010-9
pp.57-62
IT, ISEC, WBS 2010-03-04
16:35
Nagano Nagano-Engineering Campus, Shinshu University Improved Method for Constructing Pairing-friendly Elliptic Curves with Fixed Coefficients
Masaaki Shirase (Future Univ-Hakodate) IT2009-78 ISEC2009-86 WBS2009-57
This paper shows that
the number of points of elliptic curves $y^2=x^3\pm 2$ and $y^2=x^3 \pm 16$ over $\Fp$ is
give... [more]
IT2009-78 ISEC2009-86 WBS2009-57
pp.45-52
IT, ISEC, WBS 2007-03-15
16:55
Gunma Gunma Univ. (Kiryu Campus) Universal $\eta_T$ Pairing Algorithm over Arbitrary Extension Degrees
Masaaki Shirase, Tsuyoshi Takagi (Future Univ. Hakodate), Eiji Okamoto (Univ of Tsukuba)
 [more] IT2006-76 ISEC2006-131 WBS2006-73
pp.87-92
ISEC, LOIS 2006-11-17
11:15
Chiba Univ. of Tokyo(Kashiwa Campus) Final exponentiation of ηT pairing
Masaaki Shirase, Tsuyoshi Takagi (Future Univ.-Hakodate), Eiji Okamoto (Univ. of Tsukuba)
 [more] ISEC2006-98 OIS2006-56
pp.19-26
ISEC, SITE, IPSJ-CSEC 2006-07-20
10:45
Okayama Okayama Univ. Efficient Calculation for Tate Pairing
Masaaki Shirase, Tsuyoshi Takagi (FUN), Eiji Okamoto (Univ of Tsukuba)
 [more] ISEC2006-12 SITE2006-9
pp.19-26
ISEC, LOIS 2005-11-14
15:45
Fukuoka Kitakyushu Science and Research Park A Digital Signature Suitable for XTR
Masaaki Shirase, Yasushi Hibino (JAIST)
This paper proposes a new efficient digital signature scheme for
XTR (Efficient and Compact Subgroup Trace Representat... [more]
ISEC2005-95 OIS2005-58
pp.39-44
 Results 1 - 20 of 21  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan