Showing items 1 - 15 of 119.

Add to Quick Collection All 119 Results

First
Previous
1
2
3
4
5
6
7
8
Next
Last

Title	Author/Creator	Date	Full Text
An Authentication scheme based on roots of sparse polynomials	von zur Gathen, Joachim; Shokrollahi, Amin; Shparlinski, Igor	2003
Cryptographic applications of analytic number theory : complexity lower bounds and pseudorandomness	Shparlinski, Igor	2003	—
An Equivalent expression of Rijndael algorithm	Pieprzyk, Josef; Zhang, Xian-Mo	2003	—
Finding points on curves over finite fields	von Zur Gathen, Joachim; Shparlinski, Igor; Sinclair, Alistair	2003
The Insecurity of the elliptic curve digital signature algorithm with partially known nonces	Nguyen, Phong Q; Shparlinski, Igor E	2003	—
Linear complexity of the discrete logarithm	Konyagin, Sergei; Lange, Tanja; Shparlinski, Igor	2003	—
Characterisations of ideal threshold schemes	Pieprzyk, Josef; Zhang, Xian-Mo	2004
Malleability attacks on multi-party key agreement protocols	Pieprzyk, Josef; Wang, Huaxiong	2004	—
Multiple-time signature schemes against adaptive chosen message attacks	Pieprzyk, Josef; Wang, Huaxiong; Xing, Chaoping	2004	—
Number theoretic designs for directed regular graphs of small diameter	Banks, William D; Conflitti, Alessandro; Shparlinski, Igor E	2004
On cheating immune secret sharing	Pieprzyk, Josef; Zhang, Xian-Mo	2004
On decimations of ℓ-sequences	Goresky, Mark; Klapper, Andrew; Murty, Ram; Shparlinski, Igor E	2004	—
On the multidimentional distribution of the subset sum generator of pseudorandom numbers	Conflitti, Alessandro; Shparlinski, Igor E	2004
On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA	Shparlinski, Igor E	2004	—
Securing multicast groups in ad hoc networks	Kurnio, Hartono; Wang, Huaxiong; Pieprzyk, Josef; Gaj, Kris	2004	—