Affine based on Chinese Remainder Theorem
چهار سال پیش منتشر شده
تعداد بازدید: 381
کد پروژه: 295433
شرح پروژه
Given a secret message, decompose it to nonnegative integers less than n=p are coprime. Given a pair of (a,b) as an affine key 1 p 2 …p k where (c=a*p+b Mod n) you can encrypt each secret integer p to the crypto integer c. However, the key parameters have been stored in residue systems of Mod p i , and also c is stored in this form. Write a program that has 4 options on the main menu: Generate a set of coprime numbers and a key, then store them in a file called the key file. Encrypt a file: In this mode, a binary file and a key encrypted file will be stored. Decrypt a file: In th is mode, an encrypted file and a key the original file will be generated and stored.--file are given by the user and the file are given by the user and Discover the key: In this mode, the original file and its encrypted file are given by the user and the key file will be discovered and stored
این پروژه شامل 1 فایل مهم است، لطفا قبل از ارسال پیشنهاد حتما نسبت به بررسی این فایل اقدام فرمایید.
مهارت ها و تخصص های مورد نیاز
مهلت برای انجام
3روز
وضعیت مناقصه
بسته
درباره کارفرما
عضویت هشت سال پیش
