curling_grad
Joined 5 years ago
Karma
1,595
Submissions
97
Member since
Oct 13
Recent submissions
Comment · 1 year ago
Comment · 1 year ago
I'd assume that the value intended for public exponent is used as private key exponent. Typically, public key exponent is very small compared to private key exponent. This means that the private key exponent is very small in their scheme, so attacks such as Wiener's attack[0] can be used to break the encryption.
Also, I'd like to add that public exponent is usually fixed to some well-known constant such as 65537, so the attacker might just try brute-forcing when she knows the details of the scheme.
Comment · 1 year ago
Standard ciphers such as AES and SHA comes into my mind. Some processors even have dedicated hardware instructions speed up computations for such ciphers.
Comment · 2 years ago
LLVM's Kaleidoscope tutorial[0] is a nice starting point.
Comment · 2 years ago
> Metal on Windows would not help much because the GPU hardware is what's different.
Apple shipped Intel Macs with Intel/AMD GPUs until quite recently, so hardware might not matter significantly.
Comment · 2 years ago
Actually, OpenAI did a research[0] on solving some hard math problems by integrating language model and Lean theorem prover some time ago.
Comment · 3 years ago
> I am not sure that the runtime efficiency of the compiler binary is that important.
If the compiler is for JIT, then efficiency will be important.
[0] https://www.theverge.com/2021/8/18/22630245/google-fuchsia-o...