The Shanks’ baby-step-giant step (BSGS) algorithm is the final stage of certain functional encryption schemes based on elliptic curve pairings. This article discusses how the application of BSGS in these schemes differs from the classical one. Boundaries The textbook implementations use the group’s order $q$ as an input parameter. However, it would make the functional encryption scheme infeasible, as the order of the pairing target group is large enough to ensure cryptographic security. ...
A ZKP Joke
I’ve got a ZKP joke, but I’m not gonna to tell you. Nevertheless, this is a proof that it is funny.
Rust Coroutines on AArch64 (ARM64)
The amazing book Asynchronous Programming in Rust by Carl Fredrik Samson has a chapter on implementing stackful coroutines (fibers) in Rust for x86_64 architecture, both Linux and MacOS. But unlike the other chapters, no AArch64 implementation was included for the sake of simplicity. I tried to port it to AArch64, and this post describes my approach. This text is just an additional material for the book. I presume you are familiar either with it or with the original code at ch05/c-fibers. ...
Introductory Post
Hi! My name is Ivan Boldyrev, I am software engineer born in Novosibirsk, Russia. My main areas of interest are functional programming, Rust, and big data/highload. Since the beginning of 2024 I live in Barcelona, Spain. My favourite projects are: StarJs – astronomical library for JavaScript. FUCC – LALR parser generator for Common Lisp. hdfesse – WIP HDFS library in Rust (originally intended to replace libhdfs). I am big fan of Emacs and Apple Macbook Air M1. My other hobbies include studying French language, ink pens, sailing and reading. ...