Masaaki Shirase

IACR Cryptol. ePrint Arch., 2023

2022

Efficient Final Exponentiation for Cyclotomic Families of Pairing-Friendly Elliptic Curves with Any Prime Embedding Degrees.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2022

2021

Restrictions of Integer Parameters for Generating Attractive BLS Subfamilies of Pairing-Friendly Elliptic Curves with Specific Embedding Degrees.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2021

Improvement of Final Exponentiation for Pairings on BLS Curves with Embedding Degree 15.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

A Construction Method of Final Exponentiation for a Specific Cyclotomic Family of Pairing-Friendly Elliptic Curves with Prime Embedding Degrees.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Symposium on Computing and Networking, 2021

Efficient Final Exponentiation for Pairings on Several Curves Resistant to Special TNFS.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Symposium on Computing and Networking, 2021

2020

A Performance Analysis and Evaluation of SIDH Applied Several Implementation-Friendly Quadratic Extension Fields.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2020

A Construction Method of an Isomorphic Map between Quadratic Extension Fields Applicable for SIDH.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Specific Congruence Classes of Integer Parameters for Generating BLS Curves for Fast Pairings.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Symposium on Computing and Networking Workshops, 2020

2019

Elliptic Curve Method Using Complex Multiplication Method.

[BibT_eX]

[DOI]

Yusuke Aikawa

Koji Nuida

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

A Performance Analysis and Evaluation of SIDH with Implementation-Friendly Classes of Quadratic Extension Fields.

[BibT_eX]

[DOI]

Proceedings of the 2019 Seventh International Symposium on Computing and Networking, 2019

2018

Efficient Ate-Based Pairing over the Attractive Classes of BN Curves.

[BibT_eX]

[DOI]

Yuki Nanjo

Md. Al-Amin Khandaker

Takuya Kusaka

Yasuyuki Nogami

Proceedings of the Information Security Applications - 19th International Conference, 2018

2017

Condition on composite numbers easily factored with elliptic curve method.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication.

[BibT_eX]

[DOI]

Md. Al-Amin Khandaker

Proceedings of the Information Security and Cryptology - ICISC 2016 - 19th International Conference, Seoul, South Korea, November 30, 2016

Coordinate system for elliptic curve cryptosystem on twisted Edwards curve.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Consumer Electronics-Taiwan, 2016

2014

Elliptic Curve Scalar Multiplication with a Bijective Transform.

[BibT_eX]

[DOI]

Yoshitaka Nagai

Tetsuya Izu

Proceedings of the Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2014

2013

Pseudo 8-Sparse Multiplication for Efficient Ate-Based Pairing on Barreto-Naehrig Curve.

[BibT_eX]

[DOI]

Proceedings of the Pairing-Based Cryptography - Pairing 2013, 2013

An Improved Addition Formula on Elliptic Curves Given by Weierstrass Normal Form.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Network-Based Information Systems, 2013

Faster Scalar Multiplication for Elliptic Curve Cryptosystems.

[BibT_eX]

[DOI]

Yumi Sakemi

Tetsuya Izu

Proceedings of the 16th International Conference on Network-Based Information Systems, 2013

2012

Solving a 676-Bit Discrete Logarithm Problem in GF(36n).

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

2011

Universal Construction of a 12th Degree Extension Field for Asymmetric Pairing.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

2010

Barreto-Naehrig Curve With Fixed Coefficient - Efficiently Constructing Pairing-Friendly Curves -.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Solving a 676-bit Discrete Logarithm Problem in GF(36n).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Cryptanalysis of efficient proxy signature schemes for mobile communication.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2010

FPGA and ASIC implementations of the etaT pairing in characteristic three.

[BibT_eX]

[DOI]

Comput. Electr. Eng., 2010

2009

Efficient Implementation of Pairing-Based Cryptography on a Sensor Node.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

Universally Constructing 12-th Degree Extension Field for Ate Pairing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Identity-Based Hybrid Signcryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Certificateless Hybrid Signcryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

An Efficient Residue Group Multiplication for the etaT Pairing over F3m.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 16th Annual International Workshop, 2009

2008

Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2008

Some Efficient Algorithms for the Final Exponentiation of etaT Pairing.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

A More Compact Representation of XTR Cryptosystem.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Analysis and Improvement of Authenticatable Ring Signcryption Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Key Management Using Certificateless Public Key Cryptography in Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Network and Parallel Computing, IFIP International Conference, 2008

An Efficient Countermeasure against Side Channel Attacks for Pairing Computation.

[BibT_eX]

[DOI]

Proceedings of the Information Security Practice and Experience, 2008

Efficient Multi-PKG ID-Based Signcryption for Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 4th International Conference, 2008

Efficient Signcryption Key Encapsulation without Random Oracles.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 4th International Conference, 2008

On the Security of Online/Offline Signatures and Multisignatures from ACISP'06.

[BibT_eX]

[DOI]

Proceedings of the Cryptology and Network Security, 7th International Conference, 2008

2007

A Refined Algorithm for the etaT Pairing Calculation in Characteristic Three.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

A Coprocessor for the Final Exponentiation of the etaT Pairing in Characteristic Three.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Universal etaT Pairing Algorithm over Arbitrary Extension Degree.

[BibT_eX]

[DOI]

Proceedings of the Information Security Applications, 8th International Workshop, 2007

A Coprocessor for the Final Exponentiation of the eta T Pairing in Characteristic Three.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

Some Efficient Algorithms for the Final Exponentiation of eta T Pairing.

[BibT_eX]

[DOI]

Proceedings of the Information Security Practice and Experience, 2007

An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

Compressed XTR.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007

2006

Some Efficient Algorithms for the Final Exponentiation of ηT Pairing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

An Algorithm for the ηT Pairing Calculation in Characteristic Three and its Hardware Implementation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

2005

An architecture for elliptic curve cryptograph computation.

[BibT_eX]

[DOI]