dsa4 - 1. Merge Sort 2. Binary leaves 3. Binary Search 4....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 Rivest Shamir Adlemani-Diffie Hellman Two large prime numbers G p,q N=p*q e relatively prime to (p-1)(q-1) x^e mod N-modexp function Decode this message: d=e^-1 mod (p-1)(q-1) p=5, q=11}e=3 5^-1 mod 72 5x+by=1 mod 72 Divide and Conquer:
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1. Merge Sort 2. Binary leaves 3. Binary Search 4. Insertion sort merge(A, B) if ai<bj { outpput a i++ } else { output b j++ } A is a n bit number ai is a n-bit number B is a n-bit number A=1011 0111 A*B=(ai*2^(n/2)+ar)...
View Full Document

This note was uploaded on 09/20/2011 for the course ECON 1110 taught by Professor Person during the Spring '11 term at Rensselaer Polytechnic Institute.

Ask a homework question - tutors are online