library.bib 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178
  1. %% oldest and most popular article about known attacks on RSA.
  2. @article{20years,
  3. title = {Twenty years of attacks on the RSA cryptosystem},
  4. author = {Boneh, Dan and Rivest, Ron and Shamir, Adi and Adleman, Len and others},
  5. journal = {Notices of the AMS},
  6. volume = 46,
  7. number = 2,
  8. pages = {203--213},
  9. year = 1999
  10. }
  11. %% reccomended limits of p-q
  12. @misc{DSS2009,
  13. title={FIPS PUB 186-3: Digital Signature Standard},
  14. author={NIST},
  15. year=2009
  16. }
  17. %% here there's the descriptions for an efficient computation of fₚ(x) = y . y² ≡ x (mod p)
  18. %% [openssl implements it]
  19. @misc{ieee2001ieee,
  20. title = {IEEE P1363a D10 (Draft Version 10):
  21. Standard Specifications for Public Key Cryptography:
  22. Additional Techniques, IEEE P1363 Working Group, Working draft},
  23. author = {IEEE P1363 Working Group and others},
  24. year = 2001
  25. }
  26. @misc{rfc6176,
  27. title = {Prohibiting Secure Sockets Layer (SSL)
  28. Version 2.0},
  29. author = {S. Turner and T. Polk},
  30. publisher = {RFC Editor},
  31. url = {http://tools.ietf.org/html/rfc6176}
  32. }
  33. @misc{rfc4158,
  34. title = {Certification Path Building},
  35. author = {Cooper et al.},
  36. publisher = {RFC Editor},
  37. url = {http://tools.ietf.org/html/rfc4158}
  38. }
  39. @book{bombelli:algebra,
  40. title = {L'Algebra},
  41. author = {Rafael Bombelli},
  42. year = 1572,
  43. publisher = {Mathematical Association of America},
  44. url = {http://mathematica.sns.it/opere/9/}
  45. }
  46. @book{AOCPv2,
  47. author = {Knuth, Donald E.},
  48. title = {The Art of Computer Programming, Volume 2 (3rd Ed.):
  49. Seminumerical Algorithms},
  50. year = 1997,
  51. isbn = {0-201-89684-2},
  52. publisher = {Addison-Wesley Longman Publishing Co., Inc.},
  53. address = {Boston, MA, USA}
  54. }
  55. @book{MITalg,
  56. author = "T.~H. Cormen and C.~E. Leiserson and R.~L. Rivest and C.~Stein",
  57. edition = "3rd",
  58. publisher = "The MIT Press",
  59. title = "Introduction to Algorithms",
  60. year = 2009,
  61. isbn = "978-0-262-03384-8"
  62. }
  63. @book{Dijkstra:adop,
  64. author = {Dijkstra, Edsger Wybe},
  65. title = {A Discipline of Programming},
  66. year = 1997,
  67. isbn = {013215871X},
  68. edition = {1st},
  69. publisher = {Prentice Hall PTR},
  70. address = {Upper Saddle River, NJ, USA},
  71. }
  72. @book{riesel,
  73. author = {Riesel, Hans},
  74. title = {Prime Numbers and Computer Methods for Factorization},
  75. year = 1985,
  76. isbn = {0-8176-3291-3},
  77. publisher = {Birkhauser Boston Inc.},
  78. address = {Cambridge, MA, USA},
  79. }
  80. @book{Crandall,
  81. author = {Richard Crandall and Carl Pomerance and Richard Crandall and Carl Pomerance},
  82. title = {Prime numbers: a computational perspective. Second Edition},
  83. year = {2005}
  84. }
  85. @article{wiener,
  86. author = {Michael J. Wiener},
  87. title = {Cryptanalysis of short RSA secret exponents},
  88. journal = {IEEE Transactions on Information Theory},
  89. year = 1990,
  90. volume = 36,
  91. pages = {553--558},
  92. url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.5261}
  93. }
  94. @article{pollard1974,
  95. author = {J. M. Pollard},
  96. title = {Theorems on factorization and primality testing},
  97. journal = {Mathematical Proceedings of the Cambridge Philosophical Society},
  98. volume = 76,
  99. issue = 03,
  100. month = 11,
  101. year = 1974,
  102. issn = {1469-8064},
  103. pages = {521--528},
  104. numpages = 8,
  105. doi = {10.1017/S0305004100049252},
  106. url = {http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=2074504}
  107. }
  108. @article{Williams:p+1,
  109. title = {A $p + 1$ Method of Factoring},
  110. author = {Williams, H. C.},
  111. journal = {Mathematics of Computation},
  112. volume = 39,
  113. number = 159,
  114. jstor_formatteddate = {Jul., 1982},
  115. pages = {pp. 225-234},
  116. url = {http://www.jstor.org/stable/2007633},
  117. ISSN = 00255718,
  118. language = {English},
  119. year = 1982,
  120. publisher = {American Mathematical Society},
  121. }
  122. @article{dixon,
  123. title = {Asymptotically Fast Factorization of Integers},
  124. author = {Dixon, John D.},
  125. journal = {Mathematics of Computation},
  126. volume = 36,
  127. number = 153,
  128. pages = {pp. 255-260},
  129. url = {http://www.jstor.org/stable/2007743},
  130. ISSN = 00255718,
  131. year = 1981
  132. }
  133. @article{rsa,
  134. author = {Rivest, R. L. and Shamir, A. and Adleman, L.},
  135. title = {A Method for Obtaining Digital Signatures and Public-key Cryptosystems},
  136. journal = {Commun. ACM},
  137. issue_date = {Feb. 1978},
  138. volume = 21,
  139. number = 2,
  140. month = feb,
  141. year = 1978,
  142. issn = {0001-0782},
  143. pages = {120--126},
  144. numpages = 7,
  145. url = {http://doi.acm.org/10.1145/359340.359342},
  146. doi = {10.1145/359340.359342},
  147. acmid = 359342,
  148. publisher = {ACM},
  149. address = {New York, NY, USA}
  150. }
  151. @unpublished{SSLiverse,
  152. title= {Is the SSLiverse a safe place? An update on EFF's SSL Observatory project},
  153. author = {Jesse, Peter Eckersley},
  154. year = 2010,
  155. note = {[27c3]},
  156. url = {https://www.youtube.com/watch?v=DRjNV4YMvHI}
  157. }