TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

An idea for an entropy – based cryprographic system

1 点作者 mah4k4l将近 3 年前
An idea for an entropy - based cryptographic system (a bit sketchy but I hope it communicates the idea, sorry about the messy layout)<p>-true white entropy: True Random Number Generator by for example recording audio silence (analog background entropy) and then whitening it for example with the correct character frequency of Linux &#x2F;dev&#x2F;urandom or such multiple times --&gt; character frequency - wise whitened true entropy dataset. Even character distribution of for example urandom stays correct once added to the mix no matter how much the true entropy factor is increased by multiple one time pad - re - encodings and it doesn&#x27;t matter whether the Pseudo Random Number Genrator (like urandom) used to this is compromised or not.<p>-the initial exchange of such true entropy key datasets via physical contact or physical post or couriers or such (or a trusted bitbucket or such online).<p>-the tanking of the secret over the Net model is based on a prime number series expansion system. * prime number series expansion system with prime number serieses of bytes 0-255 based on the shared secret (the physically (or such) shared true entropy key datasets): #initial lenght: 8 =A:100, 101, 102, B:50, 51, 52, 53, 54 expanded 100, 101, 102, 100, 101, 102, 100, 101, 102, 100, 101, 102, 100, 101, 102 50, 51, 52, 53, 54, 50, 51, 52, 53, 54, 50, 51, 52, 53, 54 lenght: 15=150, 152, 154, 153, 155, 152, 151, 153, 155, 154, 151, 153, 152, 154, 156, which is non - repeating and without a pattern * the packed material has to be randomised over the dataset by rules of the software uniform by both sides based on the entropy datasets shared in common (the initial secret) * the packed material has to be minimal (like maybe even 1%) to paranoidly avoid the cryptanalysis of even the most sophisticated quantum computing supremacies by the means of prime number factorization for the reason of the odds becoming astronomical for cryptanalysis. Therefore in the &#x27;tanking&#x27; phase you use 99k of the secret shared true entropy datasets to send 100k of the new shared true entropy datasets with a gain of 1k of the shared secret by means of the prime number series expansion packing. After the tanking you can use the true entropy secret thus gained to communicate in full forward secrecy by true entropy one time pads between the participants.<p>Is this model mathematically correct? If so, why not go and do it y&#x27;all for all I care. ...But please call it Noise Crypto :-)

2 条评论

mah4k4l将近 3 年前
<a href="https:&#x2F;&#x2F;youtube.com&#x2F;watch?v=Zb4rbXb7DdE" rel="nofollow">https:&#x2F;&#x2F;youtube.com&#x2F;watch?v=Zb4rbXb7DdE</a>
yababa_y将近 3 年前
i really don&#x27;t understand the model. you should code it up in python.
评论 #31846029 未加载