Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 陳敬之 | zh_TW |
dc.contributor.author | 陳榮傑 | zh_TW |
dc.contributor.author | Chen, Ching-Tzu | en_US |
dc.contributor.author | Chen, Rong-Jaye | en_US |
dc.date.accessioned | 2018-01-24T07:40:29Z | - |
dc.date.available | 2018-01-24T07:40:29Z | - |
dc.date.issued | 2017 | en_US |
dc.identifier.uri | http://etd.lib.nctu.edu.tw/cdrfb3/record/nctu/#GT070456011 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/141292 | - |
dc.description.abstract | 目前針對隱藏體系統之密碼系統最佳的攻擊法是 Gröbner 基底攻擊演算法,可快速解出由隱藏體系統的公鑰所建構的,定義在有限體上的⼆次多變數的多項式系統的解。 在此篇論文中,我們將陳述隱藏體系統的加解密結構,以及針對產生 Gröbner 基底的演算法,F4 演算法,做其運算結構之陳述。我們另外提出針對原始定義在 GF(2) 底下的 Gröbner 基底攻擊演算法的優化,並進一步使用空間優化來加速原始 F4 演算法的運算效能。 | zh_TW |
dc.description.abstract | The current best attack to break the Hidden Field Equations (HFE) cryptosystem is known as the fast Gröbner basis computation, which can solve the quadratic multivariate polynomial systems over finite field formed from HFE’s public key. In this paper, we aim to reveal the structure of HFE and the flow of F4 algorithm which computes the Gröbner basis for the given polynomial system. We give an optimization for the Gröbner basis approach attack under GF(2), and use some space tradeoff to improve the performance of the original F4 algorithm to run faster. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | 隱藏體系統 | zh_TW |
dc.subject | 多變數多項式系統 | zh_TW |
dc.subject | Gröbner 基底 | zh_TW |
dc.subject | F4 演算法 | zh_TW |
dc.subject | Hidden field equation | en_US |
dc.subject | Multivariate polynomial systems | en_US |
dc.subject | Gröbner basis | en_US |
dc.subject | F4 algorithm | en_US |
dc.title | 隱藏體方程式之 Gröbner 基底改良攻擊法 | zh_TW |
dc.title | The Attack on Hidden Field Equations with Improved Gröbner basis approach | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
Appears in Collections: | Thesis |