195 karma · joined August 12, 2011
> a knowledgable user will most likely check the content first
The obvious workaround would be to download with curl, inspect, then run the virtually same inspected file through bash. This workflow is easier without necessarily using pipes. Package files can also be inspected before running and are not directly inspected in the browser.
Trust on the other hand is more complicated. Without doing tedious manual inspecting, you have to rely on the distributor. In this case, public keys aid in this regard, but also does not work with the `curl | bash` workflow.
[0]: https://www.youtube.com/channel/UCLqJsr_5PfdvDFbgv1qp2aQ
How to start a lab when funds are tight: https://www.nature.com/articles/d41586-018-05655-3
https://www.bbc.co.uk/news/av/world-middle-east-17817602/gaz...
Dan Romik
I was motivated however to install an archway for my house from the exact shape in Figure 7 (binary entropy function)
However, an RSA private key is made of up specific numbers like a modulus, private exponent, etc that contribute to its length. In principle this is all you need. But usually other generation parameters are included that speed up calculations for the Chinese Remainder Theorem.
When it comes to network bandwidth, the number one concern relates to the symmetric algorithm used for message encryption and Message Authentication Coding (MAC) for integrity checking (this is unrelated to the choice of RSA versus ECC). Smaller embedded systems may start sessions more frequently, or the asymmetric authentication may be a larger percentage of the overall traffic and the size of the keys and signatures can make a difference. At the 128-bit security level, public keys and signatures are six-times larger for RSA than for ECC. Private keys are 12-times larger for RSA compared to ECC at the 128-bit security level. The key size generally has no impact on performance, but size matters when it comes to the cost of secure storage of the keys.
> Computer scientists Ran Raz and Avishay Tal provide strong evidence that quantum computers possess a computing capacity beyond anything classical computers could ever achieve. . . . They prove, with a certain caveat, that quantum computers could handle [a specific kind of computational problem] efficiently while traditional computers would bog down forever trying to solve it.
[0]: http://www.cs.tufts.edu/comp/150FP/archive/florian-loitsch/p...