| Building Secure Tame-Like Multivariate Public-Key Cryptosystems: the New TTS | |
|---|---|
| 學年 | 93 |
| 學期 | 2 |
| 發表日期 | 2005-07-01 |
| 作品名稱 | Building Secure Tame-Like Multivariate Public-Key Cryptosystems: the New TTS |
| 作品名稱（其他語言） | |
| 著者 | 楊柏因; 陳君明 |
| 作品所屬單位 | 淡江大學數學學系 |
| 出版者 | 澳洲昆士蘭科技大學 |
| 會議名稱 | 澳亞資訊安全與隱私研討會 |
| 會議地點 | 布里斯本，澳洲 |
| 摘要 | Multivariate public-key cryptosystems (sometimes polynomial-based PKC’s or just multivariates) handle polynomials of many variables over relatively small fields instead of elements of a large ring or group. The “tame-like” or “sparse” class of multivariates are distinguished by the relatively few terms that they have per central equation. We explain how they differ from the “big-field” type of multivariates, represented by derivatives of C ∗ and HFE, how they are better, and give basic security criteria for them. The last is shown to be satisfied by efficient schemes called “Enhanced TTS” which is built on a combination of the Oil-and-Vinegar and Triangular ideas. Their security levels are estimated. In this process we summarize and in some cases, improve rank-based attacks, which seek linear combinations of certain matrices at given ranks. These attacks are responsible for breaking many prior multivariate designs. |
| 關鍵字 | Smart Card;Signature Scheme;Central Equation;Digital Signature Scheme;Multivariate Signature Scheme |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | 無 |
| 研討會時間 | 20050701~20050701 |
| 通訊作者 | |
| 國別 | TWN |
| 公開徵稿 | |
| 出版型式 | |
| 出處 | |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58916 ) |
GoogleAnalytics