Titlebook: Cryptographic Applications of Analytic Number Theory; Complexity Lower Bou Igor Shparlinski Book 2003 Springer Basel AG 2003 Cryptography.D

ungainly

anus928

勉强

Sridhar P. Arjunan,Arockia Vijay Josephol, is based on the still unproved assumption that recovering the value of the Diffie-Hellman secret key . from the known values of g.and g.is essentially equivalent to the discrete logarithm problem and therefore is hard. Here we show that even computation of . from g.cannot be realized by a polynomial of low degree.

竞选运动

Progress in Computer Science and Applied Logichttp://image.papertrans.cn/d/image/240535.jpg

竞选运动

https://doi.org/10.1007/978-3-0348-8037-4Cryptography; Digital Signature Algorithm; Nonce; Sage; complexity; complexity theory; computer science; fi

收集

notice

Mohammad Ebrahim Banihabib,Bahman Vazirims, signature schemes, pseudorandom number generators and other related constructions. In many cases this has led to new and unexpected points of view on some number theoretic problems. Thus we believe that our approach can enrich and crossfertilise both areas.

condemn

micronutrients

2297-0576 It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num­ bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such

Corral

Ye Chao,Zhang Yi,Yu Bin,Xing Bintion of computing powers in parallel shows in some cases (over finite fields of small characteristic), the Boolean model of computation is exponentially more powerful than the arithmetic model [200, 201].