Cryptography
John Coleman
Profile Activity
Stats
300
reputation
51k
reached
6
answers
0
questions
About

I teach math and computer science at a small liberal arts university. My background is in math (specifically, universal algebra) but over the years I've gravitated more towards CS. I most enjoy things like discrete optimization or Monte Carlo simulations since they have a nice blend of math and CS. For hobbies I like reading history, playing chess and origami. I can be contacted at: jcoleman [insert symbol for at] franciscan [insert dot] edu

Communities (48)

Top network posts

This user doesn’t have any gold badges yet.
1
silver badge
6
bronze badges

Top tags (11)

Score 8
Posts 2
Posts % 33
Score 8
Posts 2
Score 5
Posts 2
Score 4
Posts 1
Score 4
Posts 1
Score 3
Posts 1
View all tags →

Top posts (6)

All Questions Answers
Votes Newest
5 Why is writing your own encryption discouraged? Feb 1 '17
4 Why was the term "discrete" used in discrete logarithm? Apr 17 '19
4 Why use prime number $q$ such $q$| $(p-1)$ in discrete logarithm based schemes? Oct 6 '20
3 Decrypting messages crypted with one time pad (used more than once) Feb 28 '16
3 Is AES easier to crack when the input is small? Sep 12 '18
1 How to use "mod" related words in technical paper？ Jun 20 '19

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.