The Experts below are selected from a list of 4605 Experts worldwide ranked by ideXlab platform
Kritsanapong Somsuk - One of the best experts on this subject based on the ideXlab platform.
-
speed up rsa s Decryption Process with large sub exponents using improved crt
International Conference on Information Technology, 2018Co-Authors: Kritsanapong Somsuk, Thanapat Chiawchanwattana, Chalida SanemueangAbstract:The aim of this paper is to present the improvement of Chinese Remainder Theorem (CRT) to speed up RSA’s Decryption Process by changing sub exponents and transforming ciphertext in another domain. Although applying CRT with RSA, called CRT-RSA, can be chosen to decrease time in Decryption side, computing modular exponentiation still consumes enormous time whenever sub exponents are large. In addition, the proposed method suits to apply with high sub exponents of CRT-RSA because the new sub exponents are smaller. On the other hand, both of them become larger when CRT-RSA’s exponents are small. Therefore, the proposed method cannot be chosen to replace CRT-RSA but it is one of two choices for the implementation. If sub exponents are small, CRTRSA is a better choice to speed up RSA’s Decryption. Nevertheless, the proposed method should be selected when sub exponents are large. The experimental results show that the proposed method can finish the Process faster than CRT-RSA for both of key generation Process and Decryption Process whenever sub exponents are large. Furthermore, in Decryption side, the proposed method is faster than CRT-RSA about 20 – 40%.
-
Speed up RSA’s Decryption Process with Large sub Exponents using Improved CRT
2018 International Conference on Information Technology (InCIT), 2018Co-Authors: Kritsanapong Somsuk, Thanapat Chiawchanwattana, Chalida SanemueangAbstract:The aim of this paper is to present the improvement of Chinese Remainder Theorem (CRT) to speed up RSA's Decryption Process by changing sub exponents and transforming ciphertext in another domain. Although applying CRT with RSA, called CRT-RSA, can be chosen to decrease time in Decryption side, computing modular exponentiation still consumes enormous time whenever sub exponents are large. In addition, the proposed method suits to apply with high sub exponents of CRT-RSA because the new sub exponents are smaller. On the other hand, both of them become larger when CRT-RSA's exponents are small. Therefore, the proposed method cannot be chosen to replace CRT-RSA but it is one of two choices for the implementation. If sub exponents are small, CRTRSA is a better choice to speed up RSA's Decryption. Nevertheless, the proposed method should be selected when sub exponents are large. The experimental results show that the proposed method can finish the Process faster than CRT-RSA for both of key generation Process and Decryption Process whenever sub exponents are large. Furthermore, in Decryption side, the proposed method is faster than CRT-RSA about 20 - 40%.
-
The New Equation for RSA's Decryption Process Appropriate with High Private Key Exponent
2017 21st International Computer Science and Engineering Conference (ICSEC), 2017Co-Authors: Kritsanapong SomsukAbstract:RSA is the best well - known public key cryptography using a pair of keys for encryption and Decryption Process. Usually, the private key is generated higher than public key to avoid attacking by third parties easily. However, with the high private key, it affects to finish Decryption Process slowly. In this paper, the new equation for RSA's Decryption Process is proposed to speed up the computation time. In fact, the key is that the modular inverse of ciphertext is chosen instead of the ciphertext for the computation with the new exponent. In addition, the new exponent is computed from the relation between the private key and euler value. Furthermore, the proposed method is the better choice when the high private key is chosen because the new exponent becomes a small value. The experimental results show that the proposed method can finish RSA's Decryption Process very fast whenever the private key is high especially when it is very close too euler value. On the other hand, if the private key is a small value, the Process must take very high computation cost. However, after the proposed method is presented, it implies that the private key should not be assigned close to euler value because it will become the easy way for the third parties to recover original plaintext without knowing the private key.
-
Applying d-RSA with login system to speed up Decryption Process in client side
2017 IEEE 3rd International Conference on Engineering Technologies and Social Sciences (ICETSS), 2017Co-Authors: Kritsanapong Somsuk, Nopparat ThammawongsaAbstract:Login System is the important Process to identify the right for accessing the application by identifying and authenticating. Usually, username and password are the personal details of user for accessing the system. However, if both of them are stolen over the insecure channel, then the system is broken. With this problem, some of cryptographic algorithms are chosen to apply with the login system to avoid breaking the system. In the beginning of this year, the strong login system was proposed by applying with two different cryptographic algorithms, RSA and One Time Pad (OTP). RSA which is the asymmetric key cryptosystem is chosen for exchanging the OTP's key. One the other hand, user's password will be protected by using OTP. Although the improved login system is very strong and is very difficult for attackers to trap the information, the speed becomes very slow especially the Decryption Process of RSA taking very high computation time. In this paper, the new modified login system is proposed to speed up the login Process with the same security level when it is compared with the login system applying with RSA and OTP. In fact, d-RSA is chosen instead of RSA by choosing the new private key with the lower Hamming weight in comparison to the private key. In particularly, with the lower Hamming weight, it implies that the new modified login system applying with d-RSA and OTP is faster than the login system with RSA and OTP. The experimental results show that the new modified system can speed up the login system although it becomes slower in registration Process. The reason is that in registration Process, it must also take time to find the new private key with the lower Hamming weight. However, the registration system is the Process that will be implemented only the first time for user to sign up the application.
-
the improving Decryption Process of rsa by choosing new private key
International Conference on Information Technology and Electrical Engineering, 2016Co-Authors: Kritsanapong SomsukAbstract:RSA is the best well — known and the most widely used of public key cryptosystem. The advantage of this algorithm is that the senders who have the public key and the receivers who have private key can communicate each other via the unsecured channel secretly. However, the Processes of RSA have to take very great computation cost especially in the Decryption Process. In this paper, the improving Decryption Process of RSA, is called New Private Key of RSA (d-RSA), is proposed to reduce the computation cost of the Decryption Process. The key is to find the new private key, which has low Hamming weight while the values of public key and modulus are not changed. With the low Hamming weight, it implies that the computation cost of Decryption Process of d-RSA is certainly reduced when compared with the same Process which has the higher Hamming weight in RSA. Furthermore, it implies that not only the private key which is the inverse of public key modulo Euler function but also the other keys that can decrypt the ciphertext. In addition, with reducing computation cost, the proposed method is the better choice when low power devices are chosen to decrypt the ciphertext.
Tsuyoshi Takagi - One of the best experts on this subject based on the ideXlab platform.
-
CRYPTO - Fast RSA-Type Cryptosystem Modulo pkq
Advances in Cryptology — CRYPTO '98, 1998Co-Authors: Tsuyoshi TakagiAbstract:We propose a cryptosystem modulo p k q based on the RSA cryptosystem. We choose an appropriate modulus p k q which resists two of the fastest factoring algorithms, namely the number field sieve and the elliptic curve method. We also apply the fast Decryption algorithm modulo p k proposed in [22]. The Decryption Process of the proposed cryptosystems is faster than the RSA cryptosystem using Chinese remainder theorem, known as the Quisquater-Couvreur method [17]. For example, if we choose the 768-bit modulus p 2 q for 256-bit primes p and q, then the Decryption Process of the proposed cryptosystem is about 3 times faster than that of RSA cryptosystem using Quisquater-Couvreur method.
-
Fast RSA-type cryptosystem modulo pkq
Lecture Notes in Computer Science, 1998Co-Authors: Tsuyoshi TakagiAbstract:We propose a cryptosystem modulo p k q based on the RSA cryptosystem. We choose an appropriate modulus p k q which resists two of the fastest factoring algorithms, namely the number field sieve and the elliptic curve method. We also apply the fast Decryption algorithm modulo p k proposed in [22]. The Decryption Process of the proposed cryptosystems is faster than the RSA cryptosystem using Chinese remainder theorem, known as the Quisquater-Couvreur method [17]. For example, if we choose the 768-bit modulus p 2 q for 256-bit primes p and q, then the Decryption Process of the proposed cryptosystem is about 3 times faster than that of RSA cryptosystem using Quisquater-Couvreur method.
Fernando Jose Ribeiro Sales - One of the best experts on this subject based on the ideXlab platform.
-
encryption of medical images based on the cosine number transform
Signal Processing-image Communication, 2015Co-Authors: Juliano B Lima, Francisco Madeiro, Fernando Jose Ribeiro SalesAbstract:Abstract In this paper, we introduce a novel scheme for encryption of medical images. The technique is based on the cosine number transform, a mathematical tool whose application requires modular arithmetic only. This property avoids rounding-off errors and allows that the image recovered after the encryption/Decryption Process be identical to the corresponding original image. The proposed scheme is flexible and can be applied to images complying with the DICOM standard, which is frequently employed in medical applications. We show that the technique is capable of resisting the main cryptographic attacks.
Juliano B Lima - One of the best experts on this subject based on the ideXlab platform.
-
encryption of medical images based on the cosine number transform
Signal Processing-image Communication, 2015Co-Authors: Juliano B Lima, Francisco Madeiro, Fernando Jose Ribeiro SalesAbstract:Abstract In this paper, we introduce a novel scheme for encryption of medical images. The technique is based on the cosine number transform, a mathematical tool whose application requires modular arithmetic only. This property avoids rounding-off errors and allows that the image recovered after the encryption/Decryption Process be identical to the corresponding original image. The proposed scheme is flexible and can be applied to images complying with the DICOM standard, which is frequently employed in medical applications. We show that the technique is capable of resisting the main cryptographic attacks.
Chenggen Quan - One of the best experts on this subject based on the ideXlab platform.
-
single channel optical color image cryptosystem using two step phase shifting interferometry and random modulus decomposition
Optics and Laser Technology, 2019Co-Authors: Y Xiong, J. Du, Chenggen QuanAbstract:Abstract We propose an optical asymmetric single-channel color image cryptosystem based on two-step phase-shifting and random modulus decomposition (RMD) method. In the proposed cryptosystem, a color image is represented by the indexed format including a data matrix and a colormap. The data matrix is regarded as the input of double random phase encoding (DRPE)-based structure while the colormap in which the number of the colors is used as a private key. A designed operator in which phase modulators (PMs) utilized as private keys are generated is introduced to the DRPE-based structure to remove its linearity. As the output of the DRPE-based structure, the complex-valued image is retrieved from interferograms recorded using two-step phase-shifting technique. In addition, to further improve the security of the cryptosystem, the RMD used as a post-Processing operation is performed digitally on the retrieved complexed-valued image and then an additional private key is generated. In the Decryption Process, three private keys generated in the encryption Process are utilized to retrieve the original color image using a modified 4-f cryptosystem. In our proposed algorithm, Decryption keys are different from encryption keys and the Decryption Process is also different from the encryption Process. Compared to the DRPE-based cryptosystem, the proposed cryptosystem is immune to various attacks. Numerical simulation is carried out to demonstrate the feasibility and effectiveness of the proposed cryptosystem.
-
Hybrid attack free optical cryptosystem based on two random masks and lower upper decomposition with partial pivoting
Optics & Laser Technology, 2019Co-Authors: Y Xiong, Chenggen QuanAbstract:Abstract We propose a novel asymmetric optical image encryption scheme using two random phase masks (RPMs) and lower upper decomposition with partial pivoting (LUDP), in which the encryption Process is different from the Decryption Process and encryption keys are also different from Decryption keys. In the proposed algorithm, LUDP is a matrix decomposition operation, which is used to replace the phase-truncated (PT) operation in the encryption path of conventional optical image encryption schemes based on phase-truncated Fourier transform (PTFT). In the proposed Decryption Process, the original image is completely retrieved by an optical architecture based on the modified 4f system with two private keys generated in the encryption Process. Compared to conventional PTFT-based cryptosystems which are vulnerable to special attacks based on the amplitude-phase retrieval technique, our proposed algorithm is immune to the iterative attack and has a higher security level. Numerical simulations are presented to demonstrate the feasibility and robustness of the proposed encryption scheme.
