Research ArticleOpen accessEvery word in the titleNew Directions in Cryptanalysis of Block CiphersDavood RezaeiPour, Mohamad Rushdan Md SaidProblem statement: The algebraic expression of the Advanced Encryption Standard (AES) RIJNDAEL S-box involved only 9 terms. The selected mapping for RIJNDAEL S-box has a simple algebraic expression. This enables algebraic manipulations which can be used to mount interpolation attack. Approach: The interpolation attack was introduced as a cryptanalytic attack against block ciphers. This attack is useful for cryptanalysis using … …Journal of Computer Science, Vol. 5, Issue 12 · 31 Dec 2009 · 7,026 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAttack of Against Simplified Data Encryption Standard Cipher System Using Neural NetworksKhaled M. Alallayah, Waiel F. Abd El-Wahed, Mohamed Amin, Alaa H. AlhamamiProblem statement: The problem in cryptanalysis can be described as an unknown and the neural networks are ideal tools for black-box system identification. In this study, a mathematical black-box model is developed and system identification techniques are combined with adaptive system techniques, to construct the Neuro-Identifier. Approach: The Neuro-Identifier was discussed as a black-box model to attack the target cipher … …Journal of Computer Science, Vol. 6, Issue 1 · 31 Jan 2010 · 7,941 accessesView PDFCite
Research ArticleOpen accessIn the keywordsIMPLICATIONS OF BITSUM ATTACK ON TINY ENCRYPTION ALGORITHM AND XTEAAmandeep, G. GeethaTEA and XTEA are block ciphers that uses Fiestal structure. We enciphered a fixed message with different keys using TEA and XTEA cryptographic algorithms. Our interest was to find the correlation of the bitsum of the ciphertext with the bitsums of the corresponding keys. In our attempt, we found that for specific patterns of keys, whatever be the plaintext, the … …Journal of Computer Science, Vol. 10, Issue 6 · 3 Feb 2014 · 7,364 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMathematical Attacks on RSA CryptosystemImad K. Salah, Abdullah Darwish, Saleh OqeiliIn this paper some of the most common attacks against Rivest, Shamir, and Adleman (RSA) cryptosystem are presented. We describe the integer factoring attacks, attacks on the underlying mathematical function, as well as attacks that exploit details in implementations of the algorithm. Algorithms for each type of attacks are developed and analyzed by their complexity, memory requirements and area of … …Journal of Computer Science, Vol. 2, Issue 8 · 31 Aug 2006 · 8,420 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 abstractAnalysis Quantum Implementation of Double AES Cryptography for Secure QR Code GenerationJimmy Wijaya, RojaliData security faces unprecedented challenges due to the rapid advancement of quantum computing technologies, which threaten to compromise foundational classical cryptographic algorithms. This study investigates the quantum implementation of a Double Advanced Encryption Standard (Double AES) scheme for generating secure, tamper-resistant Quick Response (QR) codes. The research encompasses architectural design, quantum circuit construction, and empirical performance evaluation across encryption/decryption execution … …Journal of Computer Science, Vol. 22, Issue 9 · 20 Sep 2026 · 571 accessesView PDFCite
Research ArticleOpen accessIn the abstractBlock Cipher Involving Key Based Random Interlacing and Key Based Random DecompositionK. Anup Kumar, V. U.K. SastryProblem statement: The strength of the block ciphers depend on the degree of confusion and diffusion induced in the cipher. Most of the transformations used for this purpose are well known to every one and can be broken by a crypt analyzer. Therefore, in order to counter attack the crypt analyzer, there is a need for better transformations in addition … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,004 accessesView PDFCite
Research ArticleOpen accessIn the abstractMessage Based Random Variable Length Key Encryption AlgorithmHamid Mirvaziri, Kasmiran Jumari Mahamod Ismail, Zurina Mohd HanapiProblem statement: A block ciphers provides confidentiality in cryptography but cryptanalysis of the classical block ciphers demonstrated some old weaknesses grabbing a partial key in any stage of encryption procedure leads to reconstructing the whole key. Exhaustive key search shows that key generation should be indeterminist and random for each round. Matching cipher-text attack shows that larger size of block … …Journal of Computer Science, Vol. 5, Issue 8 · 31 Aug 2009 · 6,804 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe New Variable-Length Key Symmetric CryptosystemDavood Rezaei Pour, Mohamad Rushdan Md Said, Kamel Ariffin Mohd Atan, Mohamed OthmanProblem statement: In this study, we proposed a new 64-bit block cipher that accepted a variable-length key up to 512 bits, which was suitable for implementation in a variety of environments. Approach: The cipher algorithm was a 16-round Feistel network with a bijective function f and was made up of two key-dependent 16×16 S-boxes, bitwise rotations, and a carefully designed … …Journal of Mathematics and Statistics, Vol. 5, Issue 1 · 31 Mar 2009 · 7,213 accessesView PDFCite
Research ArticleOpen accessIn the abstractDSP-128:Stream Cipher Based On Discrete Log Problem And Polynomial ArithmeticKhaled M. Suwais, Azman SamsudinDSP-128 is a new multithreaded stream cipher based on the intractability of the Discrete Logarithm Problem (DLP) with key size of 128-bit. The design of DSP-128 is divided into three stages: Initialization Stage, Keystream Generation Stage, and Encryption Stage. The design goal of DSP-128 is to come up with a secure stream cipher with good performance for data encryption. The … …American Journal of Applied Sciences, Vol. 5, Issue 7 · 31 Jul 2008 · 7,396 accessesView PDFCite