Algebraic Cryptanalysis of CTRU Cryptosystem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722680 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1942422 (Why is no real title available?)
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- scientific article; zbMATH DE number 1759769 (Why is no real title available?)
- scientific article; zbMATH DE number 1852134 (Why is no real title available?)
- scientific article; zbMATH DE number 1852140 (Why is no real title available?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- A method for obtaining digital signatures and public-key cryptosystems
- Advances in Cryptology - CRYPTO 2003
- Finding a small root of a bivariate integer equation; factoring with high bits known
- MaTRU: A New NTRU-Based Cryptosystem
- Optimizations for NTRU
- Random small Hamming weight products with applications to cryptography
- The size of a share must be large
Cited in
(8)- Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem
- Algebraic Cryptanalysis of Simplified AES∗
- Cryptanalysis of CTC2
- Algebraic Cryptanalysis of 58-Round SHA-1
- Algebraic cryptanalysis of variants of \textsc{Frit}
- Cryptanalysis of General Lu-Lee Type Systems
- Cryptanalysis of ITRU
- Practical Algebraic Cryptanalysis for Dragon-Based Cryptosystems
This page was built for publication: Algebraic Cryptanalysis of CTRU Cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511333)