Probabilistic, lightweight cryptosystems based on finite automata
Most of the cryptosystems currently used are based on number theoretic problems. We focus on cryptosystems based on finite automata (FA) which are lightweight in nature and have relatively small key sizes. The security of these systems relies on the difficulties in inverting non-linear finite automa...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/3410 |