i still don't get why people use elliptic curves instead of diffie-hellman since you can use it for public keys too. the index calculus cryptanalytic method appears to apply for the usage of F_q where q = pn for some prime p. it appears that if q is a large prime and q - 1 is divisible by a large prime, that covers the two biggest error cases
15
Replies
7
Boosts
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
This comment is unavailable — it may have been deleted or is not visible to you.
i'm fucking amazed nobody has ever brought up the idea that checksums might be different for the purpose of integrity checking vs cryptographic signatures
Richard Hamming, the inventor of Hamming codes,
sure buddy
there's a kind of BE NOT AFRAID response i get when considering how to provide checksum trees for a whole file and then all the way up the directory hierarchy.
like you need to have parity data not just for your data but also for your parity data. so you're constructing a parity tree for your parity tree recursively
omg usenet again has the innovations in information theory https://en.wikipedia.org/wiki/Parchive
this is the sickest shit ever!!!!!
An incremental backup only makes sense when the new set of input files has a lot of overlap with the previous set of input files.
An example of using Par-inside is with the ZIP file format.
YES!!!!!!!!!
Unfortunately there is not a standard license for file formats.
so i don't exactly get the point of disk encryption. it seems to actively avoid the ability to specify application-specific cryptographic keys while enabling a whole host of attacks by virtue of occurring implicitly through the file system
i get that it's probably fun for cryptographers to work on but why is it easier to encrypt an entire disk than to encrypt a random file or directory tree
like look https://en.wikipedia.org/wiki/Disk_encryption_theory#Problem_definition
If some non-absolute level of disk integrity is desired, it can be achieved within the encrypted disk on a file-by-file basis using message authentication codes.
wikipedia is saying yeah if you want to check whether your data is getting fucked up you can add checksums on a per-file basis. even though DATA INTEGRITY IS THE PURPOSE OF THE FILESYSTEM!!!!!