1. We have moved from vBulletin to XenForo and you are viewing the site in the middle of the move. Though the functional aspect of everything is working fine, we are still working on other changes including the new design on Xenforo.
    Dismiss Notice

rsa description

Discussion in 'Engineering Concepts' started by mayam, Apr 1, 2010.

  1. mayam

    mayam New Member

    Joined:
    Apr 1, 2010
    Messages:
    2
    Likes Received:
    0
    Trophy Points:
    0
    [noparse]rsa algorithm description:select p,q ; p,q must both be prime numbers
    calculate n=p*q
    calculte c(n)=(p-1)*(q-1)
    select integer e such that gcd(c(n),e)=1;1<e<c(n)
    calculate d ;d*e*modc(n)=1
    public key ku={e,n}
    private key kr={d,n}
    encryption:plain text =m<n
    cipher text :c=M^e *(modn)
    decryption
    cipher text =c
    plain text : M=c^d*(modn )
    EX:n=3*7=21
    c(n)=(2)(6)
    e=gcd(12,5)=1
    therefore e=5
    d =5*5mod12=1
    25mod12=1
    therefore d=5
    then continue with plain text and cipher text.hope its understandable[/noparse]
     

Share This Page