Research ArticleOpen accessIn the keywordsGeneralization 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 accessIn the keywordsA Novel Enhancement Technique of the Hill Cipher for Effective Cryptographic PurposesA. F.A. Abidin, O. Y. Chuan, M. R.K. AriffinProblem statement: The Hill cipher is the first polygraph cipher which has a few advantages in data encryption. However, it is vulnerable to known plaintext attack. Besides, an invertible key matrix is needed for decryption. It may become problematic since an invertible key matrix does not always exist. Approach: In this study, a robust Hill algorithm (Hill++) has been proposed. … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 8,545 accessesView PDFCite
Review ArticleOpen accessIn the abstractA Comprehensive Review of Post-Quantum Cryptography AlgorithmsSamandeep Kaur, Jaswinder SinghThe development of quantum computing has been rapid, and an existential threat to computational hardness assumptions that underlie today's public-key cryptography has been encountered. This manuscript is a complete and thoroughly organized review of Post-Quantum Cryptography (PQC), discussing the mathematical concepts, complexity, and mechanisms of the algorithms that underpin quantum-safe security infrastructures. Rather than the principles of quantum mechanics, the … …Journal of Computer Science, Vol. 22, Issue 9 · 25 Sep 2026 · 723 accessesView PDFCite
Research ArticleOpen accessIn the abstractElementary Structure of Matter can be Studied with New Quantum ComputersNicolae Petrescu, Florian Ion Tiberiu PetrescuMuch has been talked about quantum computers. Today they are working on difficult simulations, so we can already congratulate the college of researchers at the Oak Ridge National Laboratory as the world's first to successfully simulate an atomic nucleus using a quantum computer. The results that were published in the physical examination letters demonstrate the huge capacity of quantum systems … …American Journal of Engineering and Applied Sciences, Vol. 11, Issue 2 · 25 Jun 2018 · 7,698 accessesView PDFCite
EditorialOpen accessIn the abstractOn the Importance of Pure MathematicsFarida KachapovaCoutinho, S.C., 1999. The Mathematics of Ciphers: Number Theory and RSA Cryptography, A K Peters/CRC Press, ISBN-13: 978-1568810829, pp: 198. ERCIM, 2008. Introduction to the special theme: Maths for Everyday Life. Introduction to the Special Theme, University of Helsinki, Finland. Direct Link Flapan, E., 2000. When Topology Meets Chemistry: A Topological Look at Molecular Chirality. 1st Edn., The Mathematical Association … …Journal of Mathematics and Statistics, Vol. 10, Issue 4 · 11 Dec 2014 · 43,152 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegration of Quantum Cryptography through Satellite Networks TransmissionSkander Aris, Abderraouf Messai, Malek Benslama et al.Problem statement: The security of the telecommunications satellite has become a crucial issue. The telecommunications can be set using the classical cryptography. But this so-called classical cryptography provides cryptographic security. This means that security is based on the difficulty of some mathematics problems. On the other hand, quantum cryptography provides security without conditions based on the law of quantum physics. … …American Journal of Applied Sciences, Vol. 8, Issue 1 · 31 Jan 2011 · 7,516 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Bit-Serial Multiplier Architecture for Finite Fields Over Galois FieldsHero Modares, Yasser Salem, Rosli Salleh, Majid Talebi ShahgoliProblem statement: A fundamental building block for digital communication is the Public-key cryptography systems. Public-Key Cryptography (PKC) systems can be used to provide secure communications over insecure channels without exchanging a secret key. Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selecting the implementation platform. Approach: The most popular … …Journal of Computer Science, Vol. 6, Issue 11 · 23 Oct 2010 · 8,431 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordFractal (Mandelbrot and Julia) Zero-Knowledge Proof of IdentityMohammad Ahmad Alia, Azman Bin SamsudinWe proposed a new zero-knowledge proof of identity protocol based on Mandelbrot and Julia Fractal sets. The Fractal based zero-knowledge protocol was possible because of the intrinsic connection between the Mandelbrot and Julia Fractal sets. In the proposed protocol, the private key was used as an input parameter for Mandelbrot Fractal function to generate the corresponding public key. Julia Fractal … …Journal of Computer Science, Vol. 4, Issue 5 · 31 May 2008 · 6,961 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA New Digital Signature Scheme Based on Mandelbrot and Julia Fractal SetsMohammad Ahmad Alia, Azman Bin SamsudinThis paper describes a new cryptographic digital signature scheme based on Mandelbrot and Julia fractal sets. Having fractal based digital signature scheme is possible due to the strong connection between the Mandelbrot and Julia fractal sets. The link between the two fractal sets used for the conversion of the private key to the public key. Mandelbrot fractal function takes the … …American Journal of Applied Sciences, Vol. 4, Issue 11 · 30 Nov 2007 · 6,962 accessesView PDFCite