Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications
In this paper, an automatic synthesis flow of asynchronous (async) Quasi-Delay-Insensitive (QDI) circuits for cryptographic applications is presented. The synthesis flow accepts Verilog netlists as primary inputs, in part leverages on commercial electronic design automation tools for synthesis and v...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/84004 http://hdl.handle.net/10220/42123 http://ieeexplore.ieee.org/document/7459427/ |
| _version_ | 1826129624066686976 |
|---|---|
| author | Liu, Nan Chong, Kwen-Siong Ho, Weng-Geng Gwee, Bah Hwee Chang, Joseph Sylvester |
| author2 | School of Electrical and Electronic Engineering |
| author_facet | School of Electrical and Electronic Engineering Liu, Nan Chong, Kwen-Siong Ho, Weng-Geng Gwee, Bah Hwee Chang, Joseph Sylvester |
| author_sort | Liu, Nan |
| collection | NTU |
| description | In this paper, an automatic synthesis flow of asynchronous (async) Quasi-Delay-Insensitive (QDI) circuits for cryptographic applications is presented. The synthesis flow accepts Verilog netlists as primary inputs, in part leverages on commercial electronic design automation tools for synthesis and verifications, and relies heavily on the proposed translation processes for async netlist conversion and optimization. Particularly, a three-step synchronous-to-asynchronous-direct-translation (SADT) process is proposed. The first step is to translate a Verilog netlist into a direct circuit graph, allowing us to model QDI pipelines for performance analysis based on the same netlist function. Second, graph coarsening in combination with dynamic programing is adopted to analyze the fork-join slack matching of the QDI pipelines, aiming to balance the pipeline depths in any fork-join pipelines to optimize the system performance, and to reduce energy variations of the overall pipelines to against power-analysis-attack. The last step is to insert async local controllers/gates to ensure the async circuits consistent with QDI protocol, hence enhancing its timing robustness to accommodate Process-Voltage-Temperature variations. We show that, on the basis of simulations on the ISCAS benchmark circuits, the QDI circuits based on our proposed automatic synthesis flow are on average 20% faster and feature 30% less normalized energy derivations than un-optimized circuits. |
| first_indexed | 2024-10-01T07:43:34Z |
| format | Conference Paper |
| id | ntu-10356/84004 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T07:43:34Z |
| publishDate | 2017 |
| record_format | dspace |
| spelling | ntu-10356/840042020-09-26T22:19:22Z Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications Liu, Nan Chong, Kwen-Siong Ho, Weng-Geng Gwee, Bah Hwee Chang, Joseph Sylvester School of Electrical and Electronic Engineering 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE) Temasek Laboratories Integrated circuit modeling Cryptography In this paper, an automatic synthesis flow of asynchronous (async) Quasi-Delay-Insensitive (QDI) circuits for cryptographic applications is presented. The synthesis flow accepts Verilog netlists as primary inputs, in part leverages on commercial electronic design automation tools for synthesis and verifications, and relies heavily on the proposed translation processes for async netlist conversion and optimization. Particularly, a three-step synchronous-to-asynchronous-direct-translation (SADT) process is proposed. The first step is to translate a Verilog netlist into a direct circuit graph, allowing us to model QDI pipelines for performance analysis based on the same netlist function. Second, graph coarsening in combination with dynamic programing is adopted to analyze the fork-join slack matching of the QDI pipelines, aiming to balance the pipeline depths in any fork-join pipelines to optimize the system performance, and to reduce energy variations of the overall pipelines to against power-analysis-attack. The last step is to insert async local controllers/gates to ensure the async circuits consistent with QDI protocol, hence enhancing its timing robustness to accommodate Process-Voltage-Temperature variations. We show that, on the basis of simulations on the ISCAS benchmark circuits, the QDI circuits based on our proposed automatic synthesis flow are on average 20% faster and feature 30% less normalized energy derivations than un-optimized circuits. ASTAR (Agency for Sci., Tech. and Research, S’pore) Published version 2017-02-23T07:11:12Z 2019-12-06T15:36:17Z 2017-02-23T07:11:12Z 2019-12-06T15:36:17Z 2016 Conference Paper Liu, N., Chong, K.-S., Ho, W.-G., Gwee, B. H., & Chang, J. S. (2016). Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications. 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE), 850-853. https://hdl.handle.net/10356/84004 http://hdl.handle.net/10220/42123 http://ieeexplore.ieee.org/document/7459427/ en © 2016 European Design and Automation Association (EDAA). This paper was published in 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE) and is made available as an electronic reprint (preprint) with permission of EDAA. The published version is available at: [http://ieeexplore.ieee.org/document/7459427/]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law. 4 p. application/pdf |
| spellingShingle | Integrated circuit modeling Cryptography Liu, Nan Chong, Kwen-Siong Ho, Weng-Geng Gwee, Bah Hwee Chang, Joseph Sylvester Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications |
| title | Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications |
| title_full | Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications |
| title_fullStr | Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications |
| title_full_unstemmed | Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications |
| title_short | Low Normalized Energy Derivation Asynchronous Circuit Synthesis Flow through Fork-Join Slack Matching for Cryptographic Applications |
| title_sort | low normalized energy derivation asynchronous circuit synthesis flow through fork join slack matching for cryptographic applications |
| topic | Integrated circuit modeling Cryptography |
| url | https://hdl.handle.net/10356/84004 http://hdl.handle.net/10220/42123 http://ieeexplore.ieee.org/document/7459427/ |
| work_keys_str_mv | AT liunan lownormalizedenergyderivationasynchronouscircuitsynthesisflowthroughforkjoinslackmatchingforcryptographicapplications AT chongkwensiong lownormalizedenergyderivationasynchronouscircuitsynthesisflowthroughforkjoinslackmatchingforcryptographicapplications AT howenggeng lownormalizedenergyderivationasynchronouscircuitsynthesisflowthroughforkjoinslackmatchingforcryptographicapplications AT gweebahhwee lownormalizedenergyderivationasynchronouscircuitsynthesisflowthroughforkjoinslackmatchingforcryptographicapplications AT changjosephsylvester lownormalizedenergyderivationasynchronouscircuitsynthesisflowthroughforkjoinslackmatchingforcryptographicapplications |