16 results for “plaintext”

Set a search alert

Research ArticleOpen accessIn the abstractA New Cryptosystem Based on Factoring and Discrete Logarithm ProblemsE.S. Ismail, M.S.N. HijaziProblem statement: A cryptosystem allows a sender to send any confidential or private message using a receiver’s public key and later the receiver confirms the integrity of the received message using his secret key. Currently the existing cryptosystems were developed based on a single hard problem like factoring, discrete logarithm, residuosity, knapsack or elliptic curve discrete logarithm. Although these schemes … …Journal of Mathematics and Statistics, Vol. 7, Issue 3 · 18 Jul 2011 · 7,786 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA 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 PDF Cite

Research ArticleOpen accessIn the abstractAttack 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 PDF Cite

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 PDF Cite

Research ArticleOpen accessIn the abstractRounding Theorem the Possibility of Applying the Cryptosystems on the Decimal NumbersRand Alfaris, Muhamad Rezal Kamel Ariffin, Mohamed Rushdan Md SaidThe possibility of using the decimal numbers in cryptography as the base of the encryption and decryption is proposed by introducing the "Rounding Theorem". Until now, cryptosystems are used the integer numbers to avoid the fractions of the decimal numbers. That is to avoid losing the original plaintext after the decryption. This theorem is proved that there is no lost … …Journal of Mathematics and Statistics, Vol. 4, Issue 1 · 31 Mar 2008 · 7,204 accessesView PDF Cite

Research ArticleOpen accessIn the abstractModified Hill Cipher with Interlacing and IterationV. U.K.. Sastry, N. Ravi ShankarIn this research, we have developed a block cipher by taking a large key matrix of size nxn and a plaintext matrix containing n rows and two columns. In this, the plaintext column vectors, perated by the key matrix are thoroughly interlaced at each stage of the iteration. As a typical example, we have taken the key in the form … …Journal of Computer Science, Vol. 3, Issue 11 · 30 Nov 2007 · 7,353 accessesView PDF Cite