An apparatus and method based on dynamic window scalar multiplication in elliptical curve cryptography for securing communication between cloud and cloud user

摘要

#$%^&*AU2018101647A420181206.pdf#####Title: An apparatus and method based on dynamic window scalar multiplication in elliptical curve cryptography for securing communication between cloud and cloud user Abstract Elliptic curve cryptosystem (ECC) becomes very popular algorithm for cloud security, which, was proposed by Koblitz and Miller, relies on the difficulty of elliptic curve discrete logarithmic problem (ECDLP). It has been gaining wide acceptance as an alternative to the conventional public key cryptosystem such as RSA , DSA , DH . It is the fact that the cloud technology based on the rapid progress of wireless communications and becoming important part in our daily life. Therefore, the security of the cloud becomes one of the major concerns in its applications. Even though ECC prominently offers great potential benefits for cloud security there is still a lot of work needs to be done due to cloud has very restraint running conditions such as bandwidth, energy source, capability of computing, etc. As we knew that scalar multiplication operation in ECC takes for about 80% of key calculation time on wireless sensor network motes. Hence, it is our target to improve scalar multiplication in ECC. In this patent we present an elastic window based on our previous research works and the whole quality of service (QoS) of cloud has been improved, with fuzzy control tools, under our algorithm in particularly the power consuming is more efficiently due to significantly time decreasing. The simulation results showed that the average calculation time, due to fuzzy conditions decreased from previous 26 to current 9 as a whole the calculation time, decreased by approximately 18.9% in comparison to our previous algorithms in an cloud security.Am -- -------- Bob Pnivae Key K Private Key K, = K * P CompterSecrt - ---- CompderSecret R = kic* Q, R = kA* Q, Figure 3: Diffie-Hellman protocol based on ECC Algorithm 1: Left to right binary method for point multiplication Input: A point P e E (Fq), an 1-1 k = ZK2, K {0,1} I bits integer j=0 Output: Q = kP 1. Q +- oo 2. Forj=l-lto0do: 2.1 Q-2Q, 2.2 if kj=1 the Q-Q+P. 3. Return Q. Algorithm 2: Conversion from Binary to NAF 1-1 k = ZK 2, K E {0,11 Input: An integer j=O k=ZSj2J, Sje {1,0,-l} Output: j=0 1. Co- 0 2. Forj = O to l do: 3. C1+i- [(Kj+Kj1+C/2] 4. S1 - Kj + Cj - 2C,+1 5. Return (Si ... So)