« first day (3905 days earlier)      last day (1067 days later) » 

forest
forest
00:02
ah
forest
forest
00:58
Stupid question, but how would one determine the average number of Miller-Rabin rounds that would be needed to find a single n-bit safe prime, assuming typical prime distributions at n bits of size and the worst-case false positive rate of 1/4 per round?
 
7 hours later…
kelalaka
kelalaka
08:13
@forest Rabin-MIller finds prime with probability. You are mainly asking what is the probability of a prime is a safe prime.
kelalaka
kelalaka
08:29
eprint.iacr.org/2003/186.pdf
 
8 hours later…
Maarten Bodewes
Maarten Bodewes
16:29
This is just a friendly reminder that we're now officially starting a new election for one mod to augment the team. Don't worry if you're nothing like our irreplaceable potato head, we're looking for an addition, not a 1:1 replacement. If you like to help us to maintain and/or improve the site and have some time to spare, then please do not hesitate to nominate yourself.
Heck, you could just nominate yourself just to get comment editing capabilities ;)
The linky is here: crypto.stackexchange.com/election/5 . Visit and get a badge. Nominate yourself and you may also get additional power.
 
2 hours later…
Tim
Tim
18:30
@kodlu Thanks. Is Katz's book the most thorough of the four books? I happened to have some questions about reading it in crypto.stackexchange.com/questions/99229/…
Squeamish Ossifrage
Squeamish Ossifrage
19:25
0
Q: Are pseudorandom generators, pseudorandom permutations and hash functions all keyless?

TimIn Katz's Introduction to Modern Cryptography, Chapter 7 Practical Constructions of Symmetric-Key Primitives In previous chapters we have demonstrated how secure encryption schemes and message authentication codes can be constructed from cryptographic primitives such as pseudorandom generators (...

hash pseudo-random-generator pseudo-random-function one-way-function pseudo-random-permutation
- block cipher and PRP are synonyms (ideal block cipher is different, more like random oracle, a model for adversaries)
- stream cipher (for a single fixed message number) and PRG are more or less synonymous
- PRG, PRF, and PRP are all keyed
- OWF is not keyed, and OWF is not synonymous with hash function
- hash function means many things, not one formal definition, unlike the others
- none of this is context- or author-dependent; these are standard terms in the field
forest
forest
19:51
@kelalaka Not quite. I want to take into account the how often composites will get through multiple rounds of testing as well.
@forest I'm in the annoying position of having to use a non-secure external flash for that device, yet still care about the firmware not being analyzed. So the key... has to be in the flash too (itself encrypted in some ways). So it's really about making it as hard as possible to analyze rather than impossible. I guess there are two separate problems: making it so firmware updates can't be analyzed on their own and making it as difficult as possible to analyze the firmware/clone the device once you reach the flash. Thanks for your answer, I didn't know it was called a plain text attack. — Julien BERNARD 9 hours ago
oof
@SqueamishOssifrage Why not post that as an answer?

« first day (3905 days earlier)      last day (1067 days later) »