Challenges in teaching a graduate course in applied cryptography

Garera, Sujata; Vasconcelos, Jorge

doi:10.1145/1595453.1595485

Cited by 2 publications

(1 citation statement)

References 13 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Typical university cryptography courses [4,11] begin with classical text cryptography before moving on to contemporary computational cryptography -although at least one [6] appears to go direct to the computational material. Classical cryptography is a fine source of material for text-processing programming assignments.…”

Section: The Context: Cryptographymentioning

confidence: 99%

Designing Programming Assignments to Reduce the Likelihood of Cheating

Simón

2017

Proceedings of the Nineteenth Australasian Computing Education Conference

View full text Add to dashboard Cite

Understanding that there will always be some students who would rather cheat on their assessments than complete them with integrity, a number of authors have proposed rules of thumb for writing assignments that will reduce the incidence of cheating. Unfortunately, these rules are so general as to be of little help when it comes to actually designing an assignment, and then varying it from one course offering to the next. This paper uses a case study, a programming assignment in cryptography, to propose specific guidelines that can be applied to the design of programming assignments to reduce the chance that students will be able to copy from students in prior offerings of the course, and to reduce the chance that students will be able to copy from programs found on the web. The guidelines illustrated by the case study are to begin with something basic, to add hidden complexity, to add manifest complexity, to add levels of complexity, to vary the assignment substantially in each successive offering, and to have multiple test plans.

show abstract

Section: The Context: Cryptographymentioning

confidence: 99%