Linear recurring sequences for the UOV key generation revisited
From MaRDI portal
Publication:4922892
DOI10.1007/978-3-642-37682-5_31zbMATH Open1342.94093OpenAlexW1517424157MaRDI QIDQ4922892FDOQ4922892
Authors: Albrecht Petzoldt, Stanislav Bulygin
Publication date: 4 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-37682-5_31
Recommendations
- Linear recurring sequences for the UOV key generation
- Fast verification for improved versions of the UOV and rainbow signature schemes
- CyclicRainbow – A Multivariate Signature Scheme with a Partially Cyclic Public Key
- Field lifting for smaller UOV public keys
- Two approaches to build UOV variants with shorter private key and faster signature generation
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cited In (7)
- Fast verification for improved versions of the UOV and rainbow signature schemes
- Field lifting for smaller UOV public keys
- The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes
- A study on randomness used in signature generation of UOV
- Two approaches to build UOV variants with shorter private key and faster signature generation
- Small public keys and fast verification for Multivariate Quadratic public key systems
- Linear recurring sequences for the UOV key generation
This page was built for publication: Linear recurring sequences for the UOV key generation revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922892)