252 Hits in 3.7 sec

Design and implementation proposed system for encryption true images

Asst. Prof. Dr.Baheja K.Shukur
2013 IOSR Journal of Engineering  
between key generator and resulting binary cipher bits ,which made the ciphers are more complex, the key is said to be well designed and its size provides an upper bound of an algorithm's cryptographic  ...  Keyword: linear feedback shift register, RSA, symmetric cipher, asymmetric cipher. I.  ...  The dynamic of this generator are: If more than half the output 1, then the output of the generator 1 Otherwise 0.  ... 
doi:10.9790/3021-031011627 fatcat:yej2z4ltmbghxev7wnpata6jju

Utilizing the Double-Precision Floating-Point Computing Power of GPUs for RSA Acceleration

Jiankuo Dong, Fangyu Zheng, Wuqiong Pan, Jingqiang Lin, Jiwu Jing, Yuan Zhao
2017 Security and Communication Networks  
The RSA-4096 decryption precedes the existing fastest integer-based result by 23%.  ...  The performance of RSA-2048/3072/4096 decryption on NVIDIA GeForce GTX TITAN reaches 42,211/12,151/5,790 operations per second, respectively, which achieves 13 times the performance of the previous fastest  ...  , 1/2 for the half bits of the exponent).  ... 
doi:10.1155/2017/3508786 fatcat:cny7fvjaffch5bc2mi7zyv7j6a

The Dark Side of "Black-Box" Cryptography or: Should We Trust Capstone? [chapter]

Adam Young, Moti Yung
1996 Lecture Notes in Computer Science  
We also show how the SETUP can, in fact, be employed for the design of "aubo-escrowing key" systems. We present embeddings of S E l U P s in RSA, El-Gamal, DSA, and private key systems (Kerberos).  ...  We implemented an RSA key-generation based SETUP that performs favorably when compared to PGP, a readily available RSA implementation.  ...  Acknowledgements: W e would like to acknowledge I h e liclp of M a t t Hastings for refining some of the attacks described  ... 
doi:10.1007/3-540-68697-5_8 fatcat:ppsohd345jec3etixujlwkrnjq

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  ...  In addition, we show $$1.4\,\times $$ 1.4 × improvement in decryption throughput in comparison with state-of-the-art vector implementations on many-core Knights Landing Xeon Phi hardware.  ...  The second nested loop of Algorithm 3 completes the upper-half calculations of T and U · M while dividing by R (by storing the output into location C[i − t]).  ... 
doi:10.1007/s13389-021-00256-9 fatcat:bkwbyw2c6vfhlhkly3rtsi56ne

A Generalized Wiener Attack on RSA [chapter]

Johannes Blömer, Alexander May
2004 Lecture Notes in Computer Science  
We present an extension of Wiener's attack on small RSA secret decryption exponents [10] .  ...  As an application of our new attack, we present the cryptanalysis of an RSA-type scheme presented by Yen, Kim, Lim and Moon [11, 12] .  ...  /decryption performance.  ... 
doi:10.1007/978-3-540-24632-9_1 fatcat:yjlzjmxmhnespheolcrujt6iwe

Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries [chapter]

Pascal Paillier, David Pointcheval
1999 Lecture Notes in Computer Science  
We make use of specific techniques that differ from Bellare-Rogaway or Fujisaki-Okamoto conversion methods.  ...  Our second scheme is specifically designed to be efficient for decryption and could provide an elegant alternative to OAEP.  ...  decisional version of the D-RSA Problem is intractable.  ... 
doi:10.1007/978-3-540-48000-6_14 fatcat:tjjcyqmjp5ev7losk62imesqmq

Chip-to-Chip Authentication Method Based on SRAM PUF and Public Key Cryptography

Ioannis Karageorgos, Mehmet M. Isgenc, Samuel Pagliarini, Larry Pileggi
2019 Journal of Hardware and Systems Security  
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.  ...  Split-Chip is a dual-IC approach that leverages the performance of an untrusted IC and combines it with the guaranties of a trusted IC.  ...  As mentioned in Section 3.2, the RSA key pair is based on two prime numbers and the public exponent.  ... 
doi:10.1007/s41635-019-00080-y fatcat:spa3vp3q2zhjpfnk3qirks2x24

Building Blocks of the Security and Management Engine [chapter]

Xiaoyu Ruan
2014 Platform Embedded Security Technology Revealed  
It is published and available to anyone who wishes to send encrypted messages to the decrypter. The private key is known to only the decrypter and it must be kept secret.  ...  RSA stands for the last names of Ron Rivest, Adi Shamir, and Leonard Adleman-the three cryptographers who first invented and published the algorithm back in 1977.  ... 
doi:10.1007/978-1-4302-6572-6_3 fatcat:lf77lgr2rvhonijo2unlhtdohu

On the Importance of Eliminating Errors in Cryptographic Computations

Dan Boneh, Richard A. DeMillo, Richard J. Lipton
2000 Journal of Cryptology  
We present the following results: (1) The secret signing key used in an implementation of RSA based on the Chinese Remainder Theorem (CRT) is completely exposed from a single erroneous RSA signature, (  ...  2) for non-CRT implementations of RSA the secret key is exposed given a large number (e.g. 1000) of erroneous signatures, (3) the secret key used in Fiat-Shamir identification is exposed after a small  ...  of the decryption exponent d.2.There is a uniform polynomial time (in n and 2 m ) algorithm for factoring N .Proof.We show an algorithm that factors all RSA moduli N for which part 1 is false.  ... 
doi:10.1007/s001450010016 fatcat:6aa4e4abtfftbphbsd4ehkjucu

Secure mobile subscription of sensor-encrypted data

Cheng-Kang Chu, Wen Tao Zhu, Sherman S. M. Chow, Jianying Zhou, Robert H. Deng
2011 Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security - ASIACCS '11  
In SMS-SED, a node or a mobile device stores a secret key of size independent of the total number of sensor nodes and time periods.  ...  a subscriber can use a mobile device in the deployment field to decrypt the sensed data encrypted by the more resource-constrained sensor nodes.  ...  Publish e as the encryption exponent, and keep d as the (secret) decryption exponent. For any integer x ∈ ZN , its encrypted form is y = x e mod N .  ... 
doi:10.1145/1966913.1966943 dblp:conf/ccs/ChuZCZD11 fatcat:xpfyuapdvrfhlbm2bu4qgjrl2i

Towards Signature-Only Signature Schemes [chapter]

Adam Young, Moti Yung
2000 Lecture Notes in Computer Science  
The security of our scheme is based on RSA. We then argue how the scheme's key cannot be abused (statically) based on an additional assumption.  ...  for signature verification only (if it is used for encryptions, then the authorities can decrypt the data).  ...  The CA then sets z to be the upper half of the bit representation of v 1 . The CA computes n, g , g , g, and the g i 's in the same way as the user.  ... 
doi:10.1007/3-540-44448-3_9 fatcat:zalnz4xguzayhmfsjzo4x5epky

Improving Brumley and Boneh timing attack on unprotected SSL implementations

Onur Aciiçmez, Werner Schindler, Çetin K. Koç
2005 Proceedings of the 12th ACM conference on Computer and communications security - CCS '05  
the prime factors of RSA moduli.  ...  Since the remarkable work of Kocher [7], several papers considering different types of timing attacks have been published.  ...  In fact, it is sufficient to recover only the upper half of the bit representation of either p or q to factorize n by applying a lattice-based algorithm [4] .  ... 
doi:10.1145/1102120.1102140 dblp:conf/ccs/AciicmezSK05 fatcat:t2mj5vnm7rhl7jmvqmcft5vpey

The Two Faces of Lattices in Cryptology [chapter]

Phong Q. Nguyen
2001 Lecture Notes in Computer Science  
We survey the main examples of the two faces of lattices in cryptology.  ...  Paradoxically, several positive cryptographic applications of lattices have emerged in the past ve years: there now exist public-key cryptosystems based on the hardness of lattice problems, and lattices  ...  The integer d is the private key, and is called the RSA secret exponent. The public exponent is the inverse e of d modulo (N). Lattice attacks on RSA encryption Small public exponent.  ... 
doi:10.1007/3-540-45537-x_24 fatcat:6gnzxzvjuvftvov3quwup6dg2e

Adaptively secure distributed public-key systems

Yair Frankel, Philip MacKenzie, Moti Yung
2002 Theoretical Computer Science  
one time, but no upper bound on the number of servers it may corrupt over the lifetime of the system.  ...  We also extend the discrete-log-based systems to have proactive security, that is, security against an (adaptive) mobile adversary that has an upper bound on the number of servers it may corrupt at any  ...  (An example of this type of protocol for RSA signature and decryption functions is given in Frankel et al. [20] .)  ... 
doi:10.1016/s0304-3975(01)00260-2 fatcat:gc2z7ji6gzbkdkf76wfhkwmoiy

A Commitment-Consistent Proof of a Shuffle [chapter]

Douglas Wikström
2009 Lecture Notes in Computer Science  
of this paper was presented at ACISP 2009.  ...  We prove our result for a general class of shuffle maps that generalize all known types of shuffles, and even allows shuffling ciphertexts of different cryptosystems in parallel. * A conference version  ...  κ is an upper bound on the orders of g and g i .  ... 
doi:10.1007/978-3-642-02620-1_28 fatcat:tofprrjmizamznrkwfztiiq5ii
« Previous Showing results 1 — 15 out of 252 results