Achieving a log(n) Speed Up for Boolean Matrix Operations and Calculating the Complexity of the Dense Linear Algebra step of Algebraic Stream Cipher Attacks and of Integer Factorization Methods.
Gregory V. BardPublished in: IACR Cryptol. ePrint Arch. (2006)
Keyphrases
- linear algebra
- stream cipher
- factorization methods
- tensor factorization
- matrix factorization
- singular value decomposition
- secret key
- low rank
- computer architecture
- hash functions
- security analysis
- pseudorandom
- image processing
- convex optimization
- boolean functions
- ciphertext
- dimensionality reduction
- high security
- collaborative filtering
- least squares