Abstract
The present paper builds upon prior research on an id scheme that utilizes a compact knapsack problem defined by a single equation. We introduce a three-move id scheme founded on a compact knapsack problem defined by an integer matrix. Through our analysis, we investigate the possible lattice-based attacks on this problem. Additionally, we present the corresponding digital signature gained through the Fiat–Shamir transform and demonstrate its security under ROM. These cryptographic primitives are potentially post quantum resistant.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
