Silent-Radix Cryptography: Exploiting the Base Ambiguity of Positional Notation as a Cryptographic Primitive

{"The":[0],"observation":[1],"that":[2,111],"a":[3,28,33,44,65,88],"positional":[4],"numeral":[5],"cannot":[6],"internally":[7],"specify":[8],"its":[9],"own":[10],"base":[11,71],"—":[12,24],"the":[13,21,50,56,69,75,80,91,96,119],"\\"silent":[14],"radix\\"":[15],"problem":[16,94],"identified":[17],"in":[18],"§1.1":[19],"of":[20,59,90],"Ultrametric":[22],"Foundation":[23],"is":[25,32,53,128],"not":[26],"merely":[27],"philosophical":[29],"curiosity.":[30],"It":[31],"cryptographic":[34],"primitive.":[35],"We":[36],"formalize":[37],"this":[38],"as":[39],"**Silent":[40],"Radix":[41],"Encryption":[42],"(SRE)**,":[43],"key":[45],"encapsulation":[46],"mechanism":[47],"(KEM)":[48],"where":[49,95],"shared":[51],"secret":[52,70],"derived":[54],"from":[55],"base-$b$":[57],"interpretation":[58],"publicly":[60],"transmitted":[61],"decimal":[62,82],"digits.":[63],"Only":[64],"party":[66],"who":[67],"knows":[68],"$b$":[72,109],"can":[73],"recover":[74],"correct":[76],"key.":[77],"Eve,":[78],"seeing":[79],"same":[81],"digit":[83],"string":[84],"$N$,":[85],"must":[86],"solve":[87],"variant":[89],"integer":[92],"knapsack":[93],"weights":[97],"($b^i$)":[98],"are":[99],"unknown:":[100],"given":[101],"$N":[102],"=":[103,113],"\\\\sum":[104,114],"d_i":[105,115],"\\\\cdot":[106,116],"10^i$,":[107],"find":[108],"such":[110],"$K":[112],"b^i$":[117],"decodes":[118],"ciphertext":[120],"correctly.":[121],"For":[122],"$b":[123],"\\\\sim":[124],"2^{128}$,":[125],"brute":[126],"force":[127],"infeasible.":[129],"---":[130]}