J. Stern, "Lattices and cryptography: An overview," in Public Key Cryptography, H. Imai and Y. Zheng, Eds. Yokohama, Japan, Feb. 1998, pp. 50--54.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....problem has been used in assessing the quality of noncryptographic random number generators [50, pp. 89 113] and in decoding of Chinese remainder codes [38] 40] It also has important applications in cryptography [5] 7] Another related problem of paramount importance in cryptography [13] [70] is that of lattice basis reduction. These search problems will be discussed in Section VI. The choice of method for solving the closest point problem depends on the structure of the lattice. Intuitively, the more structure a lattice has, the faster can the closest point be found. For many ....

J. Stern, "Lattices and cryptography: An overview," in Public Key Cryptography, H. Imai and Y. Zheng, Eds. Yokohama, Japan, Feb. 1998, pp. 50--54.

....related shortest vector problem has been used in assessing the quality of random number generators [30, pp. 89 113] and in the decoding of Chinese remainder codes [23] It also has important applications in cryptography [4,6] Another related problem of paramount importance in cryptography [11, 43] is that of lattice basis reduction. These search problems will be discussed in Section VI. The choice of method for solving the closest point problem depends on the structure of the lattice. Intuitively, the more structure a lattice has, the faster can the closest point be found. For many ....

J. Stern, "Lattices and cryptography: An overview," in Public Key Cryptography (H. Imai and Y. Zheng, eds.), pp. 50--54, Pacifico Yokohama, Japan, Feb. 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC