2,607 Hits in 4.0 sec

Reconstructing RSA Private Keys from Random Key Bits [chapter]

Nadia Heninger, Hovav Shacham
2009 Lecture Notes in Computer Science  
We show that an RSA private key with small public exponent can be efficiently recovered given a 0.27 fraction of its bits at random.  ...  We make new observations about the structure of RSA keys that allow our algorithm to make use of the redundant information in the typical storage format of an RSA private key.  ...  Ten Reasons why a Paper is Rejected from a Crypto Conference In this paper, we present a new algorithm for the problem of reconstructing RSA private keys given a random δ-fraction of their bits.  ... 
doi:10.1007/978-3-642-03356-8_1 fatcat:6eixuruyvzcgfmhluq3a7rmag4

Further Simplifications in Proactive RSA Signatures [chapter]

Stanisław Jarecki, Nitesh Saxena
2005 Lecture Notes in Computer Science  
The new scheme is conceptually simple because all the sharing and proactive re-sharing of the RSA secret key is done modulo a prime, while the reconstruction of the RSA signature employs an observation  ...  that the secret can be recovered from such sharing using a simple equation over the integers.  ...  hidden from all players because it allows immediate computation of the private key d from the RSA public exponent e.  ... 
doi:10.1007/978-3-540-30576-7_28 fatcat:cthznnve4jbwriii5e7d25h3da

Asymmetric Public Key Cryptography by Using Logic-based Optical Processing

Sang Keun Gil
2016 Journal of the Optical Society of Korea  
In this paper, a new asymmetric public key cryptography based on the modified RSA algorithm is proposed by using logic-based optical processing.  ...  This can provide longer 2-D key length resulting in a higher security cryptosystem than the conventional 1-D key length cryptosystem.  ...  To do this, they will agree upon and set up a random public-private key for their cryptosystem. RSA involves a public key and a private key.  ... 
doi:10.3807/josk.2016.20.1.055 fatcat:nu6bkmtetvb7jhxs7lx2mlmgza

The Comparative Study on Public Key Algorithm using RSA AND OAEP

E. Vinithra
2016 International Journal Of Engineering And Computer Science  
The core idea is enhance the security of RSA algorithm. In this dissertation public key algorithm RSA and enhanced RSA are compared analysis is made on time based on execution time.  ...  Cryptography is a first abstraction to separate specific algorithms from generic cryptographic processes in order to eliminate compatibility and upgradeability problems.  ...  Using partial information about the private key d. Given the dlog2 n/4e least significant bits of the private exponent d, it is possible to reconstruct all of d if e < p n .  ... 
doi:10.18535/ijecs/v5i9.48 fatcat:2rzvjht65nc4nixafvgxeg5ima

The BlueJay Ultra-Lightweight Hybrid Cryptosystem

Markku-Juhani O. Saarinen
2012 2012 IEEE Symposium on Security and Privacy Workshops  
The private key operation (not performed by the light-weight device but by the sensor network base station or a data acquisition reader) has roughly the same complexity as the RSA private key operation  ...  An inexpensive, milliscale MCU SoC BlueJay implementation is reported and compared to RSA-AES on the same platform.  ...  The decryption (private key) operation is roughly as demanding as the private key operation of the RSA algorithm. A.  ... 
doi:10.1109/spw.2012.11 dblp:conf/sp/Saarinen12 fatcat:xwgypkwmpnev5boopfwd7ri23e

Finding the Optimal Value for Threshold Cryptography on Cloud Computing

Weena Janratchakool, Sirapat Boonkrong, Sucha Smanchat
2016 International Journal of Electrical and Computer Engineering (IJECE)  
Threshold cryptography works by dividing the private key to a number of shares, according to the number of virtual machines, then distributing them each share to each virtual machine.  ...  In order to generate the key back, not all the shares are needed. Howerver, the problem is that there has been no research attemping to find a suitable threshold value for key reconstruction.  ...  She received M.Sc. in Information Technology from KMUTNB.  ... 
doi:10.11591/ijece.v6i6.11573 fatcat:gxrxdefptrbwrmi4uz77fqroae

A Homomorphic Method for Sharing Secret Images [chapter]

Naveed Islam, William Puech, Robert Brouzet
2009 Lecture Notes in Computer Science  
In this paper, we present a new method for sharing images between two parties exploiting homomorphic property of public key cryptosystem.  ...  Indeed, extraction and reconstruction of original image at the receiving end is done with the help of carrier image.  ...  Since RSA public-key cryptosystem is not random in nature, so it give same results for the same values of the inputs.  ... 
doi:10.1007/978-3-642-03688-0_13 fatcat:ulcuhnunvffj3o2p75gvhkf2pa

A Novel Approach For Verifiable Secret Sharing In Proactive Network Using Rsa

Vikas Kumar, Prof. O.P. Verma, Deepak Kumar, Sandeep Jain
2017 Zenodo  
bit RSA Keys The RSA algorithm is an asymmetric key cipher using a "public key" and a "private key".  ...  The size of the Modulus in bits is referred to as the "key size". A Modulus of size 128 bytes represents a "1024 bit RSA key".  ... 
doi:10.5281/zenodo.581480 fatcat:fxelltio7zgtvfprmque3skvka

A New Quantum Encryption Scheme

Mihail-Iulian Plesa, Togan Mihai
2018 Advanced Journal of Graduate Research  
In this paper we propose a new quantum cryptographic scheme which aims to replace the RSA algorithm from current public key infrastructures.  ...  This means that the public key infrastructure will soon be obsolete.  ...  In the known context of the RSA algorithm, we note with ( , ) the pair of public and private key of Alice and with ( , ) the public and private key owned by Bob.  ... 
doi:10.21467/ajgr.4.1.59-67 fatcat:t26mheikynbabgo5nazv5ypsda

Small Prime Divisors Attack and Countermeasure against the RSA-OTP Algorithm

Szymon Sarna, Robert Czerwinski
2021 Electronics  
A paradigm shift from constant to one-time keys could introduce tangible benefits to the application security field.  ...  However, many such solutions use a constant secret key to encrypt (process) one-time plaintexts.  ...  To generate a private and public key pair, two large prime numbers p and q are randomly chosen.  ... 
doi:10.3390/electronics11010095 fatcat:nwyfj4pm5jdm5a5vo7bkevyd5q

Design and Analysis of DNA Encryption and Decryption Technique based on Asymmetric Cryptography System

Hassan Al-Mahdi, Meshrif Alruily, Osama R.Shahin, Khalid Alkhaldi
2019 International Journal of Advanced Computer Science and Applications  
The basic idea is to create a dynamic DNA table based on the plaintext, using multi-level security, data dependency and generating 14 dynamic round keys.  ...  The evaluation process proves that the proposed technique outperforms the RSA algorithm in terms of avalanche property.  ...  II DYNAMIC DNA SEQUENCE TABLE. 14 round keys based on public key and PT. If a DDST table can be detected from the PST table, it has poor randomization.  ... 
doi:10.14569/ijacsa.2019.0100264 fatcat:jvv6nederbhxhpb27wrlqeit2m

Securing Criminal Records using R-Pi, QR code and Steganography

key using RSA algorithm and then sends it to the desired end.  ...  Using steganography it is possible to provide security for the information which is communicated over the internet from one crime branch to the other.  ...  a RSA private key except if he can factor n.  ... 
doi:10.35940/ijitee.f3656.049620 fatcat:tbmzfwpjorevfat623tgmejajm

Hidden in snow, revealed in thaw: Cold boot attacks revisited [article]

Jos Wetzels
2014 arXiv   pre-print
The problem is cast as a Boolean satisfiability problem linking the bits of the private to the public RSA key, filling in the bits known through partial key exposure.  ...  As a secure side-effect of its implementation PRIME complicates potential RSA key reconstruction by not encoding its private keys in the fashion described in section 2.4.  ... 
arXiv:1408.0725v1 fatcat:gmgg3eafjjda5e2mttpupdsoqm

A Combination of Inverted LSB, RSA, and Arnold Transformation to get Secure and Imperceptible Image Steganography

Edi Jaya Kusuma, Christy Atika Sari, Eko Hari Rachmawanto, De Rosal Ignatius Moses Setiadi
2018 Journal of ICT Research and Applications  
Furthermore, this paper also proposes combing ACM with RSA and subsequently embedding the result in a cover image with inverted two-bit LSB steganography, which replaces two bits in the bit plane of the  ...  cover image with message bits.  ...  Divide the result from the previous step into 16 bits per pixel, then convert into a decimal value. 5. Input the private key for the decryption process. 6.  ... 
doi:10.5614/itbj.ict.res.appl.2018.12.2.1 fatcat:r5bugoyujfg3fo5qnqasbmnnfa

A New LSB Attack on Special-Structured RSA Primes

Amir Hamzah Abd Ghafar, Muhammad Rezal Kamel Ariffin, Muhammad Asyraf Asbullah
2020 Symmetry  
The Rivest–Shamir–Adleman (RSA) cryptosystem is highly regarded as one of the most deployed public-key cryptosystem today.  ...  of RSA.  ...  Heninger and Shacham's attack is motivated by the so-called cold boot attack which targets the memory in electronic chips to reconstruct the bits of the private keys given that the bits are from random  ... 
doi:10.3390/sym12050838 fatcat:ak6l73bh2rdzrefaz6sc6guvpm
« Previous Showing results 1 — 15 out of 2,607 results