| |
 |
|
|
Science Forum Index » Cryptography Forum » Hidden or Obfuscated Numbers in Coding Method...
Page 1 of 1
|
| Author |
Message |
| Douglas Eagleson... |
 Posted: Fri Jul 25, 2008 7:30 am |
|
|
|
Guest
|
Obfuscated hidden numbers are hard to code. Here is a primary method
of hidden number coding. The output is a column of i,f,j index
numbers. 14 sets of three, from one to three.
All you have to do is place an array inside the for loop set and
initialize.
u[i][f][j]=
An equation is caused to exist. Certain I,F,J array elements are set!
While others are not.
U(1,2,3)= F(14)
Any old Function, F, can be placed there.
F(x)= 1/x 1...14
SO a hidden set is created.
This is the primary method of hidden key technique.
#include <stdio.h>
main(){
unsigned char index1[1];
unsigned char index2[1];
unsigned char index3[1];
int i,f,j;
index1[0]=2;
index2[0]=4;
index3[0]=1;
for(i=index1[0];i<index2[0];i++){
for(f=index1[0];f<index2[0];f++){
for(j=index1[0];j<index2[0];j++){
index1[0]=index3[0];
printf("i=%i\n",i);
printf("f=%i\n",f);
printf("j=%i\n",j);
printf(" \n");
}
}
}
output
i=2
f=2
j=2
i=2
f=2
j=3
i=2
f=3
j=1
i=2
f=3
j=2
i=2
f=3
j=3
i=3
f=1
j=1
i=3
f=1
j=2
i=3
f=1
j=3
i=3
f=2
j=1
i=3
f=2
j=2
i=3
f=2
j=3
i=3
f=3
j=1
i=3
f=3
j=2
i=3
f=3
j=3 |
|
|
| Back to top |
|
| |
|
Page 1 of 1
All times are GMT - 5 Hours
The time now is Fri Dec 05, 2008 4:56 am
|
|