|
|
|
|
CONTRIBUTORS:
|
|
|
CONFERENCE TITLE:
|
|
|
CONF. LOCATION:
|
None
|
|
YEAR:
|
2011
|
|
PUB TYPE:
|
Conference Paper
|
|
SUBJECT(S):
|
Cellular Automata
|
|
DISCIPLINE:
|
Computer Science
|
|
HTTP:
|
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-501-189
(Last edited on
2012/03/21 04:26:52 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
Cellular automata are distributed systems which can perform complex computations. It is still difficult to solve major problems using Cellular automata but new perspectives in this area have been opened and this evolutionary technique is now used in many systems considered apt for applying Artificial Intelligence .The paper explores the possibility of using the patterns generated by the 256 rules of CA in cryptography. All the 256 rules of CA have been implemented their patterns studied and random numbers have been formed out of them. It has been observed that the random numbers generated have fairly low coefficient of autocorrelation thus making them suitable for generating key in cryptography
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
2/113
|
|
|
|
|
|
|
| Prev |
Next |
|
