to customize your list.
more stack exchange communities
Start here for a quick overview of the site
Detailed answers to any questions you might have
Discuss the workings and policies of this site
Selecting a large NUMS Safe prime
Suppose I want to use the following simple hash function. For a mesage $m$, take some public $a$ and prime $p$ and raise $a^m \bmod p$ (never mind the computational expense of this operation). This ...
Mar 19 '13 at 3:25
newest safe-prime hash questions feed
Hot Network Questions
An argument pattern that my function can treat as Times[constant, variable]
Series for logarithms
Outcome of rolling a fair die 6 times
Moving character in Unity3D based on accelerometer input
Automatic calling system: "Press star" or "Press asterisk"?
Is the Doctor a real doctor in any way?
Best way to include attachments using EmailService [Craft Plugin]?
Make NPCs hard to interrogate
Should the commit history be used to convey critical information to developers?
How to mass delete Tridion MessageCenter warnings?
Are the bit patterns of NaNs really hardware-dependent?
Junior colleague is questioning my methodology in front of client
\displaystyle and \mathbf with cmbright font
Produce unique number given two integers
-ic -ous nomenclature
Why is writing data to disk as fast as keeping it in-memory?
What to do when my boss explicitly says he has nothing for me to do?
Toilet flush buttons
Is there a way to hop up onto a parallel curb?
How to take a cold shower
Survival type activies for Scout camp
MySQL update with PHP; MySQLi prepared statement in loop
The Rock, Paper, Scissors, Lizard, Spock Tournament of Epicness
Implement "Upgrades" Feature for Game
more hot questions
Life / Arts
Culture / Recreation
TeX - LaTeX
Unix & Linux
Ask Different (Apple)
Geographic Information Systems
Science Fiction & Fantasy
Seasoned Advice (cooking)
Personal Finance & Money
English Language & Usage
Mi Yodeya (Judaism)
Cross Validated (stats)
Theoretical Computer Science
Meta Stack Exchange
Stack Overflow Careers
site design / logo © 2014 stack exchange inc; user contributions licensed under
cc by-sa 3.0