Presentation 2021-04-12
Approximate Solution of Large-Scale Job Shop Scheduling Problem and Its Application to Hardware Cryptographic Design
Kento Ikeda, Makoto Ikeda,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The optimal design of cryptographic data paths in hardware can be considered as a job-shop scheduling problem. This problem becomes NP-complete when the number of jobs is large, and it is difficult to find a solution. We investigate a method to obtain an approximate solution in finite time by repeating the process of dividing the problem into small optimization problems, solving them, and combining the results several times. The approximate solution will be used to design the hardware for the sub-sequence of the pairing algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Elliptic Curve Cryptography / Optimal Ate paring / Scheduling / ASIC
Paper # HWS2021-2
Date of Issue 2021-04-05 (HWS)

Conference Information
Committee HWS
Conference Date 2021/4/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Tokyo University/Online
Topics (in Japanese) (See Japanese page)
Topics (in English) Hardware Security
Chair Makoto Ikeda(Univ. of Tokyo)
Vice Chair Yasuhisa Shimazaki(Renesas Electronics) / Makoto Nagata(Kobe Univ.)
Secretary Yasuhisa Shimazaki(Kyushu Univ.) / Makoto Nagata(NTT)
Assistant

Paper Information
Registration To Technical Committee on Hardware Security
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Approximate Solution of Large-Scale Job Shop Scheduling Problem and Its Application to Hardware Cryptographic Design
Sub Title (in English)
Keyword(1) Elliptic Curve Cryptography
Keyword(2) Optimal Ate paring
Keyword(3) Scheduling
Keyword(4) ASIC
1st Author's Name Kento Ikeda
1st Author's Affiliation The University of Tokyo(Tokyo Univ.)
2nd Author's Name Makoto Ikeda
2nd Author's Affiliation The University of Tokyo(Tokyo Univ.)
Date 2021-04-12
Paper # HWS2021-2
Volume (vol) vol.121
Number (no) HWS-1
Page pp.pp.7-12(HWS),
#Pages 6
Date of Issue 2021-04-05 (HWS)