计算机安全密码学computer security cryptography

10/25/2018 CSC347H5 Assignment 2 CSC347H5 Assignment 2 Due 11:59PM on Wed. Oct. 31, 2018 Assignment out of 40 marks total Submission Requirements (2 Marks) This assignment must be completed in pairs. Both group members must submit a copy of the assignment on Quercus. You should submit a tar le that contains the following: 1. A

Assignment 4 — Side Channel Attacks In this assignment you will mount a side-channel attack against an implementation of modular exponen- tiation, and will fix the implementation to make it resistant to microarchitectural side channel attacks. The application to attack is num.c, which you can find using tar xf assignment4.pdf num.c. It uses the (fixed)

Ok, so we outsourced this assignment to a sweat shop worker. Unfortunately, they went AWOL, leaving only a cryptic program. We believe that the assignment is hidden somewhere there, but some work is required to find this out. The program itself is in server.c. The relevant part is: static char *password= [REMOVED]; ​ #define MLEN [REMOVED]

Machine Problem 3: Searchable Encryption This is the third machine problem for ECE/S 498 AM Applied Cryptography at the University of Illinois at Urbana-Champaign. http://soc1024.ece.illinois.edu/teaching/ece498am/fall2017/ In this assignment you will implement parts of two Searchable Encryption protocols as well as a document injection attack. This repository includes a PDF handout, handout.pdf, which provides details about

Machine Problem 2: Garbled Circuits This is the second machine problem for ECE/S 498 AM Applied Cryptography at the University of Illinois at Urbana-Champaign. http://soc1024.ece.illinois.edu/teaching/ece498am/fall2017/ In this assignment you will need to implement Yao’s Garbled Circuits protocol for secure two-party computation. A two-party computation scheme lets Alice and Bob evaluate functions over their secret inputs.

Machine Problem 1: Zero Knowledge Proofs This is the first machine problem for ECE/S 498 AM Applied Cryptography at the University of Illinois at Urbana-Champaign. http://soc1024.ece.illinois.edu/teaching/ece498am/fall2017/ In this assignment you will need to implement several zero-knowledge proof schemes for languages involving discrete logarithms. This assignment is intended to provide: a hands-on way to understand “group

Objectives The University of Melbourne School of Computing and Information Systems COMP90043 Cryptography and Security Assignment 2, Semester 2 2018 Due Date: September 17, 09:00AM To improve your understanding of the Euclid’s algorithm, divisibility properties and classical ciphers. To develop problem-solving and design skills. To improve written communication skills. Questions 1. [8 marks] Alice chooses