Author/Authors
yerlikaya, tarık trakya üniversitesi - bilgisayar mühendisliği bölümü, Edirne, TURKEY , kara, onur trakya üniversitesi - bilgisayar mühendisliği bölümü, Edirne, TURKEY
Title Of Article
KRİPTOLOJİDE KULLANILAN ASAL SAYI TEST ALGORİTMALARI
شماره ركورد
44005
Abstract
Cryptography has gained much more importance today. Asymmetric cryptography as a method is more favored as it is more difficult to break. Asymmetric cryptography is based on prime numbers. The mystery of the prime numbers keeps drawing attention on the subject. In order to make a strong encrypting it is important to find prime numbers that are big enough for encrypting. While it is quite easy to determine whether a small number is prime, it takes a long time to determine whether a large number is prime. For this reason, primality tests are utilized as they help us determine whether a very big number is prime.
From Page
85
NaturalLanguageKeyword
Cryptology , Prime numbers , Primality test
JournalTitle
Trakya university journal of engineering sciences
To Page
94
JournalTitle
Trakya university journal of engineering sciences
Link To Document