Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

40 articles for “cryptosystem”
Set a search alert
Research ArticleOpen accessEvery word in the titleA Novel Feature Extraction Dual DCT-DWT Image Watermarking Combined with Chaos-Based CryptosystemKumari Rinki, Pushpneel Verma, Tanupriya Choudhury, Bhupesh Kumar SinghAs a result of the emerging technologies such as Internet-of-Things (IoT), data analysis and automation in many aspects of identity, watermarking has become increasingly important. A majority of prior systems focused on watermark embedding and recovery techniques for binary and grey-scale images in one specified region of the cover image, making the system less dependable. This study develops a novel … …Journal of Computer Science, Vol. 17, Issue 10 · 13 Nov 2021 · 6,094 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExtensive Analysis on Images Encryption using Hybrid Elliptic Curve Cryptosystem and Hill CipherSaniah Sulaiman, Zurina Mohd HanapiThe advancement of communication technology helps individual to share images through an Internet. However, the sharing through insecure channels may expose the images to certain attacks that will compromise their confidentiality. Image encryption is one of the methods used to protect against the confidentiality threat. A Hill Cipher has been applied in image encryption because of its simple operation and … …Journal of Computer Science, Vol. 17, Issue 3 · 2 Apr 2021 · 6,615 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleCARRY SAVE COMMON MULTIPLICAND MONTGOMERY FOR RSA CRYPTOSYSTEMRupali Verma, Maitreyee Dutta, Renu VigRSA public key cryptosystem provides encryption and digital signatures. With growth of key size an efficient design of RSA in terms of area, frequency, throughput and power consumption is hard to achieve. Also with the different type of attacks possible, a need for secure RSA cryptosystem which is attack resistant has arisen. This study presents RSA design with Montgomery powering … …American Journal of Applied Sciences, Vol. 11, Issue 5 · 8 Mar 2014 · 6,969 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA HYBRID CRYPTOSYSTEM USING VARIABLE LENGTH SUB KEY GROUPS AND BYTE SUBSTITUTIONAdi Narayana Reddy Kaipa, Vishnu Vardhan Bulusu, Ramakrishna Reddy Koduru, Durga Prasad KavatiHill cipher is developed using simple linear transformation. It is vulnerable to known-plaintext attack and there exist several methods in the direction of linear transformation to overcome the problems. HCM-EE is an improved method using Eigen value but it is linear and too many mathematical operations. In this study an attempt has been made to introduce nonlinearity to the linear … …Journal of Computer Science, Vol. 10, Issue 2 · 13 Nov 2013 · 6,871 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Cryptosystem Using the Concepts of Algebraic Geometric CodeK. V. Pramod, C. ManjuProblem statement: Cryptosystem using linear codes was developed in 1978 by Mc-Eliece. Later in 1985 Niederreiter and others developed a modified version of cryptosystem using concepts of linear codes. But these systems were not used frequently because of its larger key size. In this study we were designing a cryptosystem using the concepts of algebraic geometric codes with smaller key … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,444 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA New Computation Algorithm for a Cryptosystem Based on Lucas FunctionsMohamed Othman, Esam M. Abulhirat, Zulkarnain Md Ali et al.Most of public-key cryptosystems rely on one-way functions. The cryptosystems can be used to encrypt and sign messages. The LUC Cryptosystem is a cryptosystem based on Lucas Functions. The encryption process used a public key which was known publicly and the decryption used a private key which was known only by sender and receiver of the messages. The performance of … …Journal of Computer Science, Vol. 4, Issue 12 · 31 Dec 2008 · 6,938 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleRounding 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 PDFCite
Research ArticleOpen accessEvery word in the titleMathematical 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
Research ArticleOpen accessEvery word in the titleA VARIANT OF POLLARD'S RHO ATTACK ON ELLIPTIC CURVE CRYPTOSYSTEMSSiham Ezzouak, Mohammed Elamrani, Abdelmalek AziziElliptic Curve cryptosystems appear to be more secure and efficient when requiring small key size to implement than other public key cryptosystems. Its security is based upon the difficulty of solving Elliptic Curve Discrete Logarithm Problem (ECDLP). This study proposes a variant of generic algorithm Pollard's Rho for finding ECDLP using cycle detection with stack and a mixture of cycle … …Journal of Computer Science, Vol. 10, Issue 8 · 9 Apr 2014 · 7,269 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleThe 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