Author:
Giesbrecht Mark,Roche Daniel S.,Tilak Hrushikesh
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lecture Notes in Computer Science;L.M. Adleman,1994
2. El Aimani, L., von zur Gathen, J.: Finding low weight polynomial multiples using lattices. Cryptology ePrint Archive, Report 2007/423 (2007), http://eprint.iacr.org/2007/423.pdf
3. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Symp. Theory of Computing (STOC 2001), pp. 601–610 (2001)
4. Aumasson, J.-P., Finiasz, M., Meier, W., Vaudenay, S.: TCHo: a hardware-oriented trapdoor cipher. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 184–199. Springer, Heidelberg (2007)
5. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24(3) (1978)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献