1369 search results - page 20 / 274 » Lattice computations for random numbers |
AML
2011
13 years 3 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
JOC
2002
13 years 8 months ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
NIPS
2008
13 years 10 months ago
2008
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
HAPTICS
2007
IEEE
14 years 3 months ago
2007
IEEE
We are developing a novel sensing device named “3-dimensional capture sheet (3DCS)”. The cloth-like sheet measures its own 3D configuration. The sheet enables us to make a sof...