Learn More
In this paper, we report that we have solved the SVP Challenge over a 128-dimensional lattice in Ideal Lattice Challenge from TU Darmstadt, which is currently the highest dimension in the challenge that has ever been solved. The security of lattice-based cryptography is based on the hardness of solving the shortest vector problem (SVP) in lattices. In 2010,(More)
This article shows different security vulnerabilities found in IEEE 802.16e and gives possible solutions to eliminate them. These vulnerabilities are the possibilities to forge key messages in Multi-and Broadcast operation, some unauthenticated messages which are susceptible to forgery and the unencrypted management communication which reveals important(More)
Recent years have seen a dramatic increase in the number and importance in daily life of mobile devices. The security properties that these devices provide to their applications, however, are inadequate to protect against many undesired behaviors. A broad class of such behaviors is violations of simple information-flow properties. This paper proposes an(More)
Recent years have seen a dramatic increase in the number and importance of mobile devices. The security properties that these devices provide to their applications, however, are inadequate to protect against many undesired behaviors. A broad class of such behaviors is violations of simple information-flow properties. This paper proposes an enforcement(More)
In this paper, we report that we have solved the shortest vector problem (SVP) over a 128-dimensional lattice, which is currently the highest dimension of the SVP that has ever been solved. The security of lattice-based cryptography is based on the hardness of solving the SVP in lattices. In 2010 Micciancio et al. proposed a Gauss Sieve algorithm for(More)