CryptographyCode
$30-250 SGD
Płatność przy odbiorze
In Cryptography, to analyse the strength of certain cryptography functions, it is customary to consider a hypothetical 'oracle' which may perform certain tasks when queried. Such oracle is assumed to have its procession certain secrets, such as the encryption/decryption key, and the task of the attack can be to figure one or more secrets, or forge certain messages (MAC or digital signatures) by interacting with the oracle. For example, an 'encryption oracle' may produce a cipertext that corresponds to the plain text supplied by the attacker but would not disclose the secret key it uses to encrypt the plain text. In such scenario, one could ask whether, given enough plaintext-ciphertext, pairs, the attacker could figure out the secret key or not. The following two problems will assume certain oracles that can perform certain tasks when queried, and the goal of the attacker is to guess certain secrets possessed by the oracle (Problem 1), or forge a message authentication code that can pass the test by Oracle.
Important note is the solution must not depend on the knowledge of the provided fixed values for key k and secret s as these two values are assumed that they can change.
Numer ID Projektu: #13594739
O projekcie
12 freelancerów złożyło ofertę za $278 w tym projekcie
I am an IITK graduate and I have 9 years of experience in software development. I have 100% completion rate and I have finished all the projects with the highest level of customer satisfaction. I usually finish project Więcej
Bid Summary Sir, I have an RSA implementation in Java Eclipse I can send you. Your theory is directly dependent of the encryption algorithm used. Regards. Relevant Experience RSA encryption project: [login to view URL] Więcej
