Respected research fellows,
I am working on logistic chaotic map for generating numbers from 0-255 (in non-repetitive manner), so far I am successful in generating numbers but there are so many repetition of values. I need some help please! Following is python snippet I am using to generate these numbers.
def sbox(x, r, size):
i = []
for j in range(size):
x=r*x*(1-x)
i.append(int((x* pow(10,14))%256))
return i
print(sbox(0.9058,3.9,256))
This will eventually go towards Substitution Box creations.
Why don't you use the Knuth-Fisher-Yates shuffle algorithm to randomise an array of your selected numbers. You always get only one of each, in each pass.
Problem is all other algorithms create some sort of pattern which is unacceptable in cryptography. Chaotic maps are preferred due this reason.
All random number generators will create duplicates and patterns. KFY is used by electronic casinos to (among others) to shuffle cards, so no duplicates, and no two passes are the same.
Alright, now let me explain how chaotic system works. A chaotic system generates values between 0-1 (e.g. 0.34343534343) and all these float point values are unique and random. Now the problem (Repetitions) occurs when you convert these values into integers. I have attached an excel file for your reference these are 256 unique randomly generated values without integer conversion. But I will look into KFY. Thank you!
So, I found a simple solution to this problem. We have to increase the iteration while dropping repeated values. This will give us random but unique 256 values.
here is the article which can answer to your question
Article Securing physical layer using new chaotic parametric maps
Karima Amara Korba Thank you ma'am. I already found a solution but I am working on it. I will share it with the research community once I am successful.
- Badges
- Science topic
- Similar topics
- Methodology
- Research Methodology
- Research Papers