1.
О‘zbekiston Respublikasi Prezidentining farmoni. О‘zbekiston
о‘yicha Harakatlar strategiyasi tо‘g‘risida.
2017 yil.
2. Dinh H. T. et al. A survey of mobile cloud computing:
2013. – T. 13. –
№. 18. – S. 1587-1611.
cloud computing. – Wiley Publishing, 2010.
4. Tsai W. T., Sun X., Balasooriya J. Service-oriented
architecture //2010 seventh international conference on information technology: new
generations. – IEYEE, 2010. – S. 684-689.
Generation compyuter systems. – 2012. – T. 28. –
№. 3. – S. 583-592.
6. Subashini S., Kavitha V. A survey on security
models of cloud computing //Journal of network and compyuter applications. –
2011. – T. 34. –
№. 1. – S. 1-11.
7. Jensen M. et al. On technical security issues in cloud computing //2009
IEYEE International Conference on Cloud Computing. – Ieyee, 2009. – S. 109-116.
8. Feng D. G. et al. Study on cloud computing security //Journal of software.
– 2011. – T. 22. –
№. 1. – S. 71-83.
9. Mell P. et al. The NIST definition of cloud computing. – 2011.
10.
349.
11.
privacy-preserving cloud computing //Hotsec. – 2010. – T. 10. – S. 1-8.
52
Ilova
def gcd(a, b):
while a != 0:
a, b = b % a, a
return b
def findModInverse(a, m):
if gcd(a, m) != 1:
return None
u1, u2, u3 = 1, 0, a
v1, v2, v3 = 0, 1, m
while v3 != 0:
q = u3 // v3 v1, v2, v3, u1, u2, u3 = (u1 - q * v1), (u2 - q * v2), (u3 - q *v3), v1, v2, v3
return u1 % m
import random
def rabinMiller(num):
s = num - 1
t = 0
while s % 2 == 0:
s = s // 2
t += 1
for trials in range(5):
a = random.randrange(2, num - 1)
v = pow(a, s, num)
if v != 1:
i = 0
while v != (num - 1):
if i == t - 1:
return False else:
i = i + 1
v = (v ** 2) % num
return True
def isPrime(num):
if (num < 2):
return False
lowPrimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59,
61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127,
131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191,
193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257,
263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331,
337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401,
409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467,
479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563,
569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631,
641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709,
719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797,
809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877,
881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967,
971, 977, 983, 991, 997]
if num in lowPrimes:
return True
for prime in lowPrimes:
