🤖 AI Summary
Sequential key recovery attacks pose a serious threat to group-based cryptosystems. Method: This work introduces the first key-recovery-resistant encryption scheme based on 3-parameter small Ree groups—marking the first use of such groups in finite-field-based group cryptography—and constructs a logarithmic signature covering the entire group, thereby eliminating stepwise key recovery pathways. Contribution/Results: Theoretical analysis shows that only 3-parameter small Ree groups achieve strict key recovery complexity Ω(|G|), i.e., full-group enumeration, enabling strong security over small finite fields; all other parameterizations or group structures fail to meet this security lower bound. Beyond extending the cryptographic applicability of small Ree groups, this work establishes a novel paradigm for designing side-channel-resistant cryptosystems based on noncommutative groups.
📝 Abstract
An improved design of a cryptosystem based on small Ree groups is proposed. We have changed the encryption algorithm and propose to use a logarithmic signature for the entire Ree group. This approach improves security against sequential key recovery attacks. Hence, the complexity of the key recovery attack will be defined by a brute-force attack over the entire group. In this paper, we have proved that to construct secure cryptosystems with group computations over a small finite field, it is needed to use a 3-parametric small Ree group.