Research Article
Novel Stream Ciphering Algorithm for Big Data Images Using Zeckendorf Representation
Algorithm 1
Pseudorandom keystream generation algorithm.
| Require: A pair of key, ; message length, ; | | Ensure: Keystream, ; | | 1: //initialize; | | 2: ; | | 3: ; | | 4: for to do | | 5: | | 6: Generate integral sequences | | 7: | | 8: ; | | 9: ; | | 10: | | 11: Convert into Zeckendorf representations | | 12: | | 13: ; | | 14: ; | | 15: | | 16: Intercept midsection | | 17: | | 18: fordo | | 19: //Count the number of 1 in sequence; | | 20: Count; | | 21: //Determine the middle-section; | | 22: ; | | 23: ; | | 24: //Intercept; | | 25: ; | | 26: end for | | 27: | | 28: Bitwise OR | | 29: | | 30: OR | | 31: | | 32: Take random piece (of length ) | | 33: | | 34: ; | | 35: ; | | 36: | | 37: end for | | 38: Return; |
|