We present a novel hardware Central Processing Unit (CPU) design methodology based on a 5-step ap... more We present a novel hardware Central Processing Unit (CPU) design methodology based on a 5-step approach. The method starts with a definition of the target CPU internal components and data and address size. The method is applicable to a higher level of abstraction and complexity. However, for ease of illustration a basic CPU with a minimum size instruction set is selected. The instruction set complies with the instruction set completeness criteria. The instruction format is likewise chosen to be simple and illustrates the way our methodology is implemented. The CPU is implemented on an Altera FPGA/CPLD Flex10K device using schematic approach with the Altera MAX+Plus II software CAD. The design was simulated and tested using Altera UP2 board.
We present an educational and research platform for analysis and design of cellular automata (CA)... more We present an educational and research platform for analysis and design of cellular automata (CA). The platform is intended as an aid to newcomers and interested scholars to this field to demystify the complexity associated with understanding the structure, behavior, dynamics and evolution of such systems. It is also an inspirational tool and engine for education that can uncover the immense power and the wide scope of applications that CA can encompass. The platform is designed to be extremely user friendly and flexible. It is believed to be unique in that it allows experimentation in a configurable mode for the CA rule space and lattice span design. Finite and bi-infinite lattice structures are allowed besides the classical periodic (cyclic) boundary conditions. Boundary conditions are comprehensively covered whereby the peripheral cells can be varied in a neighborhood adjacency mode that allows for a variety of time evolution and sampling. The problem of finite lattice is treated by the application of different rules at the boundaries. The entire rule space is utilized for the elementary cellular automata. The classification of the rule space can be studied in detail. Uniform and non-uniform (hybrid) rules can be implemented by simple pull down menus or switchable radio buttons. When the study is directed towards simulation or cryptology, the complexity and random behavior of the cellular automata is tested using "Diehard", the most stringent battery of tests. The results are automatically reported and a fail/pass criterion is established.
We present a new design for random number generation. The outputs of linear feedback shift regist... more We present a new design for random number generation. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA). The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design is good candidate for parallel random number generation, has strong correlation immunity and it is inherently amenable for VLSI implementation.
We present a novel hardware Central Processing Unit (CPU) design methodology based on a 5-step ap... more We present a novel hardware Central Processing Unit (CPU) design methodology based on a 5-step approach. The method starts with a definition of the target CPU internal components and data and address size. The method is applicable to a higher level of abstraction and complexity. However, for ease of illustration a basic CPU with a minimum size instruction set is selected. The instruction set complies with the instruction set completeness criteria. The instruction format is likewise chosen to be simple and illustrates the way our methodology is implemented. The CPU is implemented on an Altera FPGA/CPLD Flex10K device using schematic approach with the Altera MAX+Plus II software CAD. The design was simulated and tested using Altera UP2 board.
International Journal of Computer Science and Information Technology, 2013
We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fi... more We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.
International Journal of Security, Privacy and Trust Management, 2013
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cyl... more We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters of the chaotic rule space are actually capable of producing viable PRNs. Furthermore, these two sub-clusters consist of two majorly non-linear rules. Each sub-cluster of rules is derived from a cluster leader rule by reflection or negation or the combined two transformations. It is shown that the members of each subcluster share the same dynamical behavior. Results of testing the ECA running under these rules for comprehensively large number of lattice lengths using the Diehard Test suite have shown that apart from some anomaly, the whole output sequence can be potentially utilized for cryptographic strength pseudo random sequence generation with sufficiently large number of p-values pass rates.
We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fi... more We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.
We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fi... more We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cyl... more We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters of the chaotic rule space are actually capable of producing viable PRNs. Furthermore, these two sub-clusters consist of two majorly non-linear rules. Each sub-cluster of rules is derived from a cluster leader rule by reflection or negation or the combined two transformations. It is shown that the members of each subcluster share the same dynamical behavior. Results of testing the ECA running under these rules for comprehensively large number of lattice lengths using the Diehard Test suite have shown that apart from some anomaly, the whole output sequence can be potentially utilized for cryptographic strength pseudo random sequence generation with sufficiently large number of p-values pass rates.
Abstract-We present an educational and research platform for analysis and design of cellular auto... more Abstract-We present an educational and research platform for analysis and design of cellular automata (CA). The platform is intended as an aid to newcomers and interested scholars to this field to demystify the complexity associated with understanding the structure, behavior, dynamics and evolution of such systems. It is also an inspirational tool and engine for education that can uncover the immense power and the wide scope of applications that CA can encompass. The platform is designed to be extremely user friendly and flexible. It is believed to be unique in that it allows experimentation in a configurable mode for the CA rule space and lattice span design. Finite and bi-infinite lattice structures are allowed besides the classical periodic (cyclic) boundary conditions. Boundary conditions are comprehensively covered whereby the peripheral cells can be varied in a neighborhood adjacency mode that allows for a variety of time evolution and sampling. The problem of finite lattice is treated by the application of different rules at the boundaries. The entire rule space is utilized for the elementary cellular automata. The classification of the rule space can be studied in detail. Uniform and non-uniform (hybrid) rules can be implemented by simple pull down menus or switchable radio buttons. When the study is directed towards simulation or cryptology, the complexity and random behavior of the cellular automata is tested using "Diehard", the most stringent battery of tests. The results are automatically reported and a fail/pass criterion is established.
Elementary Cellular Automata (ECA). The results show superior randomness features and the output ... more Elementary Cellular Automata (ECA). The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design is good candidate for parallel random number generation, has strong correlation immunity and it is inherently amenable for VLSI implementation.
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cyl... more We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters of the chaotic rule space are actually capable of producing viable PRNs. Furthermore, these two sub-clusters consist of two majorly non-linear rules. Each sub-cluster of rules is derived from a cluster leader rule by reflection or negation or the combined two transformations. It is shown that the members of each subcluster share the same dynamical behavior. Results of testing the ECA running under these rules for comprehensively large number of lattice lengths using the Diehard Test suite have shown that apart from some anomaly, the whole output sequence can be potentially utilized for cryptographic strength pseudo random sequence generation with sufficiently large number of p-values pass rates.
the Diehard statistical battery of tests. The design has strong correlation immunity and it is in... more the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.
We present a novel hardware Central Processing Unit (CPU) design methodology based on a 5-step ap... more We present a novel hardware Central Processing Unit (CPU) design methodology based on a 5-step approach. The method starts with a definition of the target CPU internal components and data and address size. The method is applicable to a higher level of abstraction and complexity. However, for ease of illustration a basic CPU with a minimum size instruction set is selected. The instruction set complies with the instruction set completeness criteria. The instruction format is likewise chosen to be simple and illustrates the way our methodology is implemented. The CPU is implemented on an Altera FPGA/CPLD Flex10K device using schematic approach with the Altera MAX+Plus II software CAD. The design was simulated and tested using Altera UP2 board.
We present an educational and research platform for analysis and design of cellular automata (CA)... more We present an educational and research platform for analysis and design of cellular automata (CA). The platform is intended as an aid to newcomers and interested scholars to this field to demystify the complexity associated with understanding the structure, behavior, dynamics and evolution of such systems. It is also an inspirational tool and engine for education that can uncover the immense power and the wide scope of applications that CA can encompass. The platform is designed to be extremely user friendly and flexible. It is believed to be unique in that it allows experimentation in a configurable mode for the CA rule space and lattice span design. Finite and bi-infinite lattice structures are allowed besides the classical periodic (cyclic) boundary conditions. Boundary conditions are comprehensively covered whereby the peripheral cells can be varied in a neighborhood adjacency mode that allows for a variety of time evolution and sampling. The problem of finite lattice is treated by the application of different rules at the boundaries. The entire rule space is utilized for the elementary cellular automata. The classification of the rule space can be studied in detail. Uniform and non-uniform (hybrid) rules can be implemented by simple pull down menus or switchable radio buttons. When the study is directed towards simulation or cryptology, the complexity and random behavior of the cellular automata is tested using "Diehard", the most stringent battery of tests. The results are automatically reported and a fail/pass criterion is established.
We present a new design for random number generation. The outputs of linear feedback shift regist... more We present a new design for random number generation. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA). The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design is good candidate for parallel random number generation, has strong correlation immunity and it is inherently amenable for VLSI implementation.
We present a novel hardware Central Processing Unit (CPU) design methodology based on a 5-step ap... more We present a novel hardware Central Processing Unit (CPU) design methodology based on a 5-step approach. The method starts with a definition of the target CPU internal components and data and address size. The method is applicable to a higher level of abstraction and complexity. However, for ease of illustration a basic CPU with a minimum size instruction set is selected. The instruction set complies with the instruction set completeness criteria. The instruction format is likewise chosen to be simple and illustrates the way our methodology is implemented. The CPU is implemented on an Altera FPGA/CPLD Flex10K device using schematic approach with the Altera MAX+Plus II software CAD. The design was simulated and tested using Altera UP2 board.
International Journal of Computer Science and Information Technology, 2013
We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fi... more We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.
International Journal of Security, Privacy and Trust Management, 2013
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cyl... more We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters of the chaotic rule space are actually capable of producing viable PRNs. Furthermore, these two sub-clusters consist of two majorly non-linear rules. Each sub-cluster of rules is derived from a cluster leader rule by reflection or negation or the combined two transformations. It is shown that the members of each subcluster share the same dynamical behavior. Results of testing the ECA running under these rules for comprehensively large number of lattice lengths using the Diehard Test suite have shown that apart from some anomaly, the whole output sequence can be potentially utilized for cryptographic strength pseudo random sequence generation with sufficiently large number of p-values pass rates.
We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fi... more We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.
We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fi... more We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cyl... more We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters of the chaotic rule space are actually capable of producing viable PRNs. Furthermore, these two sub-clusters consist of two majorly non-linear rules. Each sub-cluster of rules is derived from a cluster leader rule by reflection or negation or the combined two transformations. It is shown that the members of each subcluster share the same dynamical behavior. Results of testing the ECA running under these rules for comprehensively large number of lattice lengths using the Diehard Test suite have shown that apart from some anomaly, the whole output sequence can be potentially utilized for cryptographic strength pseudo random sequence generation with sufficiently large number of p-values pass rates.
Abstract-We present an educational and research platform for analysis and design of cellular auto... more Abstract-We present an educational and research platform for analysis and design of cellular automata (CA). The platform is intended as an aid to newcomers and interested scholars to this field to demystify the complexity associated with understanding the structure, behavior, dynamics and evolution of such systems. It is also an inspirational tool and engine for education that can uncover the immense power and the wide scope of applications that CA can encompass. The platform is designed to be extremely user friendly and flexible. It is believed to be unique in that it allows experimentation in a configurable mode for the CA rule space and lattice span design. Finite and bi-infinite lattice structures are allowed besides the classical periodic (cyclic) boundary conditions. Boundary conditions are comprehensively covered whereby the peripheral cells can be varied in a neighborhood adjacency mode that allows for a variety of time evolution and sampling. The problem of finite lattice is treated by the application of different rules at the boundaries. The entire rule space is utilized for the elementary cellular automata. The classification of the rule space can be studied in detail. Uniform and non-uniform (hybrid) rules can be implemented by simple pull down menus or switchable radio buttons. When the study is directed towards simulation or cryptology, the complexity and random behavior of the cellular automata is tested using "Diehard", the most stringent battery of tests. The results are automatically reported and a fail/pass criterion is established.
Elementary Cellular Automata (ECA). The results show superior randomness features and the output ... more Elementary Cellular Automata (ECA). The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design is good candidate for parallel random number generation, has strong correlation immunity and it is inherently amenable for VLSI implementation.
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cyl... more We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters of the chaotic rule space are actually capable of producing viable PRNs. Furthermore, these two sub-clusters consist of two majorly non-linear rules. Each sub-cluster of rules is derived from a cluster leader rule by reflection or negation or the combined two transformations. It is shown that the members of each subcluster share the same dynamical behavior. Results of testing the ECA running under these rules for comprehensively large number of lattice lengths using the Diehard Test suite have shown that apart from some anomaly, the whole output sequence can be potentially utilized for cryptographic strength pseudo random sequence generation with sufficiently large number of p-values pass rates.
the Diehard statistical battery of tests. The design has strong correlation immunity and it is in... more the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.
Uploads
Papers by Karim Salman