Codebusters C

User avatar
Name
Member
Member
Posts: 230
Joined: January 21st, 2018, 4:41 pm
Division: C
State: NY
Location: Syosset

Re: Codebusters C

Postby Name » January 13th, 2019, 4:26 pm

TheChiScientist wrote: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
SW 16-17 Syosset 18-21. Previous main events: Microbe, Invasive, Herp, Matsci. Medals: 25(20 in Div C)
2018-19 Placements
Comps: LISO/MIT/Regional/Brown/Cornell/States
Fermi:1/3/1/1/1
Code:3/1/1/2/6rip
Astro:9/12/1/2/5
Sci Bowl x/x/1/x/12
Duct Tape: x/x/x/x/3
2019 MIT Code Busters Champion!

User avatar
UTF-8 U+6211 U+662F
Exalted Member
Exalted Member
Posts: 1283
Joined: January 18th, 2015, 7:42 am
Division: C
State: PA
Location: (0, 0)
Contact:

Re: Codebusters C

Postby UTF-8 U+6211 U+662F » January 13th, 2019, 4:34 pm

Name wrote:
TheChiScientist wrote: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
Member
Member
Posts: 113
Joined: May 21st, 2015, 6:36 pm
Division: Grad
State: MI

Re: Codebusters C

Postby 0ddrenaline » January 14th, 2019, 3:06 pm

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?

User avatar
TheChiScientist
Member
Member
Posts: 567
Joined: March 11th, 2018, 11:25 am
Division: C
State: IL
Location: Somewhere between Absolute Zero and 1E32 K.

Re: Codebusters C

Postby TheChiScientist » January 14th, 2019, 3:09 pm

0ddrenaline wrote: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. :D
A Science Olympian from 2015 -To Present
Medal Count:25 8-)
Current Events
Boomilever,Code Busters,Exp Design

Background In
Thermo, WIDI, Hovercraft, Bridges, Wright Stuff, Geocaching, Ecology, Fermi

School: Crystal Lake Central High School Wiki
Assassinator #119 and Co-Conspirator in #120 ;)

GoldenKnight1
Coach
Coach
Posts: 184
Joined: May 2nd, 2009, 5:02 pm
Division: Grad
State: PA

Re: Codebusters C

Postby GoldenKnight1 » January 14th, 2019, 3:16 pm

TheChiScientist wrote:
0ddrenaline wrote: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. :D


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

User avatar
TheChiScientist
Member
Member
Posts: 567
Joined: March 11th, 2018, 11:25 am
Division: C
State: IL
Location: Somewhere between Absolute Zero and 1E32 K.

Re: Codebusters C

Postby TheChiScientist » January 14th, 2019, 3:19 pm

GoldenKnight1 wrote:
TheChiScientist wrote:
0ddrenaline wrote: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. :D


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! :)
A Science Olympian from 2015 -To Present
Medal Count:25 8-)
Current Events
Boomilever,Code Busters,Exp Design

Background In
Thermo, WIDI, Hovercraft, Bridges, Wright Stuff, Geocaching, Ecology, Fermi

School: Crystal Lake Central High School Wiki
Assassinator #119 and Co-Conspirator in #120 ;)

Saucycedo
Member
Member
Posts: 4
Joined: April 7th, 2018, 5:49 am
State: -

Re: Codebusters C

Postby Saucycedo » January 14th, 2019, 4:57 pm

Any tips on solving patristocrats faster?

0ddrenaline
Member
Member
Posts: 113
Joined: May 21st, 2015, 6:36 pm
Division: Grad
State: MI

Re: Codebusters C

Postby 0ddrenaline » January 14th, 2019, 5:39 pm

GoldenKnight1 wrote:
TheChiScientist wrote:
0ddrenaline wrote: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. :D


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

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

User avatar
jimmy-bond
Member
Member
Posts: 265
Joined: January 8th, 2018, 11:25 pm
Division: C
State: HI
Location: On Earth, I think

Re: Codebusters C

Postby jimmy-bond » January 19th, 2019, 5:49 pm

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?
If life gives you melons, you're dyslexic.

Roses are red, violets are blue, I have Alzheimer's, cheese on toast.

2019 Events
Chem Lab, Code Busters, DD, Fermi Questions, Forensics, Water Quality

2018 Nats
CB(26), DP (11), FF(1), MM(14), P&P(6)

2017 Nats
CB(36), DD(35), FF(2), MM(20)

User avatar
TheChiScientist
Member
Member
Posts: 567
Joined: March 11th, 2018, 11:25 am
Division: C
State: IL
Location: Somewhere between Absolute Zero and 1E32 K.

Re: Codebusters C

Postby TheChiScientist » January 19th, 2019, 6:00 pm

jimmy-bond wrote: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.
A Science Olympian from 2015 -To Present
Medal Count:25 8-)
Current Events
Boomilever,Code Busters,Exp Design

Background In
Thermo, WIDI, Hovercraft, Bridges, Wright Stuff, Geocaching, Ecology, Fermi

School: Crystal Lake Central High School Wiki
Assassinator #119 and Co-Conspirator in #120 ;)

User avatar
Name
Member
Member
Posts: 230
Joined: January 21st, 2018, 4:41 pm
Division: C
State: NY
Location: Syosset

Re: Codebusters C

Postby Name » January 19th, 2019, 6:31 pm

TheChiScientist wrote:
jimmy-bond wrote: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.


Adding on: with bacon the first thing to always do is to separate the groups of 5 by drawing a line between them or something. After that look for a group of 5 that are similar that fit in A or E
So like )>}]} are all similar and fit in the AAAAA for the letter A and those 5 would likely be A
Or (<}([ fit in the AABAA for E
I guess they could be annoying and set them randomly to A and B where there is no pattern. In this case you could count the frequency of each symbol for part of the cipher. Assuming they distribute each A and B equally among the symbols, A appears more frequently then B and you can assume the symbols that appear frequently are the A
SW 16-17 Syosset 18-21. Previous main events: Microbe, Invasive, Herp, Matsci. Medals: 25(20 in Div C)
2018-19 Placements
Comps: LISO/MIT/Regional/Brown/Cornell/States
Fermi:1/3/1/1/1
Code:3/1/1/2/6rip
Astro:9/12/1/2/5
Sci Bowl x/x/1/x/12
Duct Tape: x/x/x/x/3
2019 MIT Code Busters Champion!

User avatar
jimmy-bond
Member
Member
Posts: 265
Joined: January 8th, 2018, 11:25 pm
Division: C
State: HI
Location: On Earth, I think

Re: Codebusters C

Postby jimmy-bond » January 19th, 2019, 7:05 pm

Name wrote:
TheChiScientist wrote:
jimmy-bond wrote: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.


Adding on: with bacon the first thing to always do is to separate the groups of 5 by drawing a line between them or something. After that look for a group of 5 that are similar that fit in A or E
So like )>}]} are all similar and fit in the AAAAA for the letter A and those 5 would likely be A
Or (<}([ fit in the AABAA for E
I guess they could be annoying and set them randomly to A and B where there is no pattern. In this case you could count the frequency of each symbol for part of the cipher. Assuming they distribute each A and B equally among the symbols, A appears more frequently then B and you can assume the symbols that appear frequently are the A

That was the first thing I tried, but I got 4 consonants for the first 4 letters so I stopped there. I also tried the possible combinations of groups designated as certain letters (ex. < and > are A, ( and ) are A, [ and ] are B, and { and } are B). I tried a few combinations but every time, I would get three consecutive consonants at the beginning. So my guess is they were being annoying.

I thought about the second strategy you mentioned (frequency) but quickly dismissed it. All symbols were represented relatively equally (at least it seemed so, as I did not bother to count it) so it would be strenuous to guess and test.
If life gives you melons, you're dyslexic.

Roses are red, violets are blue, I have Alzheimer's, cheese on toast.

2019 Events
Chem Lab, Code Busters, DD, Fermi Questions, Forensics, Water Quality

2018 Nats
CB(26), DP (11), FF(1), MM(14), P&P(6)

2017 Nats
CB(36), DD(35), FF(2), MM(20)

User avatar
Name
Member
Member
Posts: 230
Joined: January 21st, 2018, 4:41 pm
Division: C
State: NY
Location: Syosset

Re: Codebusters C

Postby Name » January 19th, 2019, 7:40 pm

jimmy-bond wrote:That was the first thing I tried, but I got 4 consonants for the first 4 letters so I stopped there. I also tried the possible combinations of groups designated as certain letters (ex. < and > are A, ( and ) are A, [ and ] are B, and { and } are B). I tried a few combinations but every time, I would get three consecutive consonants at the beginning. So my guess is they were being annoying.

I thought about the second strategy you mentioned (frequency) but quickly dismissed it. All symbols were represented relatively equally (at least it seemed so, as I did not bother to count it) so it would be strenuous to guess and test.


Ok so I just took a completly random quote and encrypted it with Bacon cipher (24 letter). Almost exactly 2/3 of the letters were As, so there should be a noticable difference between frequencies where a symbol that represents A appears twice as often. You probably don't need to count too many letters, maybe 5ish would be sufficent to get a good idea.
Also what compitition is this? Im kinda interested in what the actual question is.
SW 16-17 Syosset 18-21. Previous main events: Microbe, Invasive, Herp, Matsci. Medals: 25(20 in Div C)
2018-19 Placements
Comps: LISO/MIT/Regional/Brown/Cornell/States
Fermi:1/3/1/1/1
Code:3/1/1/2/6rip
Astro:9/12/1/2/5
Sci Bowl x/x/1/x/12
Duct Tape: x/x/x/x/3
2019 MIT Code Busters Champion!

User avatar
jimmy-bond
Member
Member
Posts: 265
Joined: January 8th, 2018, 11:25 pm
Division: C
State: HI
Location: On Earth, I think

Re: Codebusters C

Postby jimmy-bond » January 19th, 2019, 7:46 pm

Name wrote:
jimmy-bond wrote:That was the first thing I tried, but I got 4 consonants for the first 4 letters so I stopped there. I also tried the possible combinations of groups designated as certain letters (ex. < and > are A, ( and ) are A, [ and ] are B, and { and } are B). I tried a few combinations but every time, I would get three consecutive consonants at the beginning. So my guess is they were being annoying.

I thought about the second strategy you mentioned (frequency) but quickly dismissed it. All symbols were represented relatively equally (at least it seemed so, as I did not bother to count it) so it would be strenuous to guess and test.


Ok so I just took a completly random quote and encrypted it with Bacon cipher (24 letter). Almost exactly 2/3 of the letters were As, so there should be a noticable difference between frequencies where a symbol that represents A appears twice as often. You probably don't need to count too many letters, maybe 5ish would be sufficent to get a good idea.
Also what compitition is this? Im kinda interested in what the actual question is.

Pearl City High School Invitational, took place around 4 hours ago. I'll be getting my test on Tuesday and will post the question then if I remember, and if I get hold of the answer key, I'll post the answer
If life gives you melons, you're dyslexic.

Roses are red, violets are blue, I have Alzheimer's, cheese on toast.

2019 Events
Chem Lab, Code Busters, DD, Fermi Questions, Forensics, Water Quality

2018 Nats
CB(26), DP (11), FF(1), MM(14), P&P(6)

2017 Nats
CB(36), DD(35), FF(2), MM(20)

User avatar
jimmy-bond
Member
Member
Posts: 265
Joined: January 8th, 2018, 11:25 pm
Division: C
State: HI
Location: On Earth, I think

Re: Codebusters C

Postby jimmy-bond » January 22nd, 2019, 5:05 pm

I got my test back and realized that they encoded it using a 24-letter alphabet instead of 26 and I am now kicking myself, because the left symbols were A and right symbols were B, which is what I tried initially.
If life gives you melons, you're dyslexic.

Roses are red, violets are blue, I have Alzheimer's, cheese on toast.

2019 Events
Chem Lab, Code Busters, DD, Fermi Questions, Forensics, Water Quality

2018 Nats
CB(26), DP (11), FF(1), MM(14), P&P(6)

2017 Nats
CB(36), DD(35), FF(2), MM(20)


Return to “Lab Events”

Who is online

Users browsing this forum: No registered users and 1 guest