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.

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? 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

--
Regards
Stefan

Stefan Claas wrote:

> 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.

> https://github.com/706f6c6c7578/xorpng
> https://github.com/706f6c6c7578/p4bm
>

Message to large for Bitmessage and as an attachment for Remailers
woil not work, I guess, either. So Onion Courier direct messaging,
with a temporary Onion Courier Server, is the solution ... :-)

--
Regards
Stefan

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.

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

--
Regards
Stefan

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! :^)

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

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

On 1/4/2025 1:32 PM, Stefan Claas wrote:
> 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.
>

That is not the task for my experiment here. Basically, it uses the
fractal image as a sort of "special pad", just for fun. You have all of
my code for it.

Wrt xor, decrypting the image would be just like encrypting it using any
xor cipher. You create a bitmap. Encrypt it using xor. Send the
ciphertext as a bitmap, or, well, I am thinking lossless here. Take the
bitmap, or png, and decrypt it using xor. Simple. If the resulting image
give any thing away wrt it's visual appearance, well, that is a sign
that the encryption algo is not all that good...

Now, using a lossy system is fun. I have experimented with this before
when I was bored. Alice encrypts using a jpg, then tries to decrypt the
lossy result. If that fails, Alice tries again wrt, say, adjusting
coloring, ect... Alice says okay! I finally found a lossy version of a
jpg that successfully encrypted and decrypted on my end. She finally
sends the jpg to Bob. Bob "should" be able to decrypt it because Alice
already did the encrypt and decrypt cycle on her end.

Now, for some fun wrt floating point issues... Have you messed around
with storing data in the n-ary roots of complex numbers? they can
actually create interesting renderings using real user data.

https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ

When you get really bored! ;^)

Chris M. Thomasson wrote:

> Now, for some fun wrt floating point issues... Have you messed around
> with storing data in the n-ary roots of complex numbers? they can
> actually create interesting renderings using real user data.
>
> https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
>
> When you get really bored! ;^)

Well, I no longer do Computer Graphics, with formulas, like for fractals
etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.

The only interests with graphics is, when it comes to encryption/decryption
images.

--
Regards
Stefan

On 1/4/2025 2:10 PM, Stefan Claas wrote:
> Chris M. Thomasson wrote:
>
>> Now, for some fun wrt floating point issues... Have you messed around
>> with storing data in the n-ary roots of complex numbers? they can
>> actually create interesting renderings using real user data.
>>
>> https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
>>
>> When you get really bored! ;^)
>
> Well, I no longer do Computer Graphics, with formulas, like for fractals
> etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
>
> The only interests with graphics is, when it comes to encryption/decryption
> images.
>

Keep in mind that you can turn any "bag of bytes" into an image.

On 1/4/2025 2:10 PM, Stefan Claas wrote:
> Chris M. Thomasson wrote:
>
>> Now, for some fun wrt floating point issues... Have you messed around
>> with storing data in the n-ary roots of complex numbers? they can
>> actually create interesting renderings using real user data.
>>
>> https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
>>
>> When you get really bored! ;^)
>
> Well, I no longer do Computer Graphics, with formulas, like for fractals
> etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
>
> The only interests with graphics is, when it comes to encryption/decryption
> images.
>

Fwiw, do you like stereograms? I created some with some of my depth maps
created in GLSL shaders. Can you see this one:

https://i.ibb.co/gwHwpFL/image.png

I have an idea about them. What about combining an anaglyph with a
stereogram such that the observer would need to do the "eye trick" while
wearing the red and blue glasses?

;^)

On 1/4/2025 2:41 PM, Chris M. Thomasson wrote:
> On 1/4/2025 2:10 PM, Stefan Claas wrote:
>> Chris M. Thomasson wrote:
>>
>>> Now, for some fun wrt floating point issues... Have you messed around
>>> with storing data in the n-ary roots of complex numbers? they can
>>> actually create interesting renderings using real user data.
>>>
>>> https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
>>>
>>> When you get really bored! ;^)
>>
>> Well, I no longer do Computer Graphics, with formulas, like for fractals
>> etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
>>
>> The only interests with graphics is, when it comes to encryption/
>> decryption
>> images.
>>
>
> Fwiw, do you like stereograms? I created some with some of my depth maps
> created in GLSL shaders. Can you see this one:
>
> https://i.ibb.co/gwHwpFL/image.png

Here is my depth map:

https://www.facebook.com/photo/?fbid=1306311583861170&set=pcb.1306311693861159

>
> I have an idea about them. What about combining an anaglyph with a
> stereogram such that the observer would need to do the "eye trick" while
> wearing the red and blue glasses?
>
> ;^)
>
>

Chris M. Thomasson wrote:
> On 1/4/2025 2:10 PM, Stefan Claas wrote:
> > Chris M. Thomasson wrote:
> >
> > > Now, for some fun wrt floating point issues... Have you messed around
> > > with storing data in the n-ary roots of complex numbers? they can
> > > actually create interesting renderings using real user data.
> > >
> > > https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
> > >
> > > When you get really bored! ;^)
> >
> > Well, I no longer do Computer Graphics, with formulas, like for fractals
> > etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
> >
> > The only interests with graphics is, when it comes to encryption/decryption
> > images.
> >
>
> Keep in mind that you can turn any "bag of bytes" into an image.

Well, yes ... (see my file2png program) but it is IMHO tricky to do
image encryption/decryption of .png images, or not?

--
Regards
Stefan

Chris M. Thomasson wrote:
> On 1/4/2025 2:10 PM, Stefan Claas wrote:
> > Chris M. Thomasson wrote:
> >
> > > Now, for some fun wrt floating point issues... Have you messed around
> > > with storing data in the n-ary roots of complex numbers? they can
> > > actually create interesting renderings using real user data.
> > >
> > > https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
> > >
> > > When you get really bored! ;^)
> >
> > Well, I no longer do Computer Graphics, with formulas, like for fractals
> > etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
> >
> > The only interests with graphics is, when it comes to encryption/decryption
> > images.
> >
>
> Fwiw, do you like stereograms? I created some with some of my depth maps
> created in GLSL shaders. Can you see this one:
>
> https://i.ibb.co/gwHwpFL/image.png

Yes, I can see it.

> I have an idea about them. What about combining an anaglyph with a
> stereogram such that the observer would need to do the "eye trick" while
> wearing the red and blue glasses?

I created in 1995, with Photoshop 2.5.1/3.0 a stereo image, which needs
red/blue glasses. :-) I uploaded it to rarible.com as NFT for 50 ETH,
but it is no longer there, nor on my harddrive. :-( It looked really
really cool and was called ORIGAMI.

--
Regards
Stefan

Chris M. Thomasson wrote:
> On 1/4/2025 2:41 PM, Chris M. Thomasson wrote:
> > On 1/4/2025 2:10 PM, Stefan Claas wrote:
> > > Chris M. Thomasson wrote:
> > >
> > > > Now, for some fun wrt floating point issues... Have you messed around
> > > > with storing data in the n-ary roots of complex numbers? they can
> > > > actually create interesting renderings using real user data.
> > > >
> > > > https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
> > > >
> > > > When you get really bored! ;^)
> > >
> > > Well, I no longer do Computer Graphics, with formulas, like for fractals
> > > etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
> > >
> > > The only interests with graphics is, when it comes to encryption/
> > > decryption
> > > images.
> > >
> >
> > Fwiw, do you like stereograms? I created some with some of my depth maps
> > created in GLSL shaders. Can you see this one:
> >
> > https://i.ibb.co/gwHwpFL/image.png
>
> Here is my depth map:
>
> https://www.facebook.com/photo/?fbid=1306311583861170&set=pcb.1306311693861159

Nice, I used depth-maps to create normal maps and used those to create 3D prints
of bas-reliefs, in the past. They turned out pretty good and this was not much
explored by the 3D Graphics community, because it requires special knowledge,
which is probably not widely available, to get the correct results, without
unwanted artifacts and a proper bas-relief look.

<https://www.behance.net/gallery/62753223/Bas-reliefs-from-3D-models>

--
Regards
Stefan

Stefan Claas <pollux@tilde.club> wrote:
> Chris M. Thomasson wrote:
>> On 1/4/2025 2:10 PM, Stefan Claas wrote:
>> > Chris M. Thomasson wrote:
>> >
>> > > Now, for some fun wrt floating point issues... Have you messed around
>> > > with storing data in the n-ary roots of complex numbers? they can
>> > > actually create interesting renderings using real user data.
>> > >
>> > > https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
>> > >
>> > > When you get really bored! ;^)
>> >
>> > Well, I no longer do Computer Graphics, with formulas, like for fractals
>> > etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
>> >
>> > The only interests with graphics is, when it comes to encryption/decryption
>> > images.
>> >
>>
>> Keep in mind that you can turn any "bag of bytes" into an image.
>
> Well, yes ... (see my file2png program) but it is IMHO tricky to do
> image encryption/decryption of .png images, or not?

If the encryption/decryption program treats its input as just a byte
stream to be encrypted/decrypted, then it is trivial to encrypt/decrypt
any file format.

If instead you mean some kind of "special, PNG aware, encryptor that
only encrypted the bitmap data of a PNG", but left the file as
otherwise a proper PNG image structure, then that is slightly tricky
(and an algorithm that is only useful for PNG's alone).

Stefan Claas wrote:
> Chris M. Thomasson wrote:
> > On 1/4/2025 2:10 PM, Stefan Claas wrote:
> > > Chris M. Thomasson wrote:
> > >
> > > > Now, for some fun wrt floating point issues... Have you messed around
> > > > with storing data in the n-ary roots of complex numbers? they can
> > > > actually create interesting renderings using real user data.
> > > >
> > > > https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
> > > >
> > > > When you get really bored! ;^)
> > >
> > > Well, I no longer do Computer Graphics, with formulas, like for fractals
> > > etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
> > >
> > > The only interests with graphics is, when it comes to encryption/decryption
> > > images.
> > >
> >
> > Fwiw, do you like stereograms? I created some with some of my depth maps
> > created in GLSL shaders. Can you see this one:
> >
> > https://i.ibb.co/gwHwpFL/image.png
>
> Yes, I can see it.
>
> > I have an idea about them. What about combining an anaglyph with a
> > stereogram such that the observer would need to do the "eye trick" while
> > wearing the red and blue glasses?
>
> I created in 1995, with Photoshop 2.5.1/3.0 a stereo image, which needs
> red/blue glasses. :-) I uploaded it to rarible.com as NFT for 50 ETH,
> but it is no longer there, nor on my harddrive. :-( It looked really
> really cool and was called ORIGAMI.

Well,I found it on rarible.com, sorry my mistake.

<https://rarible.com/token/0xc9154424b823b10579895ccbe442d41b9abd96ed:33722708843760813648285509687083650090679594480478541226033658120821450735646>

use the maginfying glass to see the original size and use red/blues glasses
to see the effect. :-)

--
Regards
Stefan

Rich wrote:

> If instead you mean some kind of "special, PNG aware, encryptor that
> only encrypted the bitmap data of a PNG", but left the file as
> otherwise a proper PNG image structure, then that is slightly tricky
> (and an algorithm that is only useful for PNG's alone).

Yes, this is what I mean.

--
Regards
Stefan

On 1/4/2025 4:21 PM, Stefan Claas wrote:
> Rich wrote:
>
>> If instead you mean some kind of "special, PNG aware, encryptor that
>> only encrypted the bitmap data of a PNG", but left the file as
>> otherwise a proper PNG image structure, then that is slightly tricky
>> (and an algorithm that is only useful for PNG's alone).
>
> Yes, this is what I mean.
>

Well, take a good ol' bag o' bytes and turn it into a valid png?

On 1/4/2025 4:19 PM, Stefan Claas wrote:
> Stefan Claas wrote:
>> Chris M. Thomasson wrote:
>>> On 1/4/2025 2:10 PM, Stefan Claas wrote:
>>>> Chris M. Thomasson wrote:
>>>>
>>>>> Now, for some fun wrt floating point issues... Have you messed around
>>>>> with storing data in the n-ary roots of complex numbers? they can
>>>>> actually create interesting renderings using real user data.
>>>>>
>>>>> https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
>>>>>
>>>>> When you get really bored! ;^)
>>>>
>>>> Well, I no longer do Computer Graphics, with formulas, like for fractals
>>>> etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
>>>>
>>>> The only interests with graphics is, when it comes to encryption/decryption
>>>> images.
>>>>
>>>
>>> Fwiw, do you like stereograms? I created some with some of my depth maps
>>> created in GLSL shaders. Can you see this one:
>>>
>>> https://i.ibb.co/gwHwpFL/image.png
>>
>> Yes, I can see it.
>>
>>> I have an idea about them. What about combining an anaglyph with a
>>> stereogram such that the observer would need to do the "eye trick" while
>>> wearing the red and blue glasses?
>>
>> I created in 1995, with Photoshop 2.5.1/3.0 a stereo image, which needs
>> red/blue glasses. :-) I uploaded it to rarible.com as NFT for 50 ETH,
>> but it is no longer there, nor on my harddrive. :-( It looked really
>> really cool and was called ORIGAMI.
>
> Well,I found it on rarible.com, sorry my mistake.
>
> <https://rarible.com/token/0xc9154424b823b10579895ccbe442d41b9abd96ed:33722708843760813648285509687083650090679594480478541226033658120821450735646>
>
> use the maginfying glass to see the original size and use red/blues glasses
> to see the effect. :-)
>

:^) I found one of my older anaglyphs I knew I posted before. the left
hand side should seem to project "into" the screen, and the right one
out of it. Can you see with with your red and blue goggles? glasses,
lol. ;^) I had to use two cameras in my scene to do this. One for each
eye of the observer.

https://i.ibb.co/qm3jg4z/image.png

https://www.facebook.com/photo/?fbid=135603427598664&set=pcb.135603700931970

Stefan Claas <pollux@tilde.club> wrote:
> Rich wrote:
>
>> If instead you mean some kind of "special, PNG aware, encryptor that
>> only encrypted the bitmap data of a PNG", but left the file as
>> otherwise a proper PNG image structure, then that is slightly tricky
>> (and an algorithm that is only useful for PNG's alone).
>
> Yes, this is what I mean.

Which brings up the question of: why?

Why go to the trouble to create an encryptor that is specalized for
just encrypting the internal bitmap data within a PNG, leaving the rest
as a PNG file, when a generic "byte stream" encryptor will encrypt the
entire PNG with no extra effort?

Chris M. Thomasson wrote:
> On 1/4/2025 4:21 PM, Stefan Claas wrote:
> > Rich wrote:
> >
> > > If instead you mean some kind of "special, PNG aware, encryptor that
> > > only encrypted the bitmap data of a PNG", but left the file as
> > > otherwise a proper PNG image structure, then that is slightly tricky
> > > (and an algorithm that is only useful for PNG's alone).
> >
> > Yes, this is what I mean.
> >
>
> Well, take a good ol' bag o' bytes and turn it into a valid png?

No, encrypt a .png, so that an encrypted noise image comes out.

--
Regards
Stefan

Rich wrote:
> Stefan Claas <pollux@tilde.club> wrote:
> > Rich wrote:
> >
> > > If instead you mean some kind of "special, PNG aware, encryptor that
> > > only encrypted the bitmap data of a PNG", but left the file as
> > > otherwise a proper PNG image structure, then that is slightly tricky
> > > (and an algorithm that is only useful for PNG's alone).
> >
> > Yes, this is what I mean.
>
> Which brings up the question of: why?
>
> Why go to the trouble to create an encryptor that is specalized for
> just encrypting the internal bitmap data within a PNG, leaving the rest
> as a PNG file, when a generic "byte stream" encryptor will encrypt the
> entire PNG with no extra effort?

To make more content as allowed postable on social media, like X.

--
Regards
Stefan

Chris M. Thomasson wrote:
> On 1/4/2025 4:19 PM, Stefan Claas wrote:
> > Stefan Claas wrote:
> > > Chris M. Thomasson wrote:
> > > > On 1/4/2025 2:10 PM, Stefan Claas wrote:
> > > > > Chris M. Thomasson wrote:
> > > > >
> > > > > > Now, for some fun wrt floating point issues... Have you messed around
> > > > > > with storing data in the n-ary roots of complex numbers? they can
> > > > > > actually create interesting renderings using real user data.
> > > > > >
> > > > > > https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/ozDpUBlTAAAJ
> > > > > >
> > > > > > When you get really bored! ;^)
> > > > >
> > > > > Well, I no longer do Computer Graphics, with formulas, like for fractals
> > > > > etc. , or 3D CGI and 3D printing. Not sure if I ever will return to that.
> > > > >
> > > > > The only interests with graphics is, when it comes to encryption/decryption
> > > > > images.
> > > > >
> > > >
> > > > Fwiw, do you like stereograms? I created some with some of my depth maps
> > > > created in GLSL shaders. Can you see this one:
> > > >
> > > > https://i.ibb.co/gwHwpFL/image.png
> > >
> > > Yes, I can see it.
> > >
> > > > I have an idea about them. What about combining an anaglyph with a
> > > > stereogram such that the observer would need to do the "eye trick" while
> > > > wearing the red and blue glasses?
> > >
> > > I created in 1995, with Photoshop 2.5.1/3.0 a stereo image, which needs
> > > red/blue glasses. :-) I uploaded it to rarible.com as NFT for 50 ETH,
> > > but it is no longer there, nor on my harddrive. :-( It looked really
> > > really cool and was called ORIGAMI.
> >
> > Well,I found it on rarible.com, sorry my mistake.
> >
> > <https://rarible.com/token/0xc9154424b823b10579895ccbe442d41b9abd96ed:33722708843760813648285509687083650090679594480478541226033658120821450735646>
> >
> > use the maginfying glass to see the original size and use red/blues glasses
> > to see the effect. :-)
> >
>
> :^) I found one of my older anaglyphs I knew I posted before. the left
> hand side should seem to project "into" the screen, and the right one
> out of it. Can you see with with your red and blue goggles? glasses,
> lol. ;^) I had to use two cameras in my scene to do this. One for each
> eye of the observer.
>
> https://i.ibb.co/qm3jg4z/image.png
>
> https://www.facebook.com/photo/?fbid=135603427598664&set=pcb.135603700931970

I can not find my glasses. It's been many years since I have used them.

--
Regards
Stefan