{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

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

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:
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

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern