Cryptographic Schemes Whose Security Can Be Based on the Apparent Intractability of Lattice Problems
1 faculty research Cryptographic Schemes Whose Security Can Be Based on the Apparent Intractability of Lattice Problems on GradNova.
C
Arthur W. Burks Collegiate Professor of Computer Science and Engineering Professor, EECS – Computer Science and Engineering CSE Associate Chair for Graduate Affairs