Science Olympiad Codebusters Practice Questions + Answers, Quizzes of English

Download Science Olympiad Codebusters Practice Questions + Answers and more Quizzes English in PDF only on Docsity!

Science Olympiad — New Test

Timed Question [0 points] Solve this When you have solved it, raise your hand so that the time can be recorded and the solution checked.

ZPV EP OPU OFFE UP MFBWF ZPVS SPPN. SFNBJO TJUUJOH

YOU DO NOT NEED TO LEAVE YOUR ROOM. REMAIN SITTING

BU ZPVS UBCMF BOE MJTUFO. EP OPU FWFO MJTUFO, TJNQMZ

AT YOUR TABLE AND LISTEN. DO NOT EVEN LISTEN, SIMPLY

XBJU, CF RVJFU, TUJMM BOE TPMJUBSZ. UIF XPSME XJMM

WAIT, BE QUIET, STILL AND SOLITARY. THE WORLD WILL

GSFFMZ PGGFS JUTFMG UP ZPV UP CF VONBTLFE, JU IBT OP

FREELY OFFER ITSELF TO YOU TO BE UNMASKED, IT HAS NO

DIPJDF, JU XJMM SPMM JO FDTUBTZ BU ZPVS GFFU.

CHOICE, IT WILL ROLL IN ECSTASY AT YOUR FEET.

K1 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Frequency 12 3 3 7 23 5 1 3 17 1 17 4 13 20 1 1 10 11 22 7 2 4 9 Replacement Z A B C D E F G H I J K L M N O P Q R S T U V W X Y

3. [0 points] Nietzsche Fractionated Morse

O B K S S G P L U

––×●–×–●××●●×●●●××–×●●●●×●×

M A N / I S / T H E/

V K E S P T F C F R B K F O B E G

×–●–●×●–●×●●–×●×●–●●×●×●●●×–××●–×–●×●●×––×●–×●–●●××

C R U E L E S T/ A N I M A L

Replacement L I F E A B C D G H J K M N O P Q R S T U V W X Y Z Morse fraction

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

How to solve With the crib of animal mapped to the ciphertext B K F O B E G we now know the mapping of 6 characters. Since we are told the mapping of BKFOEG ciphertext, we can build the following table: It is known that O maps to ––× The mapping of the letters between O and Z are now known because the number of unknowns exactly matches the distance between the letters. It is known that K maps to –●× Fill in possibilities between K and O. It is known that G maps to ●×× Fill in possibilities between G and K. The letter F is likely in the keyword The letter E is likely in the keyword The letter B is likely in the keyword Replacement F E B G K O P Q R S T U V W X Y Z Morse fraction

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

We can approximate the keyword length to be around 4. Based on what is known from the replacement table, the remaining possible mappings are: Possibilities

A,C

D,H

I,J

L,M

N

A,C

D,H

I,J

L,M

N

F E

A,C

D,H

I,J

L,M

N

B

A,C

D,H

I,J

L,M

N

A,C

D,H

I,J

L,M

N

G H,I I,J K L,M M,N O P Q R S T U V W X Y Z

Morse fraction

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

Based on that information we can map the cipher text to:

O B K S S G P L U

––×●–×–●××●●×●●●××–×●? ?×●×

M A N / I S / T E

V K E S P T F C F R B K F O B E G

×–●–●×●–●×●●–×●×●–●●×● ?●●×–××●–×–●×●●×––×●–×●–●●××

/ C R U E L T/ A N I M A L /

At this point in time, 2 ciphertext characters still need to be mapped. Look for an unknown mapping BEFORE a 2 morse digit fragment to eliminate invalid morse sequences and reduce the possible mappings for the letter. We find cipher text letter C before a known morse fragment of ● ●●×. Valid morse character sequence that end with ● ●●× are: ●●, ●●●, –●●, ●●●●, ●–●●, –●●●, ––●●, ●●●●●, –●●●●, ––●●●, –––●●. Combining this list with what C can possibly be... If C maps to ●●●, it would yield a number in the plain-text, so we will elminate it for now. C might be ●×●. C might be ●×–. Try some of the possibilities... We know C can be one of ●×●, ●×–. Trying ●×● for C , we'd get:

V K E S P T F C F R B K F O B E G

×–●–●×●–●×●●–×●×●–●●×●×●●●×–××●–×–●×●●×––×●–×●–●●××

/ C R U E L E S T/ A N I M A L /

That makes sense. Update our table with the mapping of C to ●×●. The letter C is likely in the keyword The updated table containing possible mappings is: Possibilities

A,D

H,I

J,L

M,N

A,D

H,I

J,L

M,N

F E

A,D

H,I

J,L

M,N

B C

A,D

H,I

J,L

M,N

G H,I I,J K L,M M,N O P Q R S T U V W X Y Z

Morse fraction

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

×

Based on that information we can map the cipher text as:

O B K S S G P L U

––×●–×–●××●●×●●●××–×●? ?×●×

M A N / I S / T E

V K E S P T F C F R B K F O B E G

×–●–●×●–●×●●–×●×●–●●×●×●●●×–××●–×–●×●●×––×●–×●–●●××

/ C R U E L E S T/ A N I M A L /

At this point in time, 1 ciphertext characters still need to be mapped. There are no more automated solving techniques, so you need to do some trial and error with the remaining unknowns. Please feel free to submit an issue with the example so we can improve this.

5. [0 points] tolstoy patristocrat

YDFEQ NQRYR QOAVK EVYDN QRYQR VKLQJ EQHVK EVLUV

WECAN KNOWO NLYTH ATWEK NOWNO THING ANDTH ATIST

KDKLJ KDUVH DJTDD RIKWP EQYLU HRP

HEHIG HESTD EGREE OFHUM ANWIS DOM

We can know only that we know nothing. And that is the highest degree of human wisdom.

K1 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Frequency 1 7 5 1 3 1 3 7 4 2 1 2 8 6 1 3 7 1 5 Replacement Y Z P E A C B D F G H I J K L M N O Q R S T U V W X