|
Martin GagnéAssistant ProfessorComputer Science Department Wheaton College 26 E. Main Street Norton, MA 02766 phone: (508) 286-5686 office: 1323 Science Center email: lastname_firstname{at}wheatoncollege{dot}edu |
|
|
Martin GagnéAssistant ProfessorComputer Science Department Wheaton College 26 E. Main Street Norton, MA 02766 phone: (508) 286-5686 office: 1323 Science Center email: lastname_firstname{at}wheatoncollege{dot}edu |
| Fall 2021 Schedule | ||
| Comp 298 Mobile Computing | M-W 2:00 PM - 3:20 PM | Sci Center 1315 |
| Comp 370 Computer Security | T-Th 2:00 PM - 3:20 PM | Sci Center 1315 |
| Office Hours | M 3:30 PM - 4:30 PM Wed 10:30 PM - 12:00 PM Th 10:30 AM - 12:00 PM |
Sci Center 1323 |
| Research, Grading, and, you know, stuff... (Limited availability) |
Friday | |
| Comp 115: | Problem Solving and Python Programming (Fall 2019, Spring 2020) |
| Comp 116: | Data Structures (Fall 2018, Spring 2019, Spring 2021) |
| Comp 215: | Algorithms (Fall 2020) |
| Comp 298: | Mobile Computing (Fall 2020) |
| Comp 375: | Theory of Computation (Spring 2021) |
| Comp 398: | Systems and Multiprogramming (Spring 2019) |
| Comp 398: | Computer Security (Spring 2020) |
| Comp 401: | Senior Seminar (Spring 2020) |
| CS31: | Introduction to Computer Systems (Spring 2017) |
| CS35: | Data Structures and Algorithms (Fall 2017, Spring 2018) |
| CS91: | Computer Security (Fall 2016) |
| Comp 115: | Robots, Games and Problem Solving |
| Comp 121: | Foundation of Computing Theory |
| Comp 215: | Algorithms |
| Comp 375: | Theory of Computation |
| Comp 398: | (Experimental Course) Network Security |
Automated verification of cryptographic protocols: I try to teach computers how to produce or verify proofs of cryptographic protocols. It's not easy. Computers are stupid. We have had a fair bit of success so far with symmetric encryption based on block ciphers, are currently working on message authentication codes. We hope to move on to public key encryption soon. I'm currently working on the verification of the e-voting protocol developed by the Norwegian government for their public elections.
Pairing-based cryptography: While in Calgary, I did research in efficient cryptographic protocols using pairings. I was particularly interested in making efficient attribute-based encryption and signature algorithms, either by improving on previously constructed protocols, or by specializing their functionality. I'm currently trying to do away with the paring operation in identity-based and attribute-based cryptosystems by using hardware tokens.