A novel and efficient public key encryption algorithm
01 Jan 2016-International Journal of Information and Communication Technology (Inderscience Publishers (IEL))-Vol. 9, Iss: 2, pp 199-211
TL;DR: This work has proposed a new and novel encryption technique that is computationally comparable to RSA and provably more effective under appropriate assumptions in the standard model.
Abstract: In the globalised world, most of the data which includes financial information are transferred on the internet as a result of which organisations face unprecedented security threats. Encryption is basically a process of converting plain text into encrypted form, so that, it can be secured against malicious third party attacks like eavesdropping. A number of cryptographic algorithms have been devised for this purpose and one of the most efficient and widely used algorithms being RSA because of its two key natures. In an attempt to further improve the efficiency of the encryption and decryption mechanism of asymmetric approach, we have proposed a new and novel encryption technique. The basic idea behind this novel approach is to reduce the execution time and create the space for its availability in internet. The under proposed new algorithm investigates a novel computational problem and its applications to e-commerce applications. The results of this scheme are computationally comparable to RSA and provably more effective under appropriate assumptions in the standard model.
Citations
More filters
TL;DR: A novel patient-centric system model for access control to SHIs stored in semi-honest servers and an encryption technique which is an improvement over RSA techniques to encrypt every patient’s SHI file is proposed.
9 citations
01 Oct 2017
TL;DR: The Diffie – Hellman algorithm is extended by using the concept of the Diffie -Hellman algorithm to get a stronger secret key and that secret key is further exchanged between the sender and the receiver so that for each message, a new secret shared key would be generated.
Abstract: The Diffie -Hellman is one of the first public-key procedure and is a certain way of exchanging the cryptographic keys securely. This concept was introduced by Ralph Markel and it is named after Whitfield Diffie and Martin Hellman. Sender and Receiver make a common secret key in Diffie-Hellman algorithm and then they start communicating with each other over the public channel which is known to everyone. A number of internet services are secured by Diffie –Hellman. In Public key cryptosystem, the sender has to trust while receiving the public key of the receiver and vice-versa and this is the challenge of public key cryptosystem. Man-in-the-Middle attack is very much possible on the existing Diffie-Hellman algorithm. In man-in-the-middle attack, the attacker exists in the public channel, the attacker receives the public key of both sender and receiver and sends public keys to sender and receiver which is generated by his own. This is how man-in-the-middle attack is possible on Diffie-Hellman algorithm. Denial of service attack is another attack which is found common on Diffie-Hellman. In this attack, the attacker tries to stop the communication happening between sender and receiver and attacker can do this by deleting messages or by confusing the parties with miscommunication. Some more attacks like Insider attack, Outsider attack, etc are possible on Diffie-Hellman. To reduce the possibility of attacks on Diffie-Hellman algorithm, we have enhanced the Diffie-Hellman algorithm to a next level. In this paper, we are extending the Diffie –Hellman algorithm by using the concept of the Diffie -Hellman algorithm to get a stronger secret key and that secret key is further exchanged between the sender and the receiver so that for each message, a new secret shared key would be generated. The second secret key will be generated by taking primitive root of the first secret key.
8 citations
TL;DR: From the results obtained, it can be proved that the proposed security method does not degrade the performance of the MIMO-OFDM system.
Abstract: In wireless communication, the transmitted information data is often intercepted by eavesdropper through fading channels. Since the signal is transmitted by the transmitter through a wireless channel, it is not only the authorized receiver but also the attacker or the eavesdropper can easily capture and store the information signal. This research examines the security methods in wireless communication, where the security method used is subcarrier randomization. In the receiver, the subcarrier position must be restored to its original position. To restore the subcarrier position to its original position there needs to be a synchronization between transmitter and receiver. We use RSA algorithm as synchronization between transmitter and receiver. Subcarrier randomization security method is implemented on Multiple Input Multiple Output - Orthogonal Frequency Division Multiplexing (MIMO-OFDM) system. We perform QoS measurements including delay, throughput and packet loss on MIMO-OFDM systems using security and MIMO-OFDM systems without security. From the results obtained, we can prove that the proposed security method does not degrade the performance of the MIMO-OFDM system. MIMO-OFDM system with security can result in smaller packet loss than the MIMO-OFDM system without security. MIMO-OFDM system with security has the average packet loss 0.145%.
2 citations
05 Mar 2021
TL;DR: In this paper, an energy-based fusion method for multi-exposure image reconstruction was proposed, which fuses the input images details by the subjective middle function average and 8 neighborhood model.
Abstract: This chapter proposes a method for multi-exposure image reconstruction by energy-based fusion. The image has been taken from the unchanged sceneries with the dissimilar and multiple exposure time which gives a good image with the superimposed quality. Based on the previous techniques which has been followed, it ended up in the unclear textures as well as edges. To overwhelm the demerits, this technique fuses the input images details by the subjective middle function average and 8 neighborhood model. This idea gives fused images with less uncertainty and redundancy and concentrates on object focus, eminence, and clearance with similar resolution with energy as the parameter. By numerical analysis, the proposed method has certain merits over the earlier methods such as the capability to conserve all applicable data and exclusion of the aftereffects like sensitivity to error and reduction of contrast.
References
More filters
TL;DR: New variants of an RSA whose key generation algorithms output two distinct RSA key pairs having the same public and private exponents, called dual RSA, can be used in scenarios that require two instances of RSA with the advantage of reducing the storage requirements for the keys.
Abstract: We present new variants of an RSA whose key generation algorithms output two distinct RSA key pairs having the same public and private exponents. This family of variants, called dual RSA, can be used in scenarios that require two instances of RSA with the advantage of reducing the storage requirements for the keys. Two applications for dual RSA, blind signatures and authentication/secrecy, are proposed. In addition, we also provide the security analysis of dual RSA. Compared to normal RSA, the security boundary should be raised when applying dual RSA to the types of small-d, small-e, and rebalanced-RSA.
106 citations
07 Jan 2012
TL;DR: This scheme presents a new cryptography algorithm based on additive homomorphic properties called Modified RSA Encryption Algorithm (MREA), which is secure as compared to RSA as it is based on the factoring problem as well as decisional composite residuosity assumptions which is the intractability hypothesis.
Abstract: In asymmetric key cryptography, also called Public Key cryptography, two different keys (which forms a key pair) are used. One key is used for encryption & only the other corresponding key must be used for decryption. No other key can decrypt the message, not even the original (i.e. the first) key used for encryption. The beauty of this scheme is that every communicating party needs just a key pair for communicating with any number of other communicating parties. Once some one obtains a key pair, he /she can communicate with any one else. RSA is a well known public-key cryptography algorithm. It is the first algorithm known to be suitable for signing as well as encryption, and was one of the first great advances in public key cryptography. The security of the RSA cryptosystem is based on two mathematical problems: the problem of factoring large numbers know mathematical attack and the problem of trying all possible private keys know brute force attack. So to improve the security, this scheme presents a new cryptography algorithm based on additive homomorphic properties called Modified RSA Encryption Algorithm (MREA). MREA is secure as compared to RSA as it is based on the factoring problem as well as decisional composite residuosity assumptions which is the intractability hypothesis. The scheme is an additive homomorphic cryptosystem, this means that, given only the public-key and the encryption of m1 and m2, one can compute the encryption of m1 + m2. This scheme also presents comparison between RSA and MREA cryptosystems in terms of security and performance.
69 citations
TL;DR: The proposed implementation of public key cryptography can provide confidentiality, authentication, integrity and non-repudiation security services needed for mobile communication, which has lower risk and the security has been improved, to avoid many kinds of attacks.
Abstract: Mobile phones are considered to be the most common communication devices in history. Recently, mobile phones are not only used for casual greetings but also, sending and receiving important data such as, social security numbers, bank account details and passwords. Public key cryptography is a proven security solution, which can be used to secure the mobile communications. Several researchers have proposed server-based architectures public key cryptography solution to secure the mobile communications. Third party servers were used to check the certificates, authenticating the communicating parties, key distribution, etc. This paper proposes and implements a non-server (that is, P2P), architecture public key cryptography to secure the mobile communications. The proposed implementation of public key cryptography can provide confidentiality, authentication, integrity and non-repudiation security services needed for mobile communication. Compared with server based architecture, non-server based architecture has lower risk and the security has been improved, to avoid many kinds of attacks.
Key words: Public key cryptography, NTRU, peer to peer, confidentiality, authentication, integrity and non-repudiation, mobile communication security.
47 citations
07 Apr 2008
TL;DR: The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers and is claimed to be efficient, scalable and dynamic.
Abstract: In this paper, we propose an efficient RSA public key encryption scheme, which is improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in zn indicated via l(h, zn) . Since the original RSA Scheme is a block cipher in which the original message and cipher message are integer in the interval [0, n -1] for some integer modulus n. Therefore, in this paper, we generalize RSA encryption scheme in order to be implemented in the general linear group on the ring of integer mod n. Furthermore, the suggested encryption scheme has no restriction in encryption and decryption order and is claimed to be efficient, scalable and dynamic.
40 citations
17 Apr 2010
TL;DR: A variant of RSA cryptosystem (EAMRSA-Encrypt Assistant Multi- Prime RSA) is proposed by reducing modules and private exponents in modular exponentiation to speed up RSA decryption and signature.
Abstract: This paper aims at speeding up RSA decryption and signature. The performance of RSA decryption and signature has direct relationship with the efficiency of modular exponentiation implementation. This paper proposes a variant of RSA cryptosystem (EAMRSA-Encrypt Assistant Multi- Prime RSA) by reducing modules and private exponents in modular exponentiation. The experimental result shows that the speed of the decryption and signature has been substantially improved and the variant can be efficiently implemented in parallel.
26 citations