Research ArticleOpen accessPhrase in the titleGeneralization of Boolean Functions Properties to Functions Defined over GF(p)Saad Elmansori, B. E. EsamProblem statement: Traditionally, cryptographic applications designed on hardware have always tried to take advantage of the simplicity of implementation functions over GF(p), p = 2, to reduce costs and improve performance. On the contrast, functions defined over GF(p); p > 2, possess far better cryptographic properties than GF(2) functions. Approach: We generalize some of the previous results on cryptographic Boolean … …Journal of Computer Science, Vol. 8, Issue 6 · 13 Mar 2012 · 7,436 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleUsing Background Knowledge and Random Sampling in Genetic Programming: A Case Study in Learning Boolean Parity FunctionsLappoon R. TangThe Boolean even-N-parity function returns T (i.e., true) if an even number of its Boolean arguments for N arguments are T and otherwise returns NIL (i.e., false). Learning Boolean even-N-parity functions has been recognized as a difficult problem for evolutionary computation (such as genetic programming) especially when N is large (e.g., 20+). A number of approaches have been proposed for … …Journal of Computer Science, Vol. 19, Issue 7 · 10 Jul 2023 · 5,481 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Novel Fault Tolerant Reversible Gate For Nanotechnology Based SystemsMajid Haghparast, Keivan NaviThis paper proposes a novel reversible logic gate, NFT. It is a parity preserving reversible logic gate, that is, the parity of the outputs matches that of the inputs. We demonstrate that the NFT gate can implement all Boolean functions. It renders a wide class of circuit faults readily detectable at the circuit's outputs. The proposed parity preserving reversible gate, … …American Journal of Applied Sciences, Vol. 5, Issue 5 · 31 May 2008 · 7,904 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOn a Proof of Inequality of PvsNPAngelo Raffaele MeoThis study is a new version of a previous paper. Its purpose is to simplify some sections of the old version and, above all, to present the proofs of some theorems which had been omitted for the sake of brevity. The analysis discussed in this study and its previous version is based on a well-known NP-complete problem which is called … …Journal of Computer Science, Vol. 19, Issue 1 · 16 Jan 2023 · 7,531 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOn the P VS NP Question: A New Proof of InequalityAngelo Raffaele MeoThe analysis discussed in this study is based on a well-known NP-complete problem which is called “satisfiability problem or SAT”. From SAT a new NP-complete problem derives, which is described by a Boolean function of the number n of the clauses of SAT called “core function”. In this study a new proof is presented according which the number of gates … …Journal of Computer Science, Vol. 17, Issue 5 · 27 May 2021 · 9,442 accessesView PDFCite
Research ArticleOpen accessIn the abstractON SELF-INVERSE BINARY MATRICES OVER THE BINARY GALOIS FIELDAli Muhammad Ali Rushdi, Fares Ahmad Muhammad GhalebAn important class of square binary matrices over the simplest finite or Galois Field GF(2) is the class of involutory or Self-Inverse (SI) matrices. These matrices are of significant utility in prominent engineering applications such as the study of the Preparata Transformation or the analysis of synchronous Boolean Networks. Therefore, it is essential to devise appropriate methods, not only for … …Journal of Mathematics and Statistics, Vol. 9, Issue 3 · 4 Sep 2013 · 7,248 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Reversible BCD Adder For Nanotechnology Based SystemsMajid Haghparast, Keivan NaviThis paper proposes two reversible logic gates, HNFG and HNG. The first gate HNFG can be used as two Feynman Gates. It is suitable for a single copy of two bits with no garbage outputs. It can be used as "Copying Circuit" to increase fan-out because fan-out is not allowed in reversible circuits. The second gate HNG can implement all … …American Journal of Applied Sciences, Vol. 5, Issue 3 · 31 Mar 2008 · 10,135 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Backpropagation Neural Network for Computer Network SecurityKhalil ShihabIn this paper, an efficient and scalable technique for computer network security is presented. On one hand, the decryption scheme and the public key creation used in this work are based on a multi-layer neural network that is trained by backpropagation learning algorithm. On the other hand, the encryption scheme and the private key creation process are based on Boolean … …Journal of Computer Science, Vol. 2, Issue 9 · 30 Sep 2006 · 19,535 accessesView PDFCite
Research ArticleOpen accessIn the abstractEmpirical Analysis and Mathematical Representation of the Path Length Complexity in Binary Decision DiagramsA. Assi, P. W.C. Prasad, B. Mills, A. ElchouemiInformation about the distribution of path-lengths in a Binary Decision Diagrams (BDDs) representing Boolean functions is useful in determining the speed of hardware and software implementations of the circuit represented by these Boolean functions. This study presents expressions produced from an empirical analysis of a representative collection of Boolean functions. The Average Path Length (APL) and the Shortest Path Length … …Journal of Computer Science, Vol. 2, Issue 3 · 31 Mar 2006 · 6,814 accessesView PDFCite
Research ArticleOpen accessIn the abstractBDD Path Length Minimization Based on Initial Variable OrderingP. W.C. Prasad, M. Raseen, A. Assi, S. M.N.A. SenanayakeA large variety of problems in digital system design, combinational optimization and verification can be formulated in terms of operations performed on Boolean functions. The time complexity of Binary Decision Diagram (BDD) representing a Boolean function is directly related to the path length of that BDD. In this paper we present a method to generate a BDD with minimum path … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 6,504 accessesView PDFCite