Codebusters C

rafaelnadal
Member
Member
Posts: 67
Joined: November 5th, 2016, 9:55 am
Division: C
State: TX
Location: Studying to win this bet i made *facepalm*
Has thanked: 0
Been thanked: 0

Re: Codebusters C

Post by rafaelnadal » March 12th, 2019, 8:39 pm

It takes me 3 hours to finish a 19 question test how do i get faster :,,,,,,,)

also my partners never do anything on the actually test but they seem to get things in practice idk how to help them

i usually end up doing like 5-6 questions and my partners do like one question :,)

advice is appreiciated uwu

we usually split up they do aristocrat/paristrocrat, i do the rest :,) i finish and then try to help them but theres not much time

im better at math so i took affine/hill but should i try splitting it up differently >.< we rly need to get better but idk how to help my partners, and i myself can do all the codes but need to get much faster
CyFalls HS '19

2017 State: 2nd place We've Got Your Number

2018: 7L/Clements/Rice/Districts/Reg/States

Anatomy & Physiology:: 10/-/15/2/1/-
Experimental Design: 6/2/10/-/-
Microbe Mission: 12/5/8/4/2/-
Mousetrap Vehicle 17/6/9/5/2/-
We've Got Your Number: -/2/-/1/1/-

Vortexx
Member
Member
Posts: 30
Joined: November 19th, 2018, 8:35 am
State: IN
Has thanked: 0
Been thanked: 0

Re: Codebusters C

Post by Vortexx » March 12th, 2019, 9:41 pm

rafaelnadal wrote:It takes me 3 hours to finish a 19 question test how do i get faster :,,,,,,,)

also my partners never do anything on the actually test but they seem to get things in practice idk how to help them

i usually end up doing like 5-6 questions and my partners do like one question :,)

advice is appreiciated uwu

we usually split up they do aristocrat/paristrocrat, i do the rest :,) i finish and then try to help them but theres not much time

im better at math so i took affine/hill but should i try splitting it up differently >.< we rly need to get better but idk how to help my partners, and i myself can do all the codes but need to get much faster
I don't know the strengths that you and your partners have but I can give some suggestions. It seems like your partners aren't that good at aristocrats and patristocrats, so I would suggest giving them ALL of the simple codes (Caesar, atbash, vigenere, baconian, affine) so you have more time to work on aristocrats and patristocrats. You can also have your partners do a lot more practice aristocrats and study letter frequencies and such so they can be more useful for the test. You shouldn't worry how fast you can do a test by yourself but instead try to improve your time on the codes that you excel at. People will be better at some codes than they are at others, and you need find out what these codes are for you and your partners. As for actually getting faster, make sure you are solving the code in the fastest possible way. Other than that, just practice. A lot. Good Luck!
[hide]Events|2017-Mission, Hovercraft
2018- Mission, Hover, Codebusters, Source Code

User avatar
Scrambledeggs
Member
Member
Posts: 31
Joined: March 11th, 2019, 8:27 pm
Has thanked: 0
Been thanked: 0

Re: Codebusters C

Post by Scrambledeggs » March 12th, 2019, 10:13 pm

Does anybody have good suggestions on patristocrats and baconain with 4 or more different symbols?
2019 - 2020 Events: Water Quality, Ornithology, Dynamic Planet, Ping pong parachute

User avatar
Name
Member
Member
Posts: 407
Joined: January 21st, 2018, 4:41 pm
Division: C
State: NY
Pronouns: He/Him/His
Location: Syosset
Has thanked: 15 times
Been thanked: 10 times

Re: Codebusters C

Post by Name » March 12th, 2019, 10:30 pm

Scrambledeggs wrote:Does anybody have good suggestions on patristocrats and baconain with 4 or more different symbols?
You can look for a pattern in determining A/B. For example vowels might be A and constanents might be B. Or i've seen it where A is A B is B C is a D is B etc. A is also more common then B (around twice as common). Also they could give you a couple of plaintext where you can get some of the A and Bs and fill in the rest of the cipher, kinda like a elaborate monoalphabetic.
South Woods MS, Syosset HS '21
Favorite Past Events: Microbe, Invasive, Matsci, Fermi <3
Events!: Astro :?: , Code <3 , Fossils :cry:

2019-2020 Season
Cornell/LISO/Duke/MIT/Regionals/Brown/SOUP
Astro: 2/4/2/10/2/2/3
Code: 9/1/2/1/1/1/1
Fossils: 16/13/6/9/2/3/8

Success is not an option, it is an obligation.

Araluen
Member
Member
Posts: 10
Joined: September 4th, 2018, 7:52 am
Has thanked: 0
Been thanked: 0

Re: Codebusters C

Post by Araluen » March 13th, 2019, 8:39 pm

Could someone answer my question about RSA? How exactly does encryption work? I know how to decode based on the toebes site, however all the examples on the site use numerical values for the ciphertext. Is it possible to send a message as the plaintext or does it have to be numbers? For example, how would i go about sending the word "codes"? Would I simply convert it to the numerical string "2143418" and encode that or do i have to mod it by the provided n value prior to encoding? Sorry for the string of questions.

UTF-8 U+6211 U+662F
Exalted Member
Exalted Member
Posts: 1523
Joined: January 18th, 2015, 7:42 am
Division: C
State: PA
Has thanked: 1 time
Been thanked: 1 time

Re: Codebusters C

Post by UTF-8 U+6211 U+662F » March 14th, 2019, 12:40 pm

Araluen wrote:Could someone answer my question about RSA? How exactly does encryption work? I know how to decode based on the toebes site, however all the examples on the site use numerical values for the ciphertext. Is it possible to send a message as the plaintext or does it have to be numbers? For example, how would i go about sending the word "codes"? Would I simply convert it to the numerical string "2143418" and encode that or do i have to mod it by the provided n value prior to encoding? Sorry for the string of questions.
Since the rules don't specify a system to convert letters to numbers for RSA and there are multiple ways you can do it, I believe the State and National tests will ask you to encrypt numbers and not words.

User avatar
pepperonipi
Wiki Moderator
Wiki Moderator
Posts: 159
Joined: January 21st, 2019, 11:38 am
Division: C
State: FL
Location: adding wiki templates lol
Has thanked: 118 times
Been thanked: 154 times

Re: Codebusters C

Post by pepperonipi » March 14th, 2019, 2:04 pm

UTF-8 U+6211 U+662F wrote:
Araluen wrote:Could someone answer my question about RSA? How exactly does encryption work? I know how to decode based on the toebes site, however all the examples on the site use numerical values for the ciphertext. Is it possible to send a message as the plaintext or does it have to be numbers? For example, how would i go about sending the word "codes"? Would I simply convert it to the numerical string "2143418" and encode that or do i have to mod it by the provided n value prior to encoding? Sorry for the string of questions.
Since the rules don't specify a system to convert letters to numbers for RSA and there are multiple ways you can do it, I believe the State and National tests will ask you to encrypt numbers and not words.
I hope this is the case at these tournaments so there isn’t much confusion. However, if a test does ask you to encrypt a word, I would still probably use A = 0, B = 1, etc. for turning the word into a number sequence, since that’s what’s typically done when encrypting other messages. You will get a big number, and you shouldn’t mod it prior to encoding. That’s part of the fun of encrypting RSA on five-function calculators! :)
i eat a lot of pizza!!
no seriously help me

Boca Raton Community High School
My Wiki Page | School Wiki Page | WikiProject Tournaments of States | Pi-Bot

2019: Code, Fermi, Thermo
2019 Trials: WTF (MIT), Detector (Nationals)
2020: Detector, Orni, Code (Substitution: Penn)
2020 Trials: Data Sci (Princeton)

UTF-8 U+6211 U+662F
Exalted Member
Exalted Member
Posts: 1523
Joined: January 18th, 2015, 7:42 am
Division: C
State: PA
Has thanked: 1 time
Been thanked: 1 time

Re: Codebusters C

Post by UTF-8 U+6211 U+662F » March 14th, 2019, 2:18 pm

pepperonipi wrote:
UTF-8 U+6211 U+662F wrote:
Araluen wrote:Could someone answer my question about RSA? How exactly does encryption work? I know how to decode based on the toebes site, however all the examples on the site use numerical values for the ciphertext. Is it possible to send a message as the plaintext or does it have to be numbers? For example, how would i go about sending the word "codes"? Would I simply convert it to the numerical string "2143418" and encode that or do i have to mod it by the provided n value prior to encoding? Sorry for the string of questions.
Since the rules don't specify a system to convert letters to numbers for RSA and there are multiple ways you can do it, I believe the State and National tests will ask you to encrypt numbers and not words.
I hope this is the case at these tournaments so there isn’t much confusion. However, if a test does ask you to encrypt a word, I would still probably use A = 0, B = 1, etc. for turning the word into a number sequence, since that’s what’s typically done when encrypting other messages. You will get a big number, and you shouldn’t mod it prior to encoding. That’s part of the fun of encrypting RSA on five-function calculators! :)
It's worth noting that usually RSA encrypts words using ASCII

User avatar
pepperonipi
Wiki Moderator
Wiki Moderator
Posts: 159
Joined: January 21st, 2019, 11:38 am
Division: C
State: FL
Location: adding wiki templates lol
Has thanked: 118 times
Been thanked: 154 times

Re: Codebusters C

Post by pepperonipi » March 14th, 2019, 3:23 pm

UTF-8 U+6211 U+662F wrote:
pepperonipi wrote:
UTF-8 U+6211 U+662F wrote: Since the rules don't specify a system to convert letters to numbers for RSA and there are multiple ways you can do it, I believe the State and National tests will ask you to encrypt numbers and not words.
I hope this is the case at these tournaments so there isn’t much confusion. However, if a test does ask you to encrypt a word, I would still probably use A = 0, B = 1, etc. for turning the word into a number sequence, since that’s what’s typically done when encrypting other messages. You will get a big number, and you shouldn’t mod it prior to encoding. That’s part of the fun of encrypting RSA on five-function calculators! :)
It's worth noting that usually RSA encrypts words using ASCII
Exactly, that’s the problem: should we use the typical RSA text-to-number formula (ASCII) or the typical Code Busters text-to-number formula (A=0, B=1, etc.). You may think one way or the other, but others may not think the same.

I would’ve said use ASCII, but some tests (cough, cough, MIT) used the typical Code Busters text-to-number formula. That’s a problem. I checked the rules though and found a FAQ question which basically says we won’t need to encrypt with the RSA cipher. So that solves that problem, I guess.

On another note, have any teams tried to memorize quotes in order to get the first question extremely quickly? Seems like the winner of UPenn may have known the quote before the competition, since they solved the entire thing in less than 2 minutes... :(
i eat a lot of pizza!!
no seriously help me

Boca Raton Community High School
My Wiki Page | School Wiki Page | WikiProject Tournaments of States | Pi-Bot

2019: Code, Fermi, Thermo
2019 Trials: WTF (MIT), Detector (Nationals)
2020: Detector, Orni, Code (Substitution: Penn)
2020 Trials: Data Sci (Princeton)

Vortexx
Member
Member
Posts: 30
Joined: November 19th, 2018, 8:35 am
State: IN
Has thanked: 0
Been thanked: 0

Re: Codebusters C

Post by Vortexx » March 14th, 2019, 6:28 pm

pepperonipi wrote:
UTF-8 U+6211 U+662F wrote:
pepperonipi wrote:
I hope this is the case at these tournaments so there isn’t much confusion. However, if a test does ask you to encrypt a word, I would still probably use A = 0, B = 1, etc. for turning the word into a number sequence, since that’s what’s typically done when encrypting other messages. You will get a big number, and you shouldn’t mod it prior to encoding. That’s part of the fun of encrypting RSA on five-function calculators! :)
It's worth noting that usually RSA encrypts words using ASCII
Exactly, that’s the problem: should we use the typical RSA text-to-number formula (ASCII) or the typical Code Busters text-to-number formula (A=0, B=1, etc.). You may think one way or the other, but others may not think the same.

I would’ve said use ASCII, but some tests (cough, cough, MIT) used the typical Code Busters text-to-number formula. That’s a problem. I checked the rules though and found a FAQ question which basically says we won’t need to encrypt with the RSA cipher. So that solves that problem, I guess.

On another note, have any teams tried to memorize quotes in order to get the first question extremely quickly? Seems like the winner of UPenn may have known the quote before the competition, since they solved the entire thing in less than 2 minutes... :(
My team has thought about it but we agreed that its just not worth it. There's so many quotes that is is extremely unlikely that any of the quotes you study will be the timed question on a test (especially on a well thought out test like a state/nats test). I think that time is better well spent just doing practice codes and memorizing patterns.
[hide]Events|2017-Mission, Hovercraft
2018- Mission, Hover, Codebusters, Source Code

Post Reply

Return to “2019 Lab Events”

Who is online

Users browsing this forum: No registered users and 1 guest