Encryption Projects as SU group

[cayoenrique]

@sdrfgs

Thanks for taking the time to explain SU users how to decrypt BISS. As part of my personal experience / skill I do know how to decrypt BISS. What I do not know if the gpt part. How do you get to convince / fool a corporate hardware made for "AI" to do your job. The little knowledge I got from Discovery Channel type of program, is that this corporations has manage to create / capture huge volume of data. The AI process is then to take that huge data to screen / search for a particular solution.

One of the 1rst sample was to search for a face in huge amount of photos to identify an individual. Face recognition.

So process usually involve to create a program to search in the data base they already have.

In key brute-force, the data is just 2 to 3 lines compose of 16 bytes of data sequence. Two lines with Pusi active. Then compute all possible solutions, until the correct is found.
See that in our process we do not use the Corporation Huge Volume Data?? Yes our data is just 32 hex bytes!! And that data is NOT part of the one collected by the Corporation.

I do not see how some one will fool AI to do brute force.

 

[cayoenrique]

Now the most likely situation that seems appropriately for AI is, CSA Rainbow table.

Imaging that you convince the Corporation to hold as part of their data base ALL and I mean ALL possible crypto8 solutions.
Then some one could create a GPT program to search that data base.

But who is going to Convince that such RBT table be part of the Data Collected by the corporation?

See this will be same problem for PC Hackers. They will love to force AI to have all possible solution for a crypto. Then quickly search for a solution. If that was available then our Computer or Bank transactions would not be safe any more!!!!!


Note:
Having all possible solution for a crypto is impossible. It requires too much time to calculate. 10000ths years.

 

[Butacas]

The database (with all possible crypto 8 solutions) would be hosted on a server and an Internet connection would be essential so that the program created by GPT could access it to search. For me, it wouldn't be a good idea. There would be records of IP's and others of each and every one of the searches carried out.

Of course, over time, they can do it if they want. Develop the GPT application and host the database on a server. Good way to collect data.

Being at the point we are currently at (I'm talking about CSA Rainbow tables) there are more options to choose from (V1, V2) in comparison, if it were through some AI software, even if it would be better at 100%.

 

[moonbase]

Note:
Having all possible solution for a crypto is impossible. It requires too much time to calculate. 10000ths years.

False assumption.

Huge Crypt8 rainbow tables for biss were created years ago by many users in a worldwide sharing process hosted by another forum.
The v1 rainbow tables from this project have a very high % hit rate of above 99% for finding a CW from a Crypt8 for general 8PSK feeds.
These rainbow tables can easily be stored on a 4TB SSD and if there is a Crypt8 in the recording the CW is found in minutes.

The only need for a brute force is when there is no Crypt8 available from the recording.

 

[sdrfgs]

The example response i posted was Generated from chat gpt

via https://www.bing.com/chat

no account is needed to play around.

i've had lot of fun making python scripts for various task with No prograamming knowledge needed

 

[sdrfgs]

False assumption.

Huge Crypt8 rainbow tables for biss were created years ago by many users in a worldwide sharing process hosted by another forum.
The v1 rainbow tables from this project have a very high % hit rate of above 99% for finding a CW from a Crypt8 for general 8PSK feeds.
These rainbow tables can easily be stored on a 4TB SSD and if there is a Crypt8 in the recording the CW is found in minutes.

The only need for a brute force is when there is no Crypt8 available from the recording.

Yes in this instance , we would try to replicate the ability of cudabiss being able to bruteforce from a .ts where the crypt 8 isn't able to be found in a recording

A full range scan in the fastest possable time. Unless shortcuts are found.

A tool similar to hashcat perhaps.. or perhaps plugin for it... theres another path to follow

 

[cayoenrique]

I guess, it is an interesting subject, to use some corporation hardware to find solutions for our needs. I still think it is not feasible at the moment.

I am busy at home, have to little time to experiment. But I will come to read from time to time. If I find any one with a practical exercise on bruteforce or RBT search, I will quickly join the group. Or if anyone think that I can help, I will always be here for them.

@moonbase
You are correct for CSA 48bit. I guess muy mistake as I made to general comment. That last comment I was in fact talking about Computer / Banking bruteforce. I guess we could add all AES 128 bit crypts like the new BISS protocols. Those will also need more time.

Again I am happy to see you all.
enrique

 

[Lak7]

@sdrfgs

I do not see how some one will fool AI to do brute force.

I asked it, and it said no LOL

 

[moonbase]

There is no need to look to AI or quantum computers or whatever similar is being proposed.
With the current range of RTX 4090 graphics cards and the latest versions of CudaBISS it is possible to brute force a biss CW in a workable time to allow viewing of a feed.

 

[sdrfgs]

Yes thats great but for the average home user, we are not going to be able to invest in multiple 4090 class gpus. Alternatives are still welcome for those special cases where the numbers need "brute forcing"

 

[sdrfgs]

Can we go in reverse on a ts where no crypts are found , once the key is bruteforced? can we see which table it would of been found on such as ffh etc??

Perhaps the 1st step would be to create a new program for pulling better data from the original TS recording???

now just thinking about that. A different concept... if we had a sample of say 50 recordings that didnt have a crypt found in them and 50 that did and we then use ai machine learning to teach it. Which table should associate ? There has be a better faster way to deal with "no crypt" TS files than a raw bruteforce

Thoughts anyone?

 

[moonbase]

Can we go in reverse on a ts where no crypts are found , once the key is bruteforced? can we see which table it would of been found on such as ffh etc??

Perhaps the 1st step would be to create a new program for pulling better data from the original TS recording???

now just thinking about that. A different concept... if we had a sample of say 50 recordings that didnt have a crypt found in them and 50 that did and we then use ai machine learning to teach it. Which table should associate ? There has be a better faster way to deal with "no crypt" TS files than a raw bruteforce

Thoughts anyone?

There is a "CW to Crypt8" tool that gives all the Crypt8 options for a known CW.
As most Crypt8 are either B8hx03000h, B8hx00h or B8hxFFh, all that needs to be done is run the Crypt8 with a table and see which table type gets the CW.

There are a few more types but they are rarely used, examples being 080hx00h and 080hxFFh.
Tables for these types are available so the actual table required can be found for almost any brute forced CW

 

[Butacas]

Yes, with the Crypt8 Calculator tool it could be done. Although also, in some recordings the table appears in which you have to search.

For example, in the Feed of the satellite 7º E Frequency 11641 V SR 7200 (ID: WWE WORLD) [THE SWITCH]. This past weekend, I recorded a little more than 3 gigabytes in each recording in two days, Saturday and Sunday and the table that was when searching for crypt8 came out . In this case it was the B8hx030000h. Although the usual thing is that the table that it is does not appear and I don't know the reason, because it could appear in all of them perfectly.

 

[Butacas]

This is how the tool works in reverse.

CW: XX B5 23 A9 AB XX XX 11 Crypt8-B8hx00h: 23 9A 74 90 38 E2 1E 86 Crypt8-B0hx00h: 6B DF C7 CA 2A CB CA 07 Crypt8-A8hx00h: 2E 3E 02 3B 7E F0 6F DA Crypt8-A0hx00h: 7A EC F8 0E D9 0C 76 C7 Crypt8-98hx00h: 9A 07 57 32 82 68 E8 6E Crypt8-90hx00h: B8 93 09 D0 AC 2F D6 7C Crypt8-88hx00h: 14 FD 7A 31 81 09 37 EC Crypt8-80hx00h: 13 1B 59 4E 57 DF C2 AB Crypt8-78hx00h: 24 B5 30 7A BC C3 B7 7D Crypt8-70hx00h: 7A 2C A4 27 E0 3B EB FF Crypt8-68hx00h: 1B 6C 64 6E E3 5C 5A 07 Crypt8-60hx00h: 6D 45 3C 9A 1D 1B A9 5F Crypt8-58hx00h: B2 CB 45 CA 70 9D E7 E8 Crypt8-50hx00h: 08 00 EC 2C 3C 5A 41 BD Crypt8-48hx00h: 47 96 26 98 34 5D 3E 8E Crypt8-40hx00h: D5 F6 CC B7 61 31 04 7D Crypt8-38hx00h: 8D AC DC 1D D3 4B E1 48 Crypt8-30hx00h: 98 6B B4 C6 AB D9 6F 4C Crypt8-28hx00h: A0 BA 6A 8E 42 6C B7 CF Crypt8-20hx00h: DD A6 03 84 0D 4F 13 5B Crypt8-18hx00h: A3 EE 13 0C 8B 08 01 5C Crypt8-10hx00h: 03 16 C1 45 10 D5 C0 49 Crypt8-08hx00h: 6A D9 29 39 C6 FA A2 E4 Crypt8-B8hxFFh: DA 52 CE 0B 0C 58 5E BE Crypt8-B0hxFFh: 94 4E 38 BC 88 37 9F 9E Crypt8-A8hxFFh: 2C 68 B3 2C 2B F8 90 A1 Crypt8-A0hxFFh: 8C 77 8B B6 8A 61 B8 0D Crypt8-98hxFFh: 4B 4E C2 04 E6 5D 3D AA Crypt8-90hxFFh: 4B 50 36 59 3A 30 D0 1A Crypt8-88hxFFh: 5C 74 27 3C FF 99 F2 64 Crypt8-80hxFFh: 8F CA F3 74 20 BF D7 97 Crypt8-78hxFFh: 5A F4 0B 39 21 27 94 01 Crypt8-70hxFFh: F0 62 89 E6 C8 3E 83 93 Crypt8-68hxFFh: 72 61 35 CE 33 0C 02 40 Crypt8-60hxFFh: AD 14 54 28 D8 6E 59 A7 Crypt8-58hxFFh: 72 B7 F6 7A DB BB 46 AE Crypt8-50hxFFh: A4 B1 91 8E 66 50 75 C1 Crypt8-48hxFFh: CB 3C 83 6B 0E 8C 80 BC Crypt8-40hxFFh: B6 4A CA 99 6D 83 1C 9A Crypt8-38hxFFh: A9 EB E8 9C 04 63 FB 66 Crypt8-30hxFFh: 1B EC 2A 8B 6C 16 C9 DD Crypt8-28hxFFh: F9 22 32 22 E1 95 1C 9F Crypt8-20hxFFh: A2 A2 45 46 2D 52 7D 40 Crypt8-18hxFFh: 0E 29 19 07 27 85 7C 12 Crypt8-10hxFFh: 0A B4 CA 0E B8 DD AC 09 Crypt8-08hxFFh: CD 8B 58 8C 33 A6 12 D9 Crypt8-B8hx030000h: 1F D9 70 85 43 75 A2 1D <= B8hx030000h I add this, out of courtesy, although they are all valid Crypt8. It's the Crypt8 I found it with. Crypt8-B0hx030000h: C5 7D 3E 26 75 02 17 A7 Crypt8-A8hx030000h: 34 43 19 9B F2 E9 04 BF Crypt8-A0hx030000h: 02 04 98 B5 57 4C FC 15 Crypt8-98hx030000h: 01 A1 D7 80 4E 60 EA 57 Crypt8-90hx030000h: CB 40 2F D1 33 41 89 1E Crypt8-88hx030000h: 31 95 C7 F7 1E D8 FD E0 Crypt8-80hx030000h: FE 00 12 6F 29 9E 20 81 Crypt8-78hx030000h: A9 D4 5D 76 BE B8 76 FA Crypt8-70hx030000h: 41 16 A7 BA BC 92 E5 26 Crypt8-68hx030000h: 05 07 60 2E BC 38 02 B2 Crypt8-60hx030000h: AF 29 3D 03 54 DB A8 57 Crypt8-58hx030000h: D3 B4 D0 AC CC 80 32 19 Crypt8-50hx030000h: AB A7 79 22 7E FA 0A 56 Crypt8-48hx030000h: 10 0A C2 84 3D C3 7A F9 Crypt8-40hx030000h: D6 5C 3A 8A 69 ED D2 2D Crypt8-38hx030000h: BB 27 B3 69 78 EF 17 CC Crypt8-30hx030000h: B3 B1 95 68 6E 8E 9E 09 Crypt8-28hx030000h: EB 21 61 1A 74 7D 1B 90 Crypt8-20hx030000h: 73 AD 2F 88 A4 D6 F5 22 Crypt8-18hx030000h: F9 4D B9 63 40 DC D1 BE Crypt8-10hx030000h: 3A F4 05 71 87 F2 69 12 Crypt8-08hx030000h: DD 1F 8C 1C EF EC F1 40

 

[Lak7]

lak7 will you release to me the source code? so i can see what i can manage with it?

Do you have Visual Studio and the Cuda toolkit installed? I'd say PM me, but need more conversations

 

[sdrfgs]

Do you have Visual Studio and the Cuda toolkit installed? I'd say PM me, but need more conversations

Of course I have those

 

[C0der]

Me too.

 

[cayoenrique]

HE HE HE

Of course most of all we have.

 

[Lak7]

HE HE HE

Of course most of all we have.

Good to hear.
And everyone can successfully compile the simpler sample CUDA projects? (I'm not a teacher )

 

[Lak7]

Of course I have those

Any success?