Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
This note continues a sequence of attempts to define efficient digital signature schemes based on low-degree polynomials, or to break such schemes. We consider a scheme proposed by Satoh and Araki [5], which generalizes the Ong-Schnorr-Shamir scheme to the noncommutative ring of quaternions. We give two different ways to break the scheme. © 2001 International Association for Cryptologic Research.
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Imran Nasim, Melanie Weber
SCML 2024
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004