Question
Lenstra’s method is an effective subexponential algorithm with applications in this field and involves computing points on an elliptic curve over a finite field. Diffie and Hellman name a protocol in this field that is used to perform “exchanges” over a channel. This field relies on “hardness” assumptions such as the discrete logarithm problem. So-called “primitives” like the hash SHA-1 are used as the basis for systems in this field. A public key and a private key are used in an algorithm in this field that relies on the difficulty of factoring large numbers, the RSA algorithm. For 10 points, name this branch of computer science that develops secure communication methods. ■END■
ANSWER: cryptography [or cryptology; accept encryption or RSA encryption; accept elliptic curve cryptography or public-key cryptography; prompt on cybersecurity or mathematics or number theory; prompt on computer science or CS until read]
<Other Science>
= Average correct buzz position
Buzzes
Player | Team | Opponent | Buzz Position | Value |
---|---|---|---|---|
Tai Belke | UBC A | UW Wrath | 23 | 10 |
Summary
2024 ACF Fall at Cornell | fall | Y | 10 | 100% | 0% | 20% | 69.10 |
2024 ACF Fall at Ohio State | fall | Y | 8 | 100% | 0% | 0% | 55.13 |
2024 ACF Fall at Washington | fall | Y | 1 | 100% | 0% | 0% | 23.00 |
2024 ACF Fall at Georgia | fall | Y | 12 | 100% | 0% | 0% | 66.08 |
2024 ACF Fall at North Carolina | fall | Y | 9 | 100% | 0% | 11% | 76.11 |
2024 ACF Fall at Claremont Colleges | fall | Y | 5 | 100% | 0% | 0% | 44.80 |
2024 ACF Fall at Rutgers | fall | Y | 8 | 100% | 0% | 0% | 47.75 |
2024 ACF Fall at Illinois | fall | Y | 9 | 100% | 0% | 11% | 59.44 |