| 書目名稱 | Number Theoretic Methods in Cryptography |
| 副標題 | Complexity lower bou |
| 編輯 | Igor Shparlinski |
| 視頻video | http://file.papertrans.cn/669/668840/668840.mp4 |
| 叢書名稱 | Progress in Computer Science and Applied Logic |
| 圖書封面 |  |
| 描述 | The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de- grees and orders of ? polynomials; ? algebraic functions; ? Boolean functions; ? linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf- ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right- most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de- gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These |
| 出版日期 | Book 1999 |
| 關鍵詞 | complexity; complexity theory; computer science; cryptography; finite field; number theory |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-0348-8664-2 |
| isbn_softcover | 978-3-0348-9723-5 |
| isbn_ebook | 978-3-0348-8664-2Series ISSN 2297-0576 Series E-ISSN 2297-0584 |
| issn_series | 2297-0576 |
| copyright | Springer Basel AG 1999 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-8 00:16
發(fā)表于 2025-3-21 18:27:15
