Number in Mathematical Cryptography

Por • 29 dic, 2020 • Sección: Ciencia y tecnología

Nathan Hamlin

Abstract With the challenge of quantum computing ahead, an analysis of number and representation adequate to the task is needed. Some clarifications on the combinatorial nature of representation are presented here; this is related to the foundations of digital representations of integers, and is thus also of interest in clarifying what numbers are and how they are used in pure and applied mathematics. The author hopes this work will help mathematicians and computer scientists better understand the nature of the Generalized Knapsack Code, a lattice-based code which the author believes to be particularly promising, and the use of number in computing in general.

Keywords Number TheoryQuantum ComputingPublic-Key CryptographyGeneralized Knapsack CodeCombinatorial Code

 Department of Mathematics and Statistics, Pullman, Washington, USA.

DOI10.4236/ojdm.2017.71003   PDF   HTML   XML   2.726 Downloads   4.576 Views   Citations

Open Journal of Discrete Mathematics > Vol.7 No.1, January 2017

Share and CiteHamlin, N. (2017) Number in Mathematical Cryptography. Open Journal of Discrete Mathematics7, 13-31. doi: 10.4236/ojdm.2017.71003.

Post to Twitter

Escribe un comentario