Filters








2,972 Hits in 5.8 sec

A Generalized Attack on Some Variants of the RSA Cryptosystem [chapter]

Abderrahmane Nitaj, Yanbin Pan, Joseph Tonien
2019 Lecture Notes in Computer Science  
Similarly, some variants of RSA, such as RSA combined with singular elliptic curves, LUC and RSA with Gaussian primes can be attacked by using the key equation ed−k p 2 − 1 q 2 − 1 = 1.  ...  In this paper, we consider the more general equation eu− p 2 − 1 q 2 − 1 v = w and present a new attack that finds the prime factors p and q in the case that u, v and w satisfy some specific conditions  ...  The latter equation is the key equation of some variants of the RSA cryptosystem with modulus N = pq, public exponent e and private key d.  ... 
doi:10.1007/978-3-030-10970-7_19 fatcat:m52oqg5hcng6blfd3w7pruupyi

RSA-type Algebra Structures

2016 KSII Transactions on Internet and Information Systems  
The usefulness of the proposed structure is then proved by showing that, following the structure we can construct a RSA variant based on the Bergman ring.  ...  RSA is a public key cryptosystem that is currently the most popularly used in information security.  ...  A new variant of RSA: probability RSA Based on the proposed scheme, we developed a Bergman ring based cryptosystem analogue of RSA. We briefly describe this cryptosystem as follows.  ... 
doi:10.3837/tiis.2016.06.021 fatcat:v4jdfx7dqvc5hlgulzpgqbhfmy

An Efficient RSA Cryptosystem with BM-PRIME Method

Sushma Pradhan, Birendra Kumar Sharma
2012 International Journal of Information and Network Security (IJINS)  
With this idea, we present an efficient combination of two variants of RSA cryptosystem (Batch and Mprime RSA) which makes the decryption process faster than the existing variants.  ...  It can not only speed up RSA decryption but also guarantee the security of RSA cryptosystem. Keyword: RSA Cryptosystem Mprime RSA Batch RSA QC-RSA CRT  ...  In section 4, we introduce our proposed scheme (BM-Prime RSA) and in section 5, with analysis of some possible attacks related to our proposed cryptosystem.  ... 
doi:10.11591/ijins.v2i1.1718 fatcat:psuflzadube3vh236c5lw6nbbu

CRYPTANALYSIS OF RSA KEY EQUATION OF N=p^2q FOR SMALL |2q – p| USING CONTINUED FRACTION

Muhammad Asyraf Asbullah, Normahirah Nek Abd Rahman, uhammad Rezal Kamel Ariffin, Siti Hasana Sapar, Faridah Yunos
2020 Malaysian Journal of Science  
This paper presents a new factoring technique on the modulus = 2 , where and are large prime numbers.  ...  Suppose there exists an integer satisfies the equation − ( ) = 1, for some unknown integer , and ( ) is the Euler's totient function.  ...  Motivated from de Weger's generalization attack (de Weger, 2002) and Maitra and Sarkar's attack (Maitra and Sarkar, 2010), a new attack on RSA-type modulus = 2 (Asbullah & Ariffin, 2015) was proposed  ... 
doi:10.22452/mjs.vol39no1.6 fatcat:ywqwxnj3lbh3rg3oakfefzmjpy

A generalized attack on RSA type cryptosystems

Martin Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
2017 Theoretical Computer Science  
Some variants of the RSA cryptosystem, such as LUC, RSA with Gaussian primes and RSA type schemes based on singular elliptic curves use a public key e and a private key d satisfying an equation of the  ...  The attack combines the continued fraction algorithm and Coppersmith's technique and can be seen as a generalization of the attacks of Wiener and Blömer-May on RSA.  ...  Conclusion In this paper, we considered some variants of the RSA cryptosystem that use a modulus N = pq and a public exponent d satisfying gcd e, p 2 − 1 q 2 − 1 .  ... 
doi:10.1016/j.tcs.2017.09.009 fatcat:r53nu7c2fzgipknhea4qmybdvy

Efficient variant of RSA cryptosystem

Yun-fei LI, Qing LIU, Lin HAO, Bao-lin ZHOU
2010 Journal of Computer Applications  
We describe an efficient combination of two variants of RSA cryptosystem (MPrime and Rebalanced RSA) analysed by Boneh and Schacham [2] .  ...  RSA Cryptosystem Before we present the proposals to optimize the RSA cryptosystem, we review the three basic algorithms that constitute the RSA, together with one frequently used optimization technique  ...  Acknowledgements We would like to thank Paulo Barreto and Leon Achjian Jr for their comments and support during the development of this work.  ... 
doi:10.3724/sp.j.1087.2010.02393 fatcat:hpeqcbbga5dvlcsemkmp7ykewy

Improvement over Public Key Cryptographic Algorithm

Deepak Garg, Seema Verma
2009 2009 IEEE International Advance Computing Conference  
Here in this paper our main motive is to improve the In this paper, we have introduced RSA cryptosystem and its efficiency of RSA cryptosystem. The first section of the improvements.  ...  Tabular and graphical comparison with other variants of keys and the use of up-to-date implementations; RSA is RSA is also shown in the paper. believed to be totally secure.  ...  Since modular exponentiation takes time linear in scheme is required. 2.3 Attacks on RSA Encryption of RSA Some of the attacks on RSA cryptosystem are Sender A does the following:- discussed here:  ... 
doi:10.1109/iadcc.2009.4809104 fatcat:c4eahhg4qbe6fest764flwtfji

Rabin-p Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme [article]

Muhammad Asyraf Asbullah, Muhammad Rezal Kamel Ariffin
2014 arXiv   pre-print
We demonstrate that the decryption is unique and proven to be equivalent to factoring.The scheme is performs better when compared to a number of Rabin cryptosystem variants.  ...  In this work, we introduce a new, efficient and practical scheme based on the Rabin cryptosystem without using the Jacobi symbol, message redundancy technique or the needs of extra bits in order to specify  ...  In 1979, one year after the invention of RSA cryptosystem, Michael O.  ... 
arXiv:1411.4398v1 fatcat:yjthbsussbcs5ervndfme3wtxm

Fast RSA-type cryptosystem modulo p k q [chapter]

Tsuyoshi Takagi
1998 Lecture Notes in Computer Science  
We propose a cryptosystem modulo pkq based on the RSA cryptosystem.  ...  68-bit modulus p2q 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.  ...  I would also like to thank the anonymous referees for their valuable comments.  ... 
doi:10.1007/bfb0055738 fatcat:u3nisbrleja4djy3i3zq7opjey

Privacy-Preserving RFID Authentication Using Public Exponent Three RSA Algorithm

Yoonjeong KIM, SeongYong OHM, Kang YI
2009 IEICE transactions on information and systems  
is greater than one-sixth of the whole message length.  ...  In this letter, we propose a privacy-preserving authentication protocol with RSA cryptosystem in an RFID environment.  ...  Acknowledgement This research is supported by Foundation of ubiquitous computing and networking (UCN) Project, the Ministry of Knowledge Economy (MKE) 21st Century Frontier R&D Program in Korea.  ... 
doi:10.1587/transinf.e92.d.545 fatcat:zvwxjmbcnbartgf5puzffknrhi

A New Attack on Three Variants of the RSA Cryptosystem [chapter]

Martin Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
2016 Lecture Notes in Computer Science  
Our attack can be considered as an extension of the famous Wiener attack on the RSA.  ...  Our attack can be considered as an extension of the famous Wiener attack on the RSA. Abstract.  ...  A New Attack on RSA Variants Based on Continued Fractions In this section, we propose a new attack on the Kuwakado-Koyama-Tsuruoka cryptosystem as well as RSA over the Gaussian integer domain and the Castagnos  ... 
doi:10.1007/978-3-319-40367-0_16 fatcat:tci2vx2qkbcuxbnaryfvqfzc2u

Traitor tracing schemes for protected software implementations

Marc Joye, Tancrède Lepoint
2011 Proceedings of the 11th annual ACM workshop on Digital rights management - DRM '11  
This paper considers the problem of converting an encryption scheme into a scheme in which there is one encryption process but several decryption processes.  ...  So, when some digital content is encrypted, a legitimate user can recover the content in clear using its own private software implementation.  ...  The Cramer-Shoup cryptosystem makes use of a universal one-way hash function H : {0, 1} * → Zq [29] . Let g and h be two random generators of G.  ... 
doi:10.1145/2046631.2046636 dblp:conf/drm/JoyeL11 fatcat:q7vdsdok2vemjfqtzkalz5temm

A Public-Key Cryptosystem Scheme on Conic Curves Over Zn

Zhi-Gang Chen, Xin-Xia Song
2007 2007 International Conference on Machine Learning and Cybernetics  
Its security bases on the difficulty of factoring a composite number n, just like RSA. It can resist some of the known attacks on RSA.  ...  A public key cryptosystem scheme is proposed that are based on conic curves over the ring Z n .  ...  It can resist some of the known attacks on RSA.  ... 
doi:10.1109/icmlc.2007.4370507 fatcat:mp6gixjcxbaynaxxz2m7cus5ai

Improved Semantically Secured Variant of RSA Public Key Cryptosystem

Sushma Pradhan, Birendra Kumar Sharma
2015 International Journal of Informatics and Communication Technology (IJ-ICT)  
<p>Boneh and Shacham gave a nice survey on four variants (Batch RSA, Multi-Prime RSA, Multi-Power RSA, and Rebalanced RSA).  ...  Batch RSA and Multi-Prime RSA were then combined to increase the decryption/signature generation performance.  ...  Several variants have been developed to enhance the property of RSA cryptosystem.  ... 
doi:10.11591/ijict.v4i3.pp91-97 fatcat:yotvsi2ivfaspdrsln4k3z4rtu

Survey on Symmetric and Asymmetric Key Cryptosystems

Srinivas Madhira, Porika Sammulal
2014 IOSR Journal of Computer Engineering  
Some of these techniques have become popular and widely in use today in a varieties of applications.  ...  This paper discusses the two most important categories of techniques symmetric and asymmetric cryptosystems.  ...  In public key cryptosystems each participant generates a pair of keys, distributes one of the keys to the public and keeps other key secretly with him.  ... 
doi:10.9790/0661-16431118 fatcat:rl3mmtxoavctbb3sjzs6jkerny
« Previous Showing results 1 — 15 out of 2,972 results