Skip to main content
. 2021 Aug 9;7:e628. doi: 10.7717/peerj-cs.628
Algorithm-I: Two-Phase Chaos Coefficient-Based Security Key Generation (TPCCSKG) Algorithm
Step - 1. Initialize the first collection of the keys as K[]
Step - 2. Initialize the second collection of the randomness coefficient as R[]
Step - 3. Phase 1: For n instances,
i. Generate the random collection as R[n + 1] = Random(n)
ii. If, R[n + 1] =  = R[n]
iii. Then, stop the random value generation
Step - 4. Phase 2: For t instances,
i. Generate the random key collection as K[t + 1] = R[t].(1 − K[t])
ii. If, K[t + 1] =  = K[t]
iii. Then, stop the random key generation
Step - 5. Generate the public key, Pub_Key = !(Random Instance of K[t+1]) XOR K[t]
Step - 6. Generate the private key, Pri_Key = !(Random Instance of K[t+1] XOR K[t])
Step - 7. Return the Pub_Key & Pri_Key pair