Codebusters C

[Name]

Anyone here wants access to an xenocrypt test urgently? I plan to complete a SciOly Codebusters test of pure xenocrypts seeing how difficult they are to find but I don't want to release it without a large number of ciphers if there isn't a large demand.

I'll take it but xenocrypts arnt THAT rare unlike something like RSA where I've seen it used exactly once. If anything get a teammate to search up Spanish quotes and use a monoalpabetic encoder

[UTF-8 U+6211 U+662F]

Anyone here wants access to an xenocrypt test urgently? I plan to complete a SciOly Codebusters test of pure xenocrypts seeing how difficult they are to find but I don't want to release it without a large number of ciphers if there isn't a large demand.

I'll take it but xenocrypts arnt THAT rare unlike something like RSA where I've seen it used exactly once. If anything get a teammate to search up Spanish quotes and use a monoalpabetic encoder

Agreed, xenocrypts aren't that hard to find, especially if you speak Spanish (which I don't)

[0ddrenaline]

I need to write my second test for an upcoming competition. Last time I created a different table for each word, with a different cell for the encrypted and decrypted letters. Then I needed to type each letter individually in each cell. This is very tedious and prone to mistakes. Any tips?

[TheChiScientist]

I need to write my second test for an upcoming competition. Last time I created a different table for each word, with a different cell for the encrypted and decrypted letters. Then I needed to type each letter individually in each cell. This is very tedious and prone to mistakes. Any tips?

Make the table with the alphabet in alphabetical order and then just copy paste for all your tables. Then use a word counter to sorta all your letters and fill in accordingly. Send me a PM if you want to see an example of what I have with my Xenocrypt test.

[GoldenKnight1]

I need to write my second test for an upcoming competition. Last time I created a different table for each word, with a different cell for the encrypted and decrypted letters. Then I needed to type each letter individually in each cell. This is very tedious and prone to mistakes. Any tips?

Make the table with the alphabet in alphabetical order and then just copy paste for all your tables. Then use a word counter to sorta all your letters and fill in accordingly. Send me a PM if you want to see an example of what I have with my Xenocrypt test.

Or use the Test Generator from NCSO that is included on the National Website.

[TheChiScientist]

I need to write my second test for an upcoming competition. Last time I created a different table for each word, with a different cell for the encrypted and decrypted letters. Then I needed to type each letter individually in each cell. This is very tedious and prone to mistakes. Any tips?

Make the table with the alphabet in alphabetical order and then just copy paste for all your tables. Then use a word counter to sorta all your letters and fill in accordingly. Send me a PM if you want to see an example of what I have with my Xenocrypt test.

Or use the Test Generator from NCSO that is included on the National Website.

Oh, butterfly... Yea. No. Ignore what I just said. This is WAY better! Thx GoldenKnight!

[Saucycedo]

Any tips on solving patristocrats faster?

[0ddrenaline]

I need to write my second test for an upcoming competition. Last time I created a different table for each word, with a different cell for the encrypted and decrypted letters. Then I needed to type each letter individually in each cell. This is very tedious and prone to mistakes. Any tips?

Make the table with the alphabet in alphabetical order and then just copy paste for all your tables. Then use a word counter to sorta all your letters and fill in accordingly. Send me a PM if you want to see an example of what I have with my Xenocrypt test.

Or use the Test Generator from NCSO that is included on the National Website.

Wow, I should have known to check there. Thanks!

[jimmy-bond]

At a recent competition, there was a Baconian alphabet problem. Instead of A's and B's, they used the symbols <, >, [, ], {, }, (, and ). No hint was provided, and there were 52 letters in total. There were no repeating sets of symbols. How would someone tackle this problem?

[TheChiScientist]

At a recent competition, there was a Baconian alphabet problem. Instead of A's and B's, they used the symbols <, >, [, ], {, }, (, and ). No hint was provided, and there were 52 letters in total. There were no repeating sets of symbols. How would someone tackle this problem?

I would attempt to see how grouping would create a logical response. On a test I took they used a Baconian with odd and even numbers as A and B. I suspect that in this case, A is most likely <, [, { and B is most likely >, ], }. If I could see how the test was formatted I could test this theory out but in a nutshell, you need to find patterns in Baconian ciphers. Also, don't forget to bunch everything into fives.