Encryption by using base-n systems with many characters

It is possible to interpret text as numbers (and vice versa) if one interpret letters and other characters as digits and assume that they have an inherent immutable ordering. This is demonstrated by the conventional digit set of the hexadecimal system of number coding, where the letters ABCDEF in th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Hoenen, Armin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Hoenen, Armin
description It is possible to interpret text as numbers (and vice versa) if one interpret letters and other characters as digits and assume that they have an inherent immutable ordering. This is demonstrated by the conventional digit set of the hexadecimal system of number coding, where the letters ABCDEF in this exact alphabetic sequence stand each for a digit and thus a numerical value. In this article, we consequently elaborate this thought and include all symbols and the standard ordering of the unicode standard for digital character coding. We show how this can be used to form digit sets of different sizes and how subsequent simple conversion between bases can result in encryption mimicking results of wrong encoding and accidental noise. Unfortunately, because of encoding peculiarities, switching bases to a higher one does not necessarily result in efficient disk space compression automatically.
doi_str_mv 10.48550/arxiv.2306.02378
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2306_02378</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2306_02378</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-c2a2497a75c456c86e7363abf4cd2a6d48168bfb278f71f9fc0e9750d18d064a3</originalsourceid><addsrcrecordid>eNotj7tuwjAUQL10qKAf0An_QILj13VGhOhDQurCHl07NlgiBtkprf--Ku10tqNzCHnuWCuNUmyN-TveWi6YbhkXYB4J7JLL9TrHS6K20s8S05FaLL5JtNQy-6nQrzif6ISpUnfCjG72uSzJQ8Bz8U__XJDDy-6wfWv2H6_v282-QQ2mcRy57AFBOam0M9qD0AJtkG7kqEdpOm1ssBxMgC70wTHfg2JjZ0amJYoFWf1p7-XDNccJcx1-D4b7gfgBdExAwA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Encryption by using base-n systems with many characters</title><source>arXiv.org</source><creator>Hoenen, Armin</creator><creatorcontrib>Hoenen, Armin</creatorcontrib><description>It is possible to interpret text as numbers (and vice versa) if one interpret letters and other characters as digits and assume that they have an inherent immutable ordering. This is demonstrated by the conventional digit set of the hexadecimal system of number coding, where the letters ABCDEF in this exact alphabetic sequence stand each for a digit and thus a numerical value. In this article, we consequently elaborate this thought and include all symbols and the standard ordering of the unicode standard for digital character coding. We show how this can be used to form digit sets of different sizes and how subsequent simple conversion between bases can result in encryption mimicking results of wrong encoding and accidental noise. Unfortunately, because of encoding peculiarities, switching bases to a higher one does not necessarily result in efficient disk space compression automatically.</description><identifier>DOI: 10.48550/arxiv.2306.02378</identifier><language>eng</language><subject>Computer Science - Cryptography and Security</subject><creationdate>2023-06</creationdate><rights>http://creativecommons.org/licenses/by-nc-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2306.02378$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2306.02378$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Hoenen, Armin</creatorcontrib><title>Encryption by using base-n systems with many characters</title><description>It is possible to interpret text as numbers (and vice versa) if one interpret letters and other characters as digits and assume that they have an inherent immutable ordering. This is demonstrated by the conventional digit set of the hexadecimal system of number coding, where the letters ABCDEF in this exact alphabetic sequence stand each for a digit and thus a numerical value. In this article, we consequently elaborate this thought and include all symbols and the standard ordering of the unicode standard for digital character coding. We show how this can be used to form digit sets of different sizes and how subsequent simple conversion between bases can result in encryption mimicking results of wrong encoding and accidental noise. Unfortunately, because of encoding peculiarities, switching bases to a higher one does not necessarily result in efficient disk space compression automatically.</description><subject>Computer Science - Cryptography and Security</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7tuwjAUQL10qKAf0An_QILj13VGhOhDQurCHl07NlgiBtkprf--Ku10tqNzCHnuWCuNUmyN-TveWi6YbhkXYB4J7JLL9TrHS6K20s8S05FaLL5JtNQy-6nQrzif6ISpUnfCjG72uSzJQ8Bz8U__XJDDy-6wfWv2H6_v282-QQ2mcRy57AFBOam0M9qD0AJtkG7kqEdpOm1ssBxMgC70wTHfg2JjZ0amJYoFWf1p7-XDNccJcx1-D4b7gfgBdExAwA</recordid><startdate>20230604</startdate><enddate>20230604</enddate><creator>Hoenen, Armin</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230604</creationdate><title>Encryption by using base-n systems with many characters</title><author>Hoenen, Armin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-c2a2497a75c456c86e7363abf4cd2a6d48168bfb278f71f9fc0e9750d18d064a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Cryptography and Security</topic><toplevel>online_resources</toplevel><creatorcontrib>Hoenen, Armin</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hoenen, Armin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Encryption by using base-n systems with many characters</atitle><date>2023-06-04</date><risdate>2023</risdate><abstract>It is possible to interpret text as numbers (and vice versa) if one interpret letters and other characters as digits and assume that they have an inherent immutable ordering. This is demonstrated by the conventional digit set of the hexadecimal system of number coding, where the letters ABCDEF in this exact alphabetic sequence stand each for a digit and thus a numerical value. In this article, we consequently elaborate this thought and include all symbols and the standard ordering of the unicode standard for digital character coding. We show how this can be used to form digit sets of different sizes and how subsequent simple conversion between bases can result in encryption mimicking results of wrong encoding and accidental noise. Unfortunately, because of encoding peculiarities, switching bases to a higher one does not necessarily result in efficient disk space compression automatically.</abstract><doi>10.48550/arxiv.2306.02378</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2306.02378
ispartof
issn
language eng
recordid cdi_arxiv_primary_2306_02378
source arXiv.org
subjects Computer Science - Cryptography and Security
title Encryption by using base-n systems with many characters
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T10%3A32%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Encryption%20by%20using%20base-n%20systems%20with%20many%20characters&rft.au=Hoenen,%20Armin&rft.date=2023-06-04&rft_id=info:doi/10.48550/arxiv.2306.02378&rft_dat=%3Carxiv_GOX%3E2306_02378%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true