Click here to Skip to main content
15,881,172 members
Articles / Desktop Programming / MFC
Article

RSA encryption/decryption

Rate me:
Please Sign up or sign in to vote.
2.92/5 (40 votes)
5 May 20032 min read 284.4K   16.9K   41   29
Find a RSA implementation in VC++. Key size is 32-bit.

Introduction

Note: Please refer rsa.doc for more details on code and software. I can be contacted at bhaskar_bora@yahoo.com for further queries. Implementation includes private and public key (32-bit) generation and support of text file encryption and decryption. This document contains the algorithms and information required to design and implement RSA algorithm in VC++. This software is only for text data encryption and decryption. Document also contains the software usage guidelines and screen-shots.

Intro to RSA

RSA algorithm is mainly a public key encryption technique used widely in network communication like in Virtual Private Networks (VPNs). In public key encryption technique, a key is split into two keys and they are called as public and private keys. Public key is advertised to the world and private key is kept secret. It is not possible to generate private key using the public key. So, someone who knows the public key cannot decrypt a message after it has been encrypted using the public key.

RSA algorithm is a block cipher technique in which plain text and cipher text are integers between ‘0’ and ‘n-1’ from some ‘n’. In RSA algorithm encryption and decryption are of following form, for some plain text M and cipher text C:

C = M^e mod n

M = C^d mod n

Both sender and receiver must know the value of ‘n’. The sender knows the value of ‘e’ and only receiver knows the value of ‘d’. Thus, this is a public-key encryption algorithm with a public key of KU={e, n} and private key of KR={d, n}. For the algorithm to be satisfactory for public-key encryption, the following requirement must be met

  1. It is possible to find values of e, d, n such that M^ed = M mod n for all M<n.
  2. It is relatively easy to calculate M^e and C^d for all values of M<n.
  3. It is infeasible to determine d given e and n.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


Written By
Web Developer
India India
Working with EMC Corp, Bangalore (India) in distributed embedded software design. Like to read and code in storage, computer security and language design areas.

Comments and Discussions

 
GeneralRe: 32 Bits!!! Pin
Kastellanos Nikos6-May-03 6:19
Kastellanos Nikos6-May-03 6:19 
GeneralRe: 32 Bits!!! Pin
Antony M Kancidrowski12-May-03 23:25
Antony M Kancidrowski12-May-03 23:25 
GeneralRe: 32 Bits!!! Pin
Shivian14-Jul-08 15:26
Shivian14-Jul-08 15:26 
GeneralRe: 32 Bits!!! Pin
BhaskarBora21-May-03 22:13
BhaskarBora21-May-03 22:13 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.