Abstract: We shall review the cellular automaton (CA) -based pseudorandom number generators (PRNGs), and evaluate the randomness of sequences generated by them using the statistical test suite of National Institute of Standards and Technology (NIST). We show that one of CA-based PRNGs has good randomness which is comparable to well-known good PRNGs such as SHA1, AES, and MUGI.
Because of its simple construction, CA is well known to be suitable for hardware implementation. We show that the stream cipher based on this CA is able to work up to the high clock frequency, and has 3Gbps speed (20K gates FPGA) in the real time encryption and decryption experiment.
Seminarsko predavanje bo torek 15. junija 2004 ob 15:15 v seminarski sobi CAMTP, Krekova 2, pritlicje. Vljudno vabljeni vsi zainteresirani, tudi študenti.