書 正版 A Lattice Attack on the McEliece Public Key Cryptosyste的詳細資訊
書籍為正版書籍 ,部分絕版書籍,為舊書或者二手書籍,建議咨詢客服
1.書籍均為簡體正版書籍,大陸版社直接寄送。部分絕版書籍為二手二手書籍
2.貨物3天內安排寄送,到貨時間大概8~12天,有時間要求請及時聯繫。
3.圖書因物流運送且多為單冊包裝,偶有碰撞折損潮損,非無法閱讀均不可退貨,完美要求者請切勿下標。
4.大物件商品超過超區規格,需要下標宅配到付哦 。
5.可免費代尋書籍!店鋪每天上新歡迎關注!
6.收到商品有任何問題,歡迎咨詢,感謝~
開 本:20開
紙 張:輕型紙
包 裝:平裝-膠訂
是否套裝:否
國際標準書號ISBN:9783639055474
所屬分類:圖書>英文原版書>科學與技術 Science & Techology
A Lattice Attack on the McEliece Public Key Cryptosystem
作者: Velikova, Zaharina
出版社: VDM Verlag Dr. Mueller E.K. (2008年08月03日)
頁數: 132頁
語種: 英語
ISBN: 9783639055474
條形碼: 9783639055474
商品重量: 190.00g
商品尺寸: 22.86cm * 15.24cm * 0.71cm
編輯推薦
The McEliece cryptosystem was proposed by R.McEliece in 1978. In its original version it is based on Goppa codes. Given a public key matrix G and a codeword c=mG+e, we reduce the problem of recovering the error vector e to the shortest lattice vector problem. Using Conway and Sloane\'s \"Construction A\", we construct a basis of a lattice, in which the norm of the shortest vector w.r.t. lp norm is equal to the lp norm of the error vector e for p>log(t), where t is the weight of the error vector e. To find such shortest vector in our lattice we use the LLL and block basis reduction algorithms for the lp norm, which guarantee only an approximation of the length of the shortest lattice vector. Our tests show that this attack method provides no positive results for Goppa codes of length more than 127.商品備註・物品狀況:全新・最新關注時間:2025-08-06