free -computer network
free -computer network
free -digital signature
free -digital signature
Asymptotically Efficient Lattice-Based Digital Signatures
We give a direct construction of digital signatures based on the complexity of approximating the shortest vector in ideal (e.g., cyclic) lattices. The construction is provably secure based on the worst-case hardness of approximating the shortest vector in such lattices within a polynomial factor, and it is also asymptotically eļ¬cient: the time complexity of the […]