Cryptography
Profile Activity
Network profile
291
reputation
1
5

John Coleman

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

6
answers
0
questions
~49k
people reached

Communities (47)

Top network posts

Top tags (11)

Score 8
Posts 2
Posts % 33
Score 7
Posts 2
Score 4
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 use prime number $q$ such $q$| $(p-1)$ in discrete logarithm based schemes? Oct 6
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
3 Why was the term “discrete” used in discrete logarithm? Apr 17 '19
1 How to use “mod” related words in technical paper？ Jun 20 '19

Badges (6)

Gold

—

Silver

1

Rarest

Bronze

5

Rarest