نتایج جستجو برای: decryption

تعداد نتایج: 3453  

2013
Neha Gupta

This paper is presenting cryptography model of block based cipher technique. This model is divided into two sub model one is encryption model and other is decryption model. Using encryption model, encrypt any type of data like text, image, pdf, audio. Using decryption model, decrypt same data. Due to the simplicity of the proposed model, it is very efficient. This model is also much secured due...

Journal: :International Journal of Research in Engineering and Technology 2015

Journal: :Journal of Computational Mathematica 2019

Journal: :Communications of the Korean Mathematical Society 2009

Journal: :International Journal for Research in Applied Science and Engineering Technology 2018

Journal: :International journal of advanced research 2021

To guard ourselves against a word attack or breach, it is always important to have an awareness of the unremarkably used sorts attacks. The most common type password guessing. Hackers can guess passwords locally remotely using either manually through automated approach. One such Dictionary Attack. A dictionary tries make authentication mechanism fail by sequentially entering each in as trying f...

2013
Subhranil Som Mandira Banerjee Poonam Garg Bethany Delman Melanie Mitchell

In this paper a new algorithm for encryption and decryption is introduced. The process of substitution and genetic function is the core of the proposed algorithm. In this encryption technique two keys are required for the encryption or decryption of a message. Input stream will be produced intermediate cipher text on which two stages of crossover will be used in the process of encryption and de...

Journal: :Inf. Process. Lett. 2003
Jonathan K. Millen

Journal: :Journal of Systems and Software 2009
Hung-Min Sun Mu-En Wu M. Jason Hinek Cheng-Ta Yang Vincent S. Tseng

In 1982, Quisquater and Couvreur proposed an RSA variant, called RSA-CRT, based on the Chinese Remainder Theorem to speed up RSA decryption. In 1990, Wiener suggested another RSA variant, called Rebalanced-RSA, which further speeds up RSA decryption by shifting decryption costs to encryption costs. However, this approach essentially maximizes the encryption time since the public exponent e is g...

2005
Hung-Min Sun M. Jason Hinek Mu-En Wu

In 1982, Quisquater & Couvreur proposed a variant of RSA based on the Chinese Remainder Theorem, called RSA-CRT, to speed up RSA decryption. In 1990, Wiener suggested another variant, called Rebalanced RSA-CRT, which further speeds up RSA decryption by shifting decryption costs to encryption costs. However, this approach essentially maximizes the encryption time since the public exponent e in R...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید