paper.bib

@book{schafer2017introduction,
  title={An Introduction to Nonassociative Algebras},
  author={Schafer, R.D.},
  isbn={9780486688138},
  lccn={lc95022734},
  series={Dover Books on Mathematics},
  url={https://books.google.ch/books?id=IsmW8-etBEwC},
  year={2017},
  publisher={Dover Publications}
}

@techreport{fousse:inria-00070266,
  TITLE = {{MPFR}: A Multiple-Precision Binary Floating-Point Library With Correct Rounding},
  AUTHOR = {Fousse, Laurent and Hanrot, Guillaume and Lef{\`e}vre, Vincent and P{\'e}lissier, Patrick and Zimmermann, Paul},
  URL = {https://hal.inria.fr/inria-00070266},
  TYPE = {Research Report},
  NUMBER = {RR-5753},
  PAGES = {15},
  INSTITUTION = {{INRIA}},
  YEAR = {2005},
  KEYWORDS = {FLOATING-POINT ARITHMETIC ; CORRECT ROUNDING ; ELEMENTARY FUNCTION ; PORTABLE SOFTWARE ; MULTIPLE-PRECISION ARITHMETIC ; IEEE-754 STANDARD},
  PDF = {https://hal.inria.fr/inria-00070266/file/RR-5753.pdf},
  HAL_ID = {inria-00070266},
  HAL_VERSION = {v1},
}

@misc{cd,
author = {T. Hoppe},
  title = {{Cayley Dickson}},
  note = {last accessed: 16 Feb 2021},
  publisher = {GitHub},
  journal = {GitHub repository},
  url = {https://github.com/thoppe/Cayley-Dickson}
}

@misc{quaternions,
author = {Patrick R. Girard},
  title="Quaternions",
  bookTitle="Quaternions, Clifford Algebras and Relativistic Physics",
  year="2007",
  publisher="Birkh{\"a}user Basel",
  address="Basel",
  pages="3--17",
  isbn="978-3-7643-7791-5",
  doi="10.1007/978-3-7643-7791-5_2",
  url="https://doi.org/10.1007/978-3-7643-7791-5_2"
}

@misc{boost,
author="Koranne, Sandeep",
  title = {Boost {C}++ Libraries},  
  bookTitle="Handbook of Open Source Tools",
  year="2011",
  publisher="Springer US",
  address="Boston, MA",
  pages="127--143",
  isbn="978-1-4419-7719-9",
  doi="10.1007/978-1-4419-7719-9_6",
  url="https://doi.org/10.1007/978-1-4419-7719-9_6"
}

@misc{doxygen,
author = {{van Heesch}, D.},
  title = {Doxygen},
  year = {2021},
  version = {1.9.1},
  publisher = {GitHub},
  journal = {GitHub repository},
  url = {https://github.com/doxygen/doxygen}
}

@misc{cpplint,
author = {{Google Inc.}},
  title = {{cpplint}},
  note = {last accessed: 16 Feb 2021},
  publisher = {GitHub},
  journal = {GitHub repository},
  url = {https://github.com/google/styleguide}
}

@misc{catch2,
author = {M. Hořeňovský},
  title = {Catch2},
  year = {2020},
  version = {2.13.2},
  publisher = {GitHub},
  journal = {GitHub repository},
  url = {https://github.com/catchorg/Catch2}
}

@InProceedings{STRU,
author="Singh, Sonika
and Padhye, Sahadeo
and Pal, Ankal",
editor="St{\u{a}}nic{\u{a}}, Pantelimon
and Gangopadhyay, Sugata
and Debnath, Sumit Kumar",
title="Generalization of Lattice-Based Cryptography on Hypercomplex Algebras",
booktitle="Security and Privacy",
year="2021",
publisher="Springer Singapore",
address="Singapore",
pages="67--79",
abstract="We propose a fast, probabilistic, multi-dimensional quantum-resistant public key cryptosystem ``STRU cryptosystem'' relying on sedenion algebra, which is power associative and flexible, but non-associative and non-alternative. STRU cryptosystem encrypts 16 data vectors at each encryption round. It contains all strengths and strong points of NTRU cryptosystem. A new property that is coined as inverse associative property for the basis elements of the sedenion algebra is verified through the computational method, which is needed for the implementation. The encryption/decryption speed of STRU cryptosystem can be increased to a level even higher than NTRU by slow down of the dimension of the underlying convolution polynomial ring and using parallelism techniques.",
isbn="978-981-33-6781-4",
doi = {10.1007/978-981-33-6781-4_6}
}

@InProceedings{NTRU,
author="Hoffstein, Jeffrey
and Pipher, Jill
and Silverman, Joseph H.",
editor="Buhler, Joe P.",
title="NTRU: A ring-based public key cryptosystem",
booktitle="Algorithmic Number Theory",
year="1998",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="267--288",
abstract="We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem comes from the interaction of the polynomial mixing system with the independence of reduction modulo two relatively prime integers p and q.",
isbn="978-3-540-69113-6",
doi = {10.1007/BFb0054868}
}

@misc{QTRU,
  author = {Ehsan Malekian and Ali Zakerolhosseini and Atefeh Mashatan},
  title = {QTRU: A Lattice Attack Resistant Version of NTRU},
  howpublished = {Cryptology ePrint Archive, Paper 2009/386},
  year = {2009},
  note = {\url{https://eprint.iacr.org/2009/386}},
  url = {https://eprint.iacr.org/2009/386}
}

@article{OTRU,
  title={OTRU: A non-associative and high speed public key cryptosystem},
  author={Ehsan Malekian and Ali Zakerolhosseini},
  journal={2010 15th CSI International Symposium on Computer Architecture and Digital Systems},
  year={2010},
  pages={83-90},
  doi = {10.1109/CADS.2010.5623536},

}