Cayley Integers (long version)
环与代数
2007-05-23 v2 数论
摘要
We present here some results of applying the Cayley-Dickson process to certain alternative algebras (notably built upon Galois fields and congruence rings), in a manner which might yield new building blocks for cryptographic systems. We focus on enumeration properties rather than the classification and comparison questions which are extensively studied elsewhere, at least for algebras over fields. The results presented here are technical but not inherently difficult.
引用
@article{arxiv.math/0506349,
title = {Cayley Integers (long version)},
author = {Hubert Holin},
journal= {arXiv preprint arXiv:math/0506349},
year = {2007}
}
备注
36 pages