Earlier quoted context omitted.
Are there any officially supported Google products under github.com/google ?
Even if there aren't, it makes sense to clarify to media that this is an open source project made without any business commitments. I've seen other businesses do something similar; internally it reduces friction with the business admin when devs want to open source something.
The Rune Programming Language
11–20 of 203 posts
Re: The Rune Programming Language
#12Re: The Rune Programming Language
#13"Assume the attacker can tell how long it takes for mac == computedMac to run. If the first byte of an attacker-chosen mac is wrong for the attacker-chosen message, the loop terminates after just one comparison. With 256 attempts, the attacker can find the first byte of the expected MAC for the attacker-controlled message. Repeating this process, the attacker can forge an entire MAC."
How precisely should an attacker guess how long the comparison runs?
Re: The Rune Programming Language
#14There already exists Rune programming language and that one was earlier: https://rune-rs.github.io/ They should be more careful picking the name.
Re: The Rune Programming Language
#15Can someone explain how this works: "Assume the attacker can tell how long it takes for mac == computedMac to run. If the first byte of an attacker-chosen mac is wrong for the attacker-chosen message, the loop terminates after just one comparison. With 256 attempts, the attacker can find the first byte of the expected MAC for the attacker-controlled message. Repeating this process, the attacker can forge an entire MA…
Re: The Rune Programming Language
#16Can someone explain how this works: "Assume the attacker can tell how long it takes for mac == computedMac to run. If the first byte of an attacker-chosen mac is wrong for the attacker-chosen message, the loop terminates after just one comparison. With 256 attempts, the attacker can find the first byte of the expected MAC for the attacker-controlled message. Repeating this process, the attacker can forge an entire MA…
This is white-box security, a hypothetical setting where we assume the attacker has access to the entire knowledge of the system and to every oracle they want (like an oracle telling them how much time each function takes), but don't know any secret, like private or symmetrical keys. If you can prove that your function is secure in that setting, then it's secure in real-case situations where the attacker knows even less.
Re: The Rune Programming Language
#17Also, memory-safe and blazingly fast in certain circumstances. Not complete though, some tests currently fail.
Re: The Rune Programming Language
#18Can someone explain how this works: "Assume the attacker can tell how long it takes for mac == computedMac to run. If the first byte of an attacker-chosen mac is wrong for the attacker-chosen message, the loop terminates after just one comparison. With 256 attempts, the attacker can find the first byte of the expected MAC for the attacker-controlled message. Repeating this process, the attacker can forge an entire MA…
Re: The Rune Programming Language
#19> This is not an officially supported Google product. Then why is it under github.com/google ?
Re: The Rune Programming Language
#20> This is not an officially supported Google product. Then why is it under github.com/google ?
The code is owned by Google because it was written by a Google employee on the job.