For this homework, you may use the Cryto++ package or the OpenSSL package.

**1. Primality (10 pts)**

1) Estimate how many 768-bit prime numbers are there?

2) Generate 10 distinct 768-bit prime numbers and measure their generation time.

**2. RSA Throughput (15 pts)**

Test the throughput performance of RSA, both encryption (using e) and decryption (using d), for following parameters:

- n: 768 bits, e = 65537
- n: 1024 bits, e = 5

In the measurements, you should exclude disk I/O time, i.e., you only measure data that is already in memory.

Subject | Computer |

Due By (Pacific Time) | 10/19/2014 12:00 am |

Tutor | Rating |
---|---|

pallavi Chat Now! |
out of 1971 reviews More.. |

amosmm Chat Now! |
out of 766 reviews More.. |

PhyzKyd Chat Now! |
out of 1164 reviews More.. |

rajdeep77 Chat Now! |
out of 721 reviews More.. |

sctys Chat Now! |
out of 1600 reviews More.. |

sharadgreen Chat Now! |
out of 770 reviews More.. |

topnotcher Chat Now! |
out of 766 reviews More.. |

XXXIAO Chat Now! |
out of 680 reviews More.. |