rueckert's lattice [17 articles] Export Sort

Recent papers added to rueckert's library classified by the tag lattice. You can also see everyone's lattice.

Hide details

	Breaking Knapsack Cryptosystems by l 1--norm Enumeration [My Copy] by H. Ritter posted to lattice reduction by rueckert on 2008-12-18 13:09:52 as
	Generating Shorter Bases for Hard Random Lattices [My Copy] (12 Dec 2008) by Joel Alwen, Chris Peikert posted to avarage-case lattice svp worst-case by rueckert on 2008-12-18 12:57:36 as
	Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem [My Copy] (13 Nov 2008) by Chris Peikert posted to lattice svp by rueckert on 2008-12-18 12:57:18 as
	Secure Parameters for SWIFFT [My Copy] (25 Nov 2008) by Johannes Buchmann, Richard Lindner posted to hash-function lattice post-quantum by rueckert on 2008-12-02 07:24:34 as
	The $n^c$-Unique Shortest Vector Problem is Hard [My Copy] (30 Nov 2008) by Vadim Lyubashevsky posted to lattice reduction svp by rueckert on 2008-12-02 06:54:00 as
	SWIFFTX - The ECRYPT Hash Function Website [My Copy] by Yuriy Arbitman, Gil Dogon, Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen posted to hash-function lattice by rueckert on 2008-11-20 06:51:02 as
	The optimal LLL algorithm is still polynomial in fixed dimension [My Copy] Theoretical Computer Science, Vol. 297, No. 1-3. (17 March 2003), pp. 3-23. by A. Akhavi posted to lattice by rueckert on 2008-11-17 06:51:41 as
	On Lovász’ lattice reduction and the nearest lattice point problem [My Copy] Combinatorica, Vol. 6, No. 1. (1 March 1986), pp. 1-13. by L. Babai posted to cvp lattice by rueckert on 2008-10-14 12:22:38 as
	Lattice-Based Identification Schemes Secure Under Active Attacks [My Copy] Public Key Cryptography – PKC 2008 (2008), pp. 162-179. by Vadim Lyubashevsky posted to lattice post-quantum proofs by rueckert on 2008-09-30 14:14:03 as
	Unique Shortest Vector Problem for max norm is NP-hard [My Copy] (25 Aug 2008) by Than Q. Khoat, Nguyen H. Tan posted to lattice post-quantum svp by rueckert on 2008-09-30 14:02:35 as
	Efficient Quantum-immune Blind Signatures [My Copy] (25 Jul 2008) by Markus Rückert posted to blind lattice post-quantum signature trapdoor by rueckert on 2008-08-05 06:53:34 as
	Explicit hard instances of the shortest vector problem [My Copy] (1 Aug 2008) by Johannes Buchmann, Richard Lindner, Markus Rückert posted to avarage-case lattice quantum worst-case by rueckert on 2008-08-05 06:52:46 as
	Trapdoors for hard lattices and new cryptographic constructions [My Copy] In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing (2008), pp. 197-206. by Craig Gentry, Chris Peikert, Vinod Vaikuntanathan posted to avarage-case cryptosystem cvp lattice trapdoor by rueckert on 2008-07-22 12:23:03 as
	Finding the closest lattice vector when it's unusually close [My Copy] In SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (2000), pp. 937-941. by Philip Klein posted to cvp lattice by rueckert on 2008-07-18 07:25:42 as
	Generating hard instances of lattice problems (extended abstract) [My Copy] In STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (1996), pp. 99-108. by M. Ajtai posted to avarage-case lattice reduction svp worst-case by rueckert on 2008-07-08 10:12:23 as along with 1 person kklo
	Generating Hard Instances of the Short Basis Problem [My Copy] Automata, Languages and Programming (1999), pp. 706-706. by Miklós Ajtai posted to avarage-case lattice reduction svp worst-case by rueckert on 2008-07-08 10:09:09 as
	On lattices, learning with errors, random linear codes, and cryptography [My Copy] In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005), pp. 84-93. by Oded Regev posted to cryptosystem cvp encryption lattice post-quantum quantum svp by rueckert on 2008-02-05 10:06:17 as

Note: You may cite this page as: http://www.citeulike.org/user/rueckert/tag/lattice

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

Sort by:
Order:	Default Ascending Descending
Empty fields:	Default First Last

lattice	17
blind	9
svp	8
signature	8
avarage-case	6
reduction	5
post-quantum	5
worst-case	5
hash-function	4
cvp	4
witness-indistinguishable	2
cryptosystem	2
zap	2
bilinear-maps	2
proofs	2
trapdoor	2
quantum	2
pairing	2
ves	1
hibe	1
generic-group-model	1
encryption	1
whitness-indistinguishable	1
rom	1
rom-free	1
zero-knowledge	1

rueckert's lattice [17 articles] Export Sort

rueckert's tags