Sign In

Login

Password

Forgot Password ? Sign Up

Criptografia basada en gelosia (Catalan Wikipedia)

Analysis of information sources in references of the Wikipedia article "Criptografia basada en gelosia" in Catalan language version.

refsWebsite
Global rank Catalan rank
6doi.org
2nd place
6th place
1iacr.org
5,032nd place
low place

doi.org

dx.doi.org

  • Ajtai, Miklós. «Generating Hard Instances of Lattice Problems». A: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (en anglès), 1996, p. 99–108. DOI 10.1145/237814.237838. ISBN 978-0-89791-785-8. 
  • Hoffstein, Jeffrey. «NTRU: A ring-based public key cryptosystem». A: Algorithmic Number Theory (en anglès). 1423, 1998, p. 267–288 (Lecture Notes in Computer Science). DOI 10.1007/bfb0054868. ISBN 978-3-540-64657-0. 
  • Regev, Oded. «On lattices, learning with errors, random linear codes, and cryptography». A: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing – STOC '05 (en anglès). ACM, 2005, p. 84–93. DOI 10.1145/1060590.1060603. ISBN 978-1581139600. 
  • Peikert, Chris. «Public-key cryptosystems from the worst-case shortest vector problem». A: Proceedings of the 41st annual ACM symposium on Symposium on theory of computing – STOC '09 (en anglès). ACM, 2009, p. 333–342. DOI 10.1145/1536414.1536461. ISBN 9781605585062. 
  • Brakerski, Zvika. «Classical hardness of learning with errors». A: Proceedings of the 45th annual ACM symposium on Symposium on theory of computing – STOC '13 (en anglès). ACM, 2013, p. 575–584. DOI 10.1145/2488608.2488680. ISBN 9781450320290. 
  • Lyubashevsky, Vadim. «On Ideal Lattices and Learning with Errors over Rings». A: Advances in Cryptology – EUROCRYPT 2010 (en anglès). 6110, 2010-05-30, p. 1–23 (Lecture Notes in Computer Science). DOI 10.1007/978-3-642-13190-5_1. ISBN 978-3-642-13189-9. 

iacr.org

eprint.iacr.org