This book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The initial problems are reformulated in terms of systems of polynomial equations over a finite field, which solution(s) should yield a way to solve the initial problems. Solutions of such systems are obtained using Grbner bases. The first part is devoted to an application of system solving to decoding linear codes. The original method for arbitrary linear codes, which in some sense generalizes the Newton identities method, is proposed. Since for the method to work the field equations" are not needed, it is possible to handle quite large codes. The second part is about the algebraic cryptanalysis of the AES. The systems usually considered in this area have many auxiliary variables that are not needed for the key recovery. Therefore, here the approach is provided where these variables are eliminated and a resulting system in key-variables only is then solved. This is shown to be effective for small scale variants of the AES especially when using several plain-/ciphertext pairs.
具體描述
讀後感
評分
評分
評分
評分
用戶評價
相關圖書
本站所有內容均為互聯網搜索引擎提供的公開搜索信息，本站不存儲任何數據與內容，任何內容與數據均與本站無關，如有需要請聯繫相關搜索引擎包括但不限於百度，google,bing,sogou 等
© 2025 qciss.net All Rights Reserved. 小哈圖書下載中心 版权所有