English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 58323/91876 (63%)
造訪人次 : 14060613      線上人數 : 65
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58822

    題名: Building Secure Tame-Like Multivariate Public-Key Crpotosystems: the New TTS
    作者: 楊柏因
    貢獻者: 淡江大學數學學系
    日期: 2005-07
    上傳時間: 2011-10-01 21:13:55 (UTC+8)
    摘要: 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.
    關聯: Information Security and Privacy , pp.518-531
    DOI: 10.1007/11506157_43
    顯示於類別:[數學學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    Building secure tame-like multivariate public-key cryptosystems.pdf232KbAdobe PDF0檢視/開啟



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋