教員一覧 List of faculty members
SHIRASE Masaaki 教授
SHIRASE, Masaaki Professor
SHIRASE Masaaki Professor
SHIRASE MasaakiBelongs:
Department of Media Architecture; Information architecture domain, Advanced ICT area, Complex Systems Information Science
Field of Study
Information securityPrevious employment/history
Japan Advanced Institute of Science and Technology (JAIST)Subjects in charge (undergraduate)
Hardware fundamentals, hardware design, information algebra and coding theoryBachelor of Science
Ph.D. (Information Science)
SHIRASE, Masaaki Professor
Affiliation：
Department of Media Architecture、 Media Architecture Field、 Advanced ICT Field、 Complex System Information Science Field
Research Fields
Information SecurityAcademic Background
Japan Advanced Institute of Science and Technology (JAIST)Subjects in Charge (Undergraduate)
Basic Hardware, Hardware Design, Information algebra and code theoryDegree
Dr. of Information ScienceResearch Projects
I research information security based on cryptography. Although cryptography may seem unremarkable at first glance, it is a very deep and rewarding field because it is a fundamental technology of information security. Public-key cryptography generally has a high computational cost for cryptographic processing, which hinders its widespread adoption, and therefore improvements to cryptographic algorithms and implementation methods are necessary. My recent research topics include improving algorithms for elliptic curve cryptography and pairing cryptography, parallel implementation targeting many-core coprocessors, and the development of copyright protection technologies for e-books. Furthermore, I also conduct cryptography decryption experiments from the perspective of analyzing the security of cryptography.
The appeal of research
Information security involves a wide range of fields, from mathematical disciplines like number theory (including the famous results of Euler and Fermat) and elliptic curve theory, to programming that considers CPU structure, applications to real-world systems (networks, mobile devices, etc.), and even law. When researching it, you encounter many surprising and mysterious things.
Achievements
- Pairing encryption hardware: As a postdoctoral researcher, I participated in the NEDO project "Research and Development of Pairing Lite" and was involved in the development of the world's first pairing encryption hardware.
- Cryptographic implementation for small CPUs: With the aim of implementing cryptography on small CPUs installed in sensor nodes, we developed the Block Comb method, an implementation method that takes into account the characteristics of small CPUs (memory access method and non-pipelined structure).
- Construction of an elliptic curve suitable for pairing: Pairing cryptography requires a special elliptic curve, and we have shown that this elliptic curve can be easily constructed.
- Design of cryptographic multipliers: We propose a method for constructing high-performance multibit multipliers useful when performing cryptographic processing in hardware.
Major publications and papers
- Fagen Li, Masaaki Shirase, et al. : Certificateless hybrid signcryption. Mathematical and Computer Modelling (2013)
- Takuya Hayashi, Masaaki Shirase, et al. : Solving a 676-bit Discrete logarithm problem in GF(36n). IEICE Transactions (2012)
- Ryoichi Sasaki, Masaaki Shirose, et al.: Fundamentals of Information Security, Kyoritsu Shuppan (2011)
- Universal construction of a 12th degree Extension field for asymmetric pairing. IEICE Transactions (2011)
- Masaaki Shirase, et al., : Efficient Implementation of pairing-based cryptography on a sensor node. IEICE Transactions (2009)
- Masaaki Shirase, et al. : Efficient computation of EtaT pairing over GF(24n) with Vandermonde matrix. ETRI Journal (2009)
Research Contents
My research content is information security based on cryptography technology. Cryptography technology is deep and changeable although it may seem to be unspectacular because it is a basic technology. Computational cost of modern cryptographies such as public key cryptographies is generally highly, thus, we have to improve algorithms and implementation method of them. My recent themes are improvement of algorithms for computing elliptic curve and pairing-based cryptographies, hardware implementation, software implementation targeting many-core co-processor in parallel, application of cryptographic technology to digital rights management (DRM) of digital books and experimental trial to break cryptography.
Attractive Factors of My Research
Information security becomes concerned with various fields, number theory including results by Euler and Fermat and elliptic curve theory in mathematics, programming technique based on architecture of CPU, application to practical systems such as network and mobile devise, and study of law. If you research information security, then you meet many miracle and amazing things.
Achievements
- Hardware of pairing-based cryptography : When I was a post-doctor, I joined NEDO Project, “Pairing Lite”, whose purpose was to design the first hardware of pairing-based cryptography.
Implementation of cryptography on tiny CPU : I proposed the Block Comb method to efficiently implement cryptography for tiny CPU mounted on sensor nodes, in which properties of tiny CPU such as type of memory access and non-pipelined organization were taken account. - Construction of elliptic curves suitable for pairing : We need special elliptic curves for pairing-based cryptography. I showed some of such elliptic curves were easily constructed.
- Design of multiplier for cryptography : I proposed how to design many-bit high-performance multiplier which was used for hardware implementation of cryptography.
Major Books and Papers
- Fagen Li, Masaaki Shirase, et al. : Certificateless hybrid signcryption. Mathematical and Computer Modelling (2013)
- Takuya Hayashi, Masaaki Shirase, et al. : Solving a 676-bit Discrete logarithm problem in GF(36n). IEICE Transactions (2012)
- Ryoichi Sasaki, Masaaki Shirase, et al. : Fundamentals of information security, Kyoritsu Shuppan (2011)
- Universal construction of a 12th degree Extension field for asymmetric pairing. IEICE Transactions (2011)
- Masaaki Shirase, et al., : Efficient Implementation of pairing-based cryptography on a sensor node. IEICE Transactions (2009)
- Masaaki Shirase, et al. : Efficient computation of Eta_T pairing over GF(2^4n) with Vandermonde matrix. ETRI Journal (2009)