分野別セミナー

Multidimensional algebraic structures are common in the description of cryptosystems. Typically, they are manually decomposed by programmer into computations on smaller elements that fit into machine words. Such a process can be labor-intensive and error-prone. In this talk, I will present a domain-specific language embedded in Haskell, with which the programmer can implement a cryptosystem in a more compact syntax and focus on high-level description of the target cryptosystems. Computations on multidimensional algebraic structures programmed in this language will be expanded automatically by our compiler, initially supporting common operations in linear algebra and over extension fields. Furthermore, our compiler initially has two optimizers built in and supports two target languages: the Hydra assembly language and C++. It is extensible in that the programmer can add support for his or her own algebraic structures, domain-specific optimizations, and/or more target languages as needed. To showcase the power of our domain-specific tool, I will present two example applications of our tool, namely, optimal ate pairing over a BN curve and a key exchange scheme with LWE.