Filters








4,290 Hits in 4.1 sec

Parallel Key Encryption for CBC And Interleaved CBC

S. Ashokkumar, K. Karuppasamy, Balaji Srinivasan, V. Balasubramanian
2010 International Journal of Computer Applications  
In theoretical analysis, it can be shown that remarkable reduction in encryption and decryption time of cryptographic systems is achieved and an enhanced strength to the system against brute force attacks  ...  Here, we extend the parallel key encryption algorithm and bring out its full potential by implementing the various cryptographic modes such as cipher block chaining and interleaved cipher block chaining  ...  The important types of attack on PCA can be categorized as follows: • Factorization Attack • Brute force attack Factorisation Attack: This is a type of attack where it tries to find the factors of a large  ... 
doi:10.5120/616-867 fatcat:qebns6qagrgj3n43erc66xxdye

Factoring as a Service [chapter]

Luke Valenta, Shaanan Cohney, Alex Liao, Joshua Fried, Satya Bodduluri, Nadia Heninger
2017 Lecture Notes in Computer Science  
Although a 512-bit RSA modulus was first factored in 1999, 512-bit RSA remains surprisingly common in practice across many cryptographic protocols.  ...  In this paper, we optimize the CADO-NFS and Msieve implementations of the number field sieve for use on the Amazon Elastic Compute Cloud platform, allowing a non-expert to factor 512-bit RSA public keys  ...  common key lengths and export RSA support.  ... 
doi:10.1007/978-3-662-54970-4_19 fatcat:qi3ebvym6vdqnb4zpq3tw4r2qq

Common modulus attacks on small private exponent RSA and some fast variants (in practice)

M. Jason Hinek, Charles C.Y. Lam
2010 Journal of Mathematical Cryptology  
In this work we re-examine two common modulus attacks on RSA. First, we show that Guo's continued fraction attack works much better in practice than previously expected.  ...  Given three instances of RSA with a common modulus N and private exponents each smaller than N 0.33 the attack can factor the modulus about 93% of the time in practice.  ...  Guo's Common Modulus Attack In [8] , Howgrave-Graham and Seifert describe an unpublished attack by Guo 1 on common modulus RSA with small private exponents.  ... 
doi:10.1515/jmc.2010.003 fatcat:lup4foearvebhc4cudvnxq3eiu

Another Look at Small RSA Exponents [chapter]

M. Jason Hinek
2006 Lecture Notes in Computer Science  
In this work we consider a variant of RSA whose public and private exponents can be chosen significantly smaller than in typical RSA.  ...  In particular, we show that it is possible to have private exponents smaller than N 1/4 which are resistant to all known small private exponent attacks.  ...  Attacking Common Prime RSA In this section we present all the attacks on common prime RSA that we have considered.  ... 
doi:10.1007/11605805_6 fatcat:lkuiuffvrvhozbqpoknlwwepie

Weaknesses in Current RSA Signature Schemes [chapter]

Juliane Krämer, Dmitry Nedospasov, Jean-Pierre Seifert
2012 Lecture Notes in Computer Science  
In the case of RSA CRT, the attacker must instead recover the full private key.  ...  The analysis was performed against our proof of concept (POC) implementation running on an Infineon smartcard system, which performed ZDN-based modular multiplication [7] .  ...  Acknowledgements This work was supported by the German Federal Ministry of Education and Research, and by the Helmholtz Research School on Security Technologies.  ... 
doi:10.1007/978-3-642-31912-9_11 fatcat:j3iqygyrivalrleogircnadzhq

Unbelievable Security Matching AES Security Using Public Key Systems [chapter]

Arjen K. Lenstra
2001 Lecture Notes in Computer Science  
Given a desired level of security for the AES, this paper discusses matching public key sizes for RSA and the ElGamal family of protocols.  ...  The author thanks Eric Verheul and Mike Wiener for their many insightful comments on earlier versions of this paper and Martijn Stam for his assistance with Figure 1 .  ...  Progress in factoring, i.e., cryptanalytic progress against RSA, is common. The past effects of improved factoring methods closely follow a Moore-type law [7] .  ... 
doi:10.1007/3-540-45682-1_5 fatcat:2uc5yj5upncjbol6clxsdsygsm

Low-Cost Client Puzzles Based on Modular Exponentiation [chapter]

Ghassan O. Karame, Srdjan Čapkun
2010 Lecture Notes in Computer Science  
We also discuss puzzle constructions based on CRT-RSA [11] .  ...  Client puzzles have been proposed as a useful mechanism for mitigating Denial of Service attacks on network protocols.  ...  Howgrave-Graham and Seifert's attack [30] combines Wiener's, Boneh's and Guo's attacks to factor N given r ≥ 2 instances of RSA with common modulus.  ... 
doi:10.1007/978-3-642-15497-3_41 fatcat:e4kbjklxkbeufirmqzwcdbhzs4

A Systematic Expository Review of Schmidt-Samoa Cryptosystem

Qasem Abu Al-Haija, Mohamad M.Asad, Ibrahim Marouf
2018 International Journal of Mathematical Sciences and Computing  
Schmidt-Samoa cryptosystem (SSC) is a public key cryptosystem, which depends on the difficulty of large integer factorization problem.  ...  According to the literature, the effective utilization and design SSC can place it as a viable alternative of RSA cryptosystems and many others.  ...  Most non-RSA public-key algorithms with practical relevance are based on another one-way function, the discrete logarithm problem [3] .  ... 
doi:10.5815/ijmsc.2018.02.02 fatcat:kgj2cgo7jfgsxd6e26xyc2rgly

An Efficient Method to Factorize the RSA Public Key Encryption

B.R. Ambedkar, Ashwani Gupta, Pratiksha Gautam, S.S. Bedi
2011 2011 International Conference on Communication Systems and Network Technologies  
The security of public key encryption such as RSA scheme relied on the integer factoring problem.  ...  The proposed work focuses on factorization of all trivial and nontrivial integer numbers and requires fewer steps for factorization process of RSA modulus N.  ...  Mathematical Attacks on RSA Mathematical attacks focus on attacking the underlying structure of RSA function. The first intuitive attack is the attempt to factor the modulus N.  ... 
doi:10.1109/csnt.2011.29 fatcat:vogxz35iu5h3ljth564sfd3k4e

Interface Design for Mapping a Variety of RSA Exponentiation Algorithms on a HW/SW Co-design Platform

Leif Uhsadel, Markus Ullrich, Ingrid Verbauwhede, Bart Preneel
2012 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors  
On the other hand, flexibility is required, because designers want to support a variety of RSA exponentiation algorithms.  ...  We use this interface to compare six different exponentiation variants of RSA with and without side-channel attack countermeasures.  ...  Applying the Chinese remainder theorem (CRT) to RSA is a common speed up technique. Instead of one exponentiation it does two exponentiations with half the parameter size.  ... 
doi:10.1109/asap.2012.11 dblp:conf/asap/UhsadelUVP12 fatcat:ewr2zvcacnggzp3pwwdgsvwwze

Parallel modular multiplication using 512-bit advanced vector instructions

Benjamin Buhrow, Barry Gilbert, Clifton Haider
2021 Journal of Cryptographic Engineering  
Finally, we show how interleaving Chinese remainder theorem-based RSA calculations within our parallel BPS technique halves decryption latency while providing protection against fault-injection attacks  ...  Our parallel-multiplication approach also allows for squaring and sub-quadratic Karatsuba enhancements.  ...  CRT-RSA implementation RSA decryption using the Chinese remainder theorem (CRT-RSA) provides a factor of 4 improvement in decryption speed, but is known to be vulnerable to fault-injection attacks [1]  ... 
doi:10.1007/s13389-021-00256-9 fatcat:bkwbyw2c6vfhlhkly3rtsi56ne

Breaking Ciphers with COPACOBANA –A Cost-Optimized Parallel Code Breaker [chapter]

Sandeep Kumar, Christof Paar, Jan Pelzl, Gerd Pfeiffer, Manfred Schimmler
2006 Lecture Notes in Computer Science  
The hardware can be used, e.g., to attack elliptic curve cryptosystems and to factor numbers.  ...  small bitlength to provide reliable security estimates of RSA and ECC by extrapolation 3 .  ...  Furthermore, we would like to thank Kerstin Lemke and Ahmad-Reza Sadeghi for interesting discussions on the security of machine readable travel documents.  ... 
doi:10.1007/11894063_9 fatcat:ijyulubiqvdqth5u4xoplyc7yy

Soccer Specific Fitness Differences Across the Common Playing Position Players

Belayneh Chekle, Tefera Tadesse
2019 International Journal of Physical Education Fitness and Sports  
The performance factors are varied and interrelated.  ...  The participant players speed, CODS and RSA were measured weekly for about five weeks. The authors analyzed the collected data using one-way ANOVA and Games-Howell multiple comparisons.  ...  Other findings on the matter also showed that sprinting speed is a great influencing factor for RSA best and RSA mean [17, 18] . Lopez-Segovia et al.  ... 
doi:10.26524/ijpefs1949 fatcat:6etwcartsjdbxhnxluf656nhy4

Mathematical Attack of RSA by Extending the Sum of Squares of Primes to Factorize a Semi-Prime

Anthony Overmars, Sitalakshmi Venkatraman
2020 Mathematical and Computational Applications  
The security of RSA relies on the computationally challenging factorization of RSA modulus with being a large semi-prime consisting of two primes for the generation of RSA keys in commonly adopted cryptosystems  ...  However, based on Pythagorean primes that are applied in RSA, the semi-prime has only two sums of two squares in the range of possible squares .  ...  Despite difficulty in breaking RSA keys (i.e. semi-prime factorization), cybercrimes and RSA key attacks are still on the rise [12] [13] [14] . A cryptanalytic attack of a short RSA key by M. J.  ... 
doi:10.3390/mca25040063 fatcat:go6vdxizvnbhdozlc5jvnyrldq

A lightweight and efficient Secure Hybrid RSA (SHRSA) messaging scheme with four-layered authentication stack

A. Bhattacharjya, X. Zhong, X. Li
2019 IEEE Access  
than main RSA.  ...  than CRT-RSA.  ...  Parallel protection to Sniffing attack. 7. Real-time key negotiation between each peer. This is totally different from Multi-prime RSA and Multi-factor RSA.  ... 
doi:10.1109/access.2019.2900300 fatcat:3pr4j5coevfhld35pv54iegjxu
« Previous Showing results 1 — 15 out of 4,290 results