Sciweavers

1279 search results - page 2 / 256
» Fast Implementations of Automata Computations
Sort
View
PKC
1998
Springer
158views Cryptology» more  PKC 1998»
13 years 11 months ago
A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation
One-way hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel one-way hash function based on cellular aut...
Miodrag J. Mihaljevic, Yuliang Zheng, Hideki Imai
DNA
2004
Springer
168views Bioinformatics» more  DNA 2004»
14 years 26 days ago
Biomolecular Implementation of Computing Devices with Unbounded Memory
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
Matteo Cavaliere, Natasa Jonoska, Sivan Yogev, Ron...
FCCM
2005
IEEE
124views VLSI» more  FCCM 2005»
14 years 1 months ago
Parallel Hardware Implementation of Cellular Learning Automata Based Evolutionary Computing (CLA-EC) on FPGA
The CLA-EC is a model obtained by combining the concepts of cellular learning automata and evolutionary algorithms. The parallel structure of the CLA-EC makes it suitable for hard...
Arash Hariri, Reza Rastegar, Morteza Saheb Zamani,...
JCP
2008
87views more  JCP 2008»
13 years 7 months ago
VLSI Architecture of a Cellular Automata based One-Way Function
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
Debdeep Mukhopadhyay, Pallavi Joshi, Dipanwita Roy...