A non-commutative cryptosystem based on quaternion algebras
From MaRDI portal
Publication:1671643
DOI10.1007/s10623-017-0451-4zbMath1408.94926arXiv1709.02079OpenAlexW2964180728MaRDI QIDQ1671643
Khadijeh Bagheri, Mohammad-Reza Sadeghi, Daniel Panario
Publication date: 6 September 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.02079
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ETRU: NTRU over the Eisenstein integers
- NTRU over rings beyond \(\mathbb{Z}\)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Algorithms for quaternion polynomial root-finding
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
- BKZ 2.0: Better Lattice Security Estimates
- Algebraic Codes on Lines, Planes, and Curves
- Combinatorial Nullstellensatz
- On coding without restrictions for the AWGN channel
- The hardness of the closest vector problem with preprocessing
- Closest point search in lattices
- A universal lattice code decoder for fading channels
- Speed Records for NTRU
- Ideals, Varieties, and Algorithms
- Quaternion Fourier Transforms for Signal and Image Processing
- On the sphere-decoding algorithm I. Expected complexity
- MaTRU: A New NTRU-Based Cryptosystem
- An Introduction to Mathematical Cryptography
- On the Zeros of Polynomials over Division Rings