dc.contributor.author |
Abu Salem, Fatima Khaled |
dc.date.accessioned |
2012-06-13T07:05:03Z |
dc.date.available |
2012-06-13T07:05:03Z |
dc.date.issued |
2001 |
dc.identifier.uri |
http://hdl.handle.net/10938/6145 |
dc.description |
Thesis (M.S.)--Dept. of Mathematics, AUB, 2001.;"Advisor: Kamal Khuri-Makdisi, Assistant Professor, Mathematics--Member of Committee: Wadi' Jureidini, Associate Professor, Mathematics --Member of Committee: Nazih Nahlus, Associate Professor, Mathematics" |
dc.description |
Bibliography : leaves 196-197 |
dc.description.abstract |
Integer factorization plays an essential role in the security of public-key cryptoystem: in particular, the basis of such security depends on our presumed inability to factor large integers beyond a certain range. This fact has triggered many sophisticate |
dc.format.extent |
x, 197 leaves |
dc.language.iso |
eng |
dc.relation.ispartof |
Theses, Dissertations, and Projects |
dc.subject.classification |
T:004183 AUBNO |
dc.subject.lcsh |
Factorization (Mathematics) |
dc.subject.lcsh |
Sieves (Mathematics) |
dc.subject.lcsh |
Algorithms |
dc.subject.lcsh |
Polynomials |
dc.title |
Integer factorization and the quadratic sieve - by Fatima Khaled Abu Salem |
dc.type |
Thesis |
dc.contributor.department |
American University of Beirut. Faculty of Arts and Sciences. Department of Mathematics |