Dual RSA and Its Security Analysis
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.
Citations
More filters
04 Jul 2013
TL;DR: Pell's RSA key generation and its security analyses over the standard RSA, N Prime RSA, Dual RSA, and the application of Pell's RSA, Blind signatures, are proposed.
Abstract: In this paper, a new variant of RSA has been proposed whose key generation method is distinct with the standard RSA. Generally the RSA family of variants can be applied at the secured channel to enhance its data trust level on various applications such as E-commerce, Internet applications, etc., The boundary level of the private key has been recommended here, to raise over these variant to stay away from the possibility of getting the Small `d' value either by continuous fraction method of Wiener's attack, or by Coppersmith's lattice based method of Boneh & Durfee attack, or by retrieving the Euler's totient function value by Fermat factorization method. This paper discusses the proposal of Pell's RSA key generation and its security analyses over the standard RSA, N Prime RSA, Dual RSA. Finally the application of Pell's RSA, Blind signatures, are proposed.
60 citations
Cites methods from "Dual RSA and Its Security Analysis"
...al [5] This paper shows a new alternative of RSA algorithm....
[...]
17 Oct 2019
TL;DR: This paper puts forward cryptography incorporated steganography (CICS) to provide a highly secure Steganography algorithm for the files of the multiple formats to ensure the efficiency of the proffered method.
Abstract: The technological advancements in the information sharing and the development of many techniques to make the information conveyance easy necessitate a protection methodology that could prevent the personal information that is transmitted from being hacked. Some of the protection methods that have emerged are the cryptography, steganography, watermarking, digital signature etc. As steganography is a popular method of transmitting the covered secret information in order to avoid hacking and the misuse due to its major attributes such as the security, capacity and the robustness. This paper puts forward cryptography incorporated steganography (CICS) to provide a highly secure steganography algorithm for the files of the multiple formats, The performance analysis of the method and the measurement of the parameters such as the PSNR and the SSIM are done to ensure the efficiency of the proffered method.
53 citations
01 Apr 2017
TL;DR: A new variant of RSA has been proposed called Memory Efficient Multi Key (MEMK) generation scheme, which reuses the RSA scheme with a Diophantine form of the nonlinear equation for memory efficiency and performs well.
Abstract: A new variant of RSA has been proposed called Memory Efficient Multi Key (MEMK) generation scheme. For sensitive data, our scheme will aid in exchanging the information between cloud to IoT and IoT to IoT devices. When cryptography belongs to the asymmetric type, then it has public and private keys. For memory efficiency, our scheme reuses the RSA scheme with a Diophantine form of the nonlinear equation. Moreover, our scheme performance comparatively performs well and this mainly due to the use of RSA public key alone. Due to this, our MEMK does not require multiplicative inverse function or Extended Euclid's algorithm. Finally, we have made an experimental result on various phases of MEMK PKC such as key generation, encryption, and decryption by varying the N-bit modulo bits from 1K to 10K.
52 citations
Cites background or methods from "Dual RSA and Its Security Analysis"
...Next, in Section 2, we make a related scheme such Std. RSA, ESRKGS, Dual RSA, Trivial RSA and N-prime RSA....
[...]
...Here we have analyzed the multi-key based cryptosystems with reuse of keys are as follows: ESRKG (Enhanced and Secured RSA based Key Generation) [3], Dual RSA [7], Trivial RSA [6], and N-prime RSA....
[...]
...Currently Public Key Cryptography (PKC) [5], [7], [10], [13], [17], [19] plays a vital role in several areas such as Banking, Online purchasing, E-mail, etc....
[...]
...Decryption: ( ) modDd eM C C n= C. Dual RSA Here the two communication parties will have the different private keys and moduli by sharing the same public exponent....
[...]
...Some of the recent variants of RSA-PKC’s are Std. RSA, ESRKGS, Dual RSA, and Trivial RSA....
[...]
TL;DR: A strong performance evaluation on standard RSA, Enhanced and Secured RSA Key Generation Scheme ( ESRKGS), and ENPKESS on its key generation, encryption and decryption by varying the N -bit moduli size up to 10K bits is shown.
49 citations
TL;DR: A new security algorithm using combination of both symmetric and asymmetric cryptographic techniques is proposed to provide high security with minimized key maintenance, and guarantees three cryptographic primitives, integrity, confidentiality and authentication.
47 citations
References
More filters
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Abstract: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret primer numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d ≡ 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n.
14,659 citations
Book•
01 Jan 1996TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Abstract: From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.
13,597 citations
8,006 citations
TL;DR: A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system.
Abstract: A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system. The technique does not require a universally trusted authority. One correspondent can remain anonymous to a second, while allowing the second to respond via an untraceable return address. The technique can also be used to form rosters of untraceable digital pseudonyms from selected applications. Applicants retain the exclusive ability to form digital signatures corresponding to their pseudonyms. Elections in which any interested party can verify that the ballots have been properly counted are possible if anonymously mailed ballots are signed with pseudonyms from a roster of registered voters. Another use allows an individual to correspond with a record-keeping organization under a unique pseudonym, which appears in a roster of acceptable clients.
4,075 citations
"Dual RSA and Its Security Analysis" refers result in this paper
...For the security consideration of Dual Generalized Rebalanced-RSA we first review the known results for Generalized Rebalanced-RSA and then present a new attack....
[...]
TL;DR: This paper presents a polynomial-time algorithm to solve the following problem: given a non-zeroPolynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q (X).
Abstract: In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q(X). It is well known that this is equivalent to factoring primitive polynomials feZ(X) into irreducible factors in Z(X). Here we call f~ Z(X) primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. (8). Its running time, measured in bit operations, is O(nl2+n9(log(fD3).
3,513 citations