Rabin randomization encryption and signature method based on structured coding and hash binding
By using a Rabin randomization encryption and signature method that combines structured coding and hash binding, the problem of high computational overhead and deterministic characteristics of the Rabin scheme in resource-constrained devices is solved, achieving efficient and secure encryption and signature verification, which is suitable for scenarios such as IoT firmware updates.
Patent Information
- Application Number
- CN202610859311.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-06-15
- Publication Date
- 2026-07-17
AI Technical Summary
Existing Rabin-based encryption and signature schemes have high computational overhead on resource-constrained devices and are susceptible to replay attacks due to deterministic features, making them difficult to efficiently verify in "few signatures, many verifications" scenarios.
The Rabin randomization encryption and signature method, which employs structured coding and hash binding, achieves efficient determination of modular square operations and hash binding through key generation, randomization encryption, probabilistic signature and signature verification processes. It utilizes Blum-type prime numbers and collision-resistant hash functions to eliminate the correlation of deterministic outputs.
It significantly reduces computational complexity in resource-constrained devices, improves verification efficiency, avoids cross-session correlation risks, and is suitable for scenarios such as IoT firmware updates.
Smart Images
Figure CN122419802A_ABST