Deutsch   English   Français   Italiano  
<vlc9d8$irra$1@paganini.bofh.team>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!news.nobody.at!weretis.net!feeder8.news.weretis.net!newsfeed.bofh.team!paganini.bofh.team!not-for-mail
From: Stefan Claas <pollux@tilde.club>
Newsgroups: sci.crypt
Subject: Re: xorpng
Date: Sat, 4 Jan 2025 22:32:24 +0100
Organization: To protect and to server
Message-ID: <vlc9d8$irra$1@paganini.bofh.team>
References: <vl243l$3jkpe$1@paganini.bofh.team> <vl7ivj$3k1t8$1@dont-email.me> <vl8urh$8hto$1@paganini.bofh.team> <vl9mkg$3796$5@dont-email.me> <vlbtbm$i8qt$1@paganini.bofh.team> <vlc7ia$k8so$5@dont-email.me> <vlc80o$ipdu$1@paganini.bofh.team> <vlc891$k8s5$2@dont-email.me> <vlc8om$k8s5$3@dont-email.me>
Mime-Version: 1.0
Injection-Date: Sat, 4 Jan 2025 21:32:24 -0000 (UTC)
Injection-Info: paganini.bofh.team; logging-data="618346"; posting-host="sgYUERLgG+CVTBE/gGMmhA.user.paganini.bofh.team"; mail-complaints-to="usenet@bofh.team"; posting-account="9dIQLXBM7WM9KzA+yjdR4A";
User-Agent: flnews/1.3.0pre29 (for GNU/Linux)
Cancel-Lock: sha1:hqlVcDL7R8otstnncNfQ7GT9FOk=
X-Notice: Filtered by postfilter v. 0.9.3
X-Ed25519-Pub: c0ffee5a36e581eb10f60b2831b3cdb955d2e7ef680dd282a8d43ad8b84b357a
X-Date: It's Sat Sep 11449 10:32:24 PM CET 1993, the September that never ends.
X-Ed25519-Sig: 66a83f47396a3e7a3104287d7ae4d1954929e462b3197da4dd7a285028722bfe
 93c456e1fdc6a6344d72051f37de0e9ca85727d66a3febbf05d9face3ba59209
Bytes: 5498
Lines: 103

Chris M. Thomasson wrote:
> On 1/4/2025 1:13 PM, Chris M. Thomasson wrote:
> > On 1/4/2025 1:08 PM, Stefan Claas wrote:
> > > Chris M. Thomasson wrote:
> > > > On 1/4/2025 10:06 AM, Stefan Claas wrote:
> > > > > Chris M. Thomasson wrote:
> > > > > > On 1/3/2025 7:13 AM, Stefan Claas wrote:
> > > > > > > Chris M. Thomasson wrote:
> > > > > > > > On 12/31/2024 5:00 PM, Stefan Claas wrote:
> > > > > > > > > echo 'Happy News Year 2025' | ternary
> > > > > > > > > 2112102022020111101010222211010022112012102120110020100021120220
> > > > > > > > > 10000111010121200020221000211000220022020
> > > > > > > > > 
> > > > > > > > > $ echo 'Happy News Year 2025' | ternary | ternary -d
> > > > > > > > > Happy News Year 2025
> > > > > > > > > 
> > > > > > > > > (My program works with binary data as well.)
> > > > > > > > > 
> > > > > > > > 
> > > > > > > > Side note, try to get 3-ary roots from the following... It's not
> > > > > > > > that
> > > > > > > > hard but its fun wrt the results one can reap from it:
> > > > > > > > 
> > > > > > > > https://paulbourke.org/fractals/multijulia
> > > > > > > 
> > > > > > > Nice, but I do no longer do Computer Graphics.
> > > > > > > 
> > > > > > 
> > > > > > In a sense, its all about discovering the n-ary roots of a complex
> > > > > > number... For fun, I mapped actual data to said roots... :^)
> > > > > > 
> > > > > > I think I called them nits. trits would be 3-ary, akin to ternary.
> > > > > 
> > > > > Since you do a lot graphics programming, have you ever thought
> > > > > about encrypting images with XOR?
> > > > 
> > > > Indeed.
> > > > 
> > > > 
> > > > > I just did a small test with
> > > > > my xorpng program and wrote a message for you with my little
> > > > > WACOM tablet and Microsoft Paint. :-)
> > > > > 
> > > > > I think this is a really cool (but then with a mouse instead
> > > > > of a tablet) when traveling and exchanging keys in advance with
> > > > > family and friends and using a Bitmessage's alt.anonymous.messages
> > > > > chan and my p4bm program, in case Computers are compromised at the
> > > > > destination, when not carrying one and you need no credentials and
> > > > > only the keys on a Kanguru Defender 3000.
> > > > > 
> > > > > Here are the test images:
> > > > > 
> > > > > https://jmp.sh/jp1A5kvq
> > > > > 
> > > > > and here is my xorpng and p4bm program:
> > > > > 
> > > > > https://github.com/706f6c6c7578/xorpng
> > > > > https://github.com/706f6c6c7578/p4bm
> > > > > 
> > > > 
> > > > I am sure you are familiar with tux:
> > > > 
> > > > https://words.filippo.io/the-ecb-penguin/
> > > > 
> > > > We can encrypt that image in many different ways, indeed.
> > > 
> > > So, do you have an image encryption solution too?
> > > 
> > > Here is an analysis of my k-1.png and encrypted.png.
> > > (one must make sure that the keys are safely stored)
> > > 
> > > https://jmp.sh/9fvXJvmo
> > > 
> > > $ python3 image_analysis.py
> > > fourier_peaks: 194566.0
> > > wavelet_energy: {'LL': 16776624377.0, 'LH': 1891692481.0000002, 'HL':
> > > 621089515.0000001, 'HH': 619257027.0000001}
> > > histogram_variance: {'red': 791946.0, 'green': 792130.44, 'blue':
> > > 792015.6}
> > > lsb_ratio: 0.9868576388888889
> > > noise_level: 45.981313657407405
> > > region_hash_similarity: 1.0
> > > total_pixels: 230400
> > > different_pixels: 227953
> > > difference_percentage: 98.93793402777777
> > > 
> > 
> > Well, an older one was to trying to hide the points that do not escape
> > in any escape time fractal. You can take any image, any file for that
> > matter and encrypt it. Then view the file, say with one channel of
> > color, say, red. Each byte is mapped to a color, 0...255 Then we can see
> > it in this single color. Sometimes ciphers give off some rather
> > interesting visual hints! :^)
> 
> This is using fractal images to try to encrypt plaintext:
> 
> http://funwithfractals.atspace.cc/ffe

Nice, but it does not decrypt the image, right, which should
be the task.

-- 
Regards
Stefan