Search results for "Hidden number problem"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Adi Akavia	Solving Hidden Number Problem with One Bit Oracle and Advice.	CRYPTO	2009	DBLP DOI BibTeX RDF
2	Martin Hlavác	Known-Plaintext-Only Attack on RSA-CRT with Montgomery Multiplication.	CHES	2009	DBLP DOI BibTeX RDF	Montgomery exponentiation, electronic passport, RSA, side channel attack, Chinese Remainder Theorem, Hidden Number Problem
2	Martin Hlavác, Tomás Rosa	Extended Hidden Number Problem and Its Cryptanalytic Applications.	Selected Areas in Cryptography	2006	DBLP DOI BibTeX RDF	DSA implementation, hyper-threading, lattice, sliding window, side channel analysis, cache analysis
2	Igor Shparlinski, Arne Winterhof	Noisy interpolation of sparse polynomials in finite fields.	Appl. Algebra Eng. Commun. Comput.	2005	DBLP DOI BibTeX RDF	Noisy interpolation, Finite fields, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem
2	Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski	The Hidden Number Problem in Extension Fields and Its Applications.	LATIN	2002	DBLP DOI BibTeX RDF
2	Wen-Ching W. Li, Mats Näslund, Igor Shparlinski	Hidden Number Problem with the Trace and Bit Security of XTR and LUC.	CRYPTO	2002	DBLP DOI BibTeX RDF
2	Igor Shparlinski	On the Generalised Hidden Number Problem and Bit Security of XTR.	AAECC	2001	DBLP DOI BibTeX RDF
2	Edwin El Mahassni, Phong Q. Nguyen, Igor Shparlinski	The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces.	CaLC	2001	DBLP DOI BibTeX RDF	Exponential Sums, DSA, Hidden Number Problem, Closest Vector Problem
1	San Ling, Igor Shparlinski, Ron Steinfeld, Huaxiong Wang	On the modular inversion hidden number problem.	J. Symb. Comput.	2012	DBLP DOI BibTeX RDF
1	Dong Su, Kewei Lv	Security Analysis of Poker-Resembled Protocol Based on Hidden Number Problem.	CSO	2009	DBLP DOI BibTeX RDF
1	Álvar Ibeas, Arne Winterhof	Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields.	AAECC	2009	DBLP DOI BibTeX RDF	Noisy interpolation, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem
1	David Jao, Dimitar Jetchev, Ramarathnam Venkatesan	On the Bits of Elliptic Curve Diffie-Hellman Keys.	INDOCRYPT	2007	DBLP DOI BibTeX RDF
1	Hans-Ulrich Simon	Spectral Norm in Learning Theory: Some Selected Topics.	ALT	2006	DBLP DOI BibTeX RDF
1	Hans-Ulrich Simon	Spectral Norm in Learning Theory: Some Selected Topics.	Discovery Science	2006	DBLP DOI BibTeX RDF
1	Igor Shparlinski, Arne Winterhof	A hidden number problem in small subgroups.	Math. Comput.	2005	DBLP DOI BibTeX RDF
1	Igor Shparlinski, Arne Winterhof	A Nonuniform Algorithm for the Hidden Number Problem in Subgroups.	Public Key Cryptography	2004	DBLP DOI BibTeX RDF
1	Johan Håstad, Mats Näslund	The security of all RSA and discrete log bits.	J. ACM	2004	DBLP DOI BibTeX RDF	RSA-encryption, bit-security, complexity, Cryptography, discrete logarithms
1	Igor Shparlinski, Arne Winterhof	Hidden Number Problem in Small Subgroups.	IACR Cryptology ePrint Archive	2003	DBLP BibTeX RDF
1	Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski	Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation.	Math. Comput.	2003	DBLP DOI BibTeX RDF
1	Peter J. Leadbitter, Nigel P. Smart	Analysis of the Insecurity of ECMQV with Partially Known Nonces.	ISC	2003	DBLP DOI BibTeX RDF
1	Bruno Codenotti, Igor Shparlinski, Arne Winterhof	On the hardness of approximating the permanent of structured matrices.	Computational Complexity	2002	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 11T23, 15A15, 68Q17
1	Phong Q. Nguyen, Igor Shparlinski	The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.	J. Cryptology	2002	DBLP DOI BibTeX RDF
1	Dan Boneh, Shai Halevi, Nick Howgrave-Graham	The Modular Inversion Hidden Number Problem.	ASIACRYPT	2001	DBLP DOI BibTeX RDF	Coppersmith's attack, Approximations, MAC, Lattices, PRNG, Modular inversion, Hidden number problems
1	Igor Shparlinski	Sparse polynomial approximation in finite fields.	STOC	2001	DBLP DOI BibTeX RDF	finite fields, exponential sums, sparse polynomials
1	Eike Kiltz	A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits.	FCT	2001	DBLP DOI BibTeX RDF
1	Dan Boneh, Ramarathnam Venkatesan	Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes.	CRYPTO	1996	DBLP DOI BibTeX RDF