Sökning: "Encryption speed"
Visar resultat 1 - 5 av 25 uppsatser innehållade orden Encryption speed.
1. Privacy-Preserving Alternating Direction Method of Multipliers
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : As machine learning models affect our lives more strongly every day, developingmethods to train these models becomes paramount. In our paper, we focus on the problem ofminimizing a sum of functions, which lies at the heart of most - if not all - of these trainingmethods. LÄS MER
2. Homomorphic Encryption for Audio Conferencing
Master-uppsats, Linköpings universitet/Institutionen för datavetenskapSammanfattning : Homomorphic encryption (HE) enables computations on encrypted data making it possible to perform calculations on a server without sharing the secret key for decryption. HE is relatively new and has seen significant improvements in recent years in terms of speed of encryption, decryption, operations, and the number of operations possible to perform in a row without damaging the ciphertext. LÄS MER
3. AES - kryptering med cuda : Skillnader i beräkningshastighet mellan AES-krypteringsmetoderna ECB och CTR vid implementering med Cuda-ramverket.
Kandidat-uppsats, Jönköping University/JTH, Datateknik och informatikSammanfattning : Purpose – The purpose of this study is partly to illustrate how the AES encryption methods ECB and CTR affect the computational speed when using the GPGPU framework Cuda, but also to clarify the advantages and disadvantages between the different AES encryption modes. Method – A preliminary study was conducted to obtain empirical data on the AES encryption modes ECB and CTR. LÄS MER
4. Generation of random numbers from the text found in tweets
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Random numbers are integral to many areas of computer science, it is used in everything from video games to encryption of important messages and simulations. These numbers are often generated by mathematical algorithms and it is highly important for these generators to generate numbers that are truly random and unpredictable, as patterns, cycles or other discrepancies might at worst cause serious security flaws that can be exploited. LÄS MER
5. Integer factorization algorithms
Kandidat-uppsats, Umeå universitet/Institutionen för matematik och matematisk statistikSammanfattning : The mathematical area of integer factorization has gone a long way since the early days of Pierre de Fermat, and with simpler algorithms developed in the last century such as the Trial division and Pollards rho algorithm to the more complex method of the Quadratic sieve algorithm (QS), we have now arrived at the General Number Field Sieve (GNFS) which has been recognized as the fastest integer factorization algorithm for very large numbers. Today the research of integer factorization has many applications, among others in the security systems of encryption methods like the famous RSA algorithm. LÄS MER
