RSA Public Key Cryptosystem using Modular Multiplication

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Modular Multiplication Method in Public Key Cryptosystem

Modular multiplication is an important operation in several public key cryptosystems. This paper brings a novel idea based on the idea in the exponentiation computation. In this paper a new algorithm for modular multiplication for public key cryptosystem is presented. This proposed method is based on the following two ideas.(i) The remainder in regard to n can be constructed from the remainder ...

متن کامل

Generalizations of RSA Public Key Cryptosystem

In this paper, for given N = pq with p and q different odd primes, and m = 1, 2, · · · , we give a public key cryptosystem. When m = 1 the system is just the famous RSA system. And when m ≥ 2, the system is usually more secure than the one with m = 1.

متن کامل

Public Key Cryptography and the RSA Cryptosystem

Cryptography, or cryptology, is a subject that is concerned with privacy or confidentiality of communication over insecure channels, in the presence of adversaries. It seeks to find ways to encrypt messages so that even if an unauthorized party gets a hold of a message, they cannot make sense out of it. The ways to break encryption systems, called cryptanalysis, is also part of the subject. Cry...

متن کامل

Implementation of the RSA Public - Key Cryptosystem

The history of secret messages, cryptosystems, codes and codecracking is as old as the history of man. In this article, we will deal with the cryptosystem proposed by Rivest, Shamir and Adleman in 1977, see [3]. It has two characteristics which distinguish it from most other encryption methods: The usage of Number Theory and the fact that the process of deciphering is not just opposite to the o...

متن کامل

High-Speed Modular Multiplication Algorithm for RSA Cryptosystem

Both encryption and decryption are modular exponentiation. Therefore, the fast modular exponentiation algorithm is required. For most hardware implementation, the simple square and multiply algorithm, often called binary method, is assumed to be the most effective because of the simple hardware structure and repetitive control. In the RL (Right-to-Left) binary method, n iterations are needed an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2013

ISSN: 0975-8887

DOI: 10.5120/13860-1707