Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/3339
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorKoltuksuz, Ahmet Hasanen
dc.contributor.authorÇağrıcı, Gökhan-
dc.date.accessioned2014-07-22T13:51:21Z-
dc.date.available2014-07-22T13:51:21Z-
dc.date.issued2005en
dc.identifier.urihttp://hdl.handle.net/11147/3339-
dc.descriptionThesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2005en
dc.descriptionIncludes bibliographical references (leaves: 68)en
dc.descriptionText in English Abstract: Turkish and Englishen
dc.descriptionix, 74 leavesen
dc.description.abstractAs the size of the communication through networks and especially through Internet grew, there became a huge need for securing these connections. The symmetric and asymmetric cryptosystems formed a good complementary approach for providing this security. While the asymmetric cryptosystems were a perfect solution for the distribution of the keys used by the communicating parties, they were very slow for the actual encryption and decryption of the data flowing between them. Therefore, the symmetric cryptosystems perfectly filled this space and were used for the encryption and decryption process once the session keys had been exchanged securely. Parallelism is a hot research topic area in many different fields and being used to deal with problems whose solutions take a considerable amount of time. Cryptography is no exception and, computer scientists have discovered that parallelism could certainly be used for making the algorithms for asymmetric cryptosystems go faster and the experimental results have shown a good promise so far. This thesis is based on the parallelization of a famous public-key algorithm, namely RSA.en
dc.language.isoenen_US
dc.publisherIzmir Institute of Technologyen
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subject.lccTK5105.59 .C13 2005en
dc.subject.lcshComputer networks--Security measuresen
dc.subject.lcshPublic key cryptographyen
dc.subject.lcshParallel algorithmsen
dc.titleAn analysis of key generation efficiency of RSA cryptosystem in distributed environmentsen_US
dc.typeMaster Thesisen_US
dc.institutionauthorÇağrıcı, Gökhan-
dc.departmentThesis (Master)--İzmir Institute of Technology, Computer Engineeringen_US
dc.relation.publicationcategoryTezen_US
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.openairetypeMaster Thesis-
item.languageiso639-1en-
item.fulltextWith Fulltext-
Appears in Collections:Master Degree / Yüksek Lisans Tezleri
Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection
Files in This Item:
File Description SizeFormat 
T000406.pdfMasterThesis505.31 kBAdobe PDFThumbnail
View/Open
Show simple item record



CORE Recommender

Page view(s)

92
checked on Apr 15, 2024

Download(s)

26
checked on Apr 15, 2024

Google ScholarTM

Check





Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.