Igor E. Shparlinski

International Association for Cryptologic Research

Igor E. Shparlinski Search web for home page

	year	title	booktitle	pages
1	2006	Elliptic Curves with Low Embedding Degree	jofc	553-562
2	2005	Elliptic Curves with Low Embedding Degree	eprint	online
3	2004	A Nonuniform Algorithm for the Hidden Number Problem in Subgroups	pkc	online
4	2004	New Results on the Hardness of Diffie-Hellman Bits	pkc	online
5	2003	On the Bit Security of NTRUEncrypt	pkc	62-70
6	2003	Hidden Number Problem in Small Subgroups	eprint	online
7	2002	Hidden Number Problem with the Trace and Bit Security of XTR and LUC	crypto	online
8	2002	Selective Forgery of RSA Signatures with Fixed-Pattern Padding	pkc	228-236
9	2002	Secure Bilinear Diffie-Hellman Bits	eprint	online
10	2002	The Insecurity of the Digital Signature Algorithm with Partially Known Nonces	jofc	151-176
11	2001	On the Insecurity of a Server-Aided RSA Protocol	asiacrypt	21-35
12	2001	On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme	crypto	201-212
13	2001	On the Security of Lenstra's Variant of DSA without Long Inversions	pkc	64-72
14	2000	An Identification Scheme Based on Sparse Polynomials	pkc	68-74
15	2000	On the Security of Diffie--Hellman Bits	eprint	online
16	2000	On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping	jofc	339-360
17	2000	Security of Polynomial Transformations of the Diffie--Hellman Key	eprint	online
18	2000	Security of the Most Significant Bits of the Shamir Message Passing Scheme	eprint	online