27 October 2020 in IEEE Access
The $\mathsf {Rasta}$ cipher, proposed by Dobraunig et al. (CRYPTO 2018), is an HE-friendly cipher enjoying the fewest ANDs per bit and the lowest ANDdepth among the existing ciphers. A novel feature of $\mathsf {Rasta}$ is that its affine layers are freshly and randomly generated for every encryption. In this paper, we propose a new variant of $\mathsf {Rasta}$ , dubbed $\mathsf {Masta}$ . Similarly to $\mathsf {Rasta}$ , $\mathsf {Masta}$ takes as input a (master) secret key and a nonce, and generates a keystream block for each counter. On the other hand, $\mathsf {Masta}$ has two main differences from $\mathsf {Rasta}$ : $\mathsf {Masta}$ uses modular arithmetic to support HE schemes over a non-binary plaintext space, and it uses a smaller number of random bits in the affine layers by defining them with finite field multiplication. In this way, $\mathsf {Masta}$ outperforms $\mathsf {Rasta}$ in a transciphering framework with $\mathsf {BGV}/ \mathsf {FV}$ -style HE schemes. Our implementation shows that $\mathsf {Masta}$ is 505 to 592 times faster in terms of the throughput on the client-side, while 4792 to 6986 times faster on the server-side.