Merge branch 'master' of github.com:failedxyz/easyctf

This commit is contained in:
Jacob Magnuson 2017-03-14 19:45:12 +00:00
commit 56010eb6b4
20 changed files with 2039 additions and 2008 deletions

View file

@ -0,0 +1 @@
Solve a maze! 'j' is left, 'k' is down, 'l' is right, and 'i' is up. You input directions in a string. An example: "jkliilillikjk". Submit your input string as the flag. (Whoops! You don't have a maze, do you? Sucks to be you.)

4
a-maze-ing/grader.py Normal file
View file

@ -0,0 +1,4 @@
def grade(autogen, answer):
if len(answer)>= 25:
return True, "You guessed right!"
return False, "Nope. The maze is a bit longer than that."

7
a-maze-ing/problem.yml Normal file
View file

@ -0,0 +1,7 @@
title: A-maze-ing
author: nicebowlofsoup
hint: It may take you a while to get to the end. Just keep going!
category: Miscellaneous
autogen: false
programming: false
value: 30

2
match-me/couple_list.txt Normal file
View file

@ -0,0 +1,2 @@
There's really no need for this but whatever, this is the string that needs to be md5'd to get the flag
(Alejandro,Kerri)(Angel,Corina)(Austen,Baylee)(Caden,Patrice)(Camron,Lourdes)(Carter,Kalyn)(Clyde,Krista)(Cortez,Lucia)(Cullen,Justine)(Daquan,Sandra)(Drake,Tianna)(Edwin,Virginia)(Elvin,Tierra)(Galen,Lacey)(Gary,Shirley)(Gerald,Valeria)(Greg,Norma)(Harold,Eunice)(Jerrod,Kathryn)(Jerry,Katrina)(Joseph,Alyssa)(Kenny,Jenifer)(Ladarius,Tatiana)(Leonard,Beth)(Luciano,Nikita)(Marc,Madison)(Mario,Keri)(Mathew,Alicia)(Maxwell,Devin)(Mickey,Crystal)(Mike,Ivette)(Myron,Robin)(Nathanial,Jacquelyn)(Nathaniel,Infant)(Quinten,Shelly)(Quinton,Lorena)(Rashad,Jessika)(Scott,Janae)(Shaun,Micah)(Tristan,Sherry)(Tyron,Darian)(Zachery,Dara)

View file

@ -5,6 +5,8 @@ We received two files, one listing men and the other women. Each line contains a
For example, the entry "Joe 4, 5, 3, 1, 2" means that Joe would most prefer the 4th entry on the opposite list, and least prefer the 2nd. For example, the entry "Joe 4, 5, 3, 1, 2" means that Joe would most prefer the 4th entry on the opposite list, and least prefer the 2nd.
We have heard that there is one pairing which will be together in all possible stable matchings, please discover who this couple is and provide their names as "<male_name>,<female_name>" We have heard that there are some pairings that will be together in all possible stable matchings, please find them. However, because there are quite a bit of them, please submit your solution as the following:
MD5 hash of `(male_1,female_1)(male_2,female_2)...(male_n,female_n)`, where the pairings are sorted alphabetically by male names. For example, `(Bob,Susie)(Jim,Carol)(Tom,Emma)` would be submitted as `b0d75104ce4b3a7d892f745fd515fea4`.
Here are the lists of preferences:[male preferences](${male_prefs_txt}), [female preferences](${female_prefs_txt}). Here are the lists of preferences:[male preferences](${male_prefs_txt}), [female preferences](${female_prefs_txt}).

File diff suppressed because it is too large Load diff

View file

@ -1,4 +1,4 @@
def grade(autogen, key): def grade(autogen, key):
if key.find("Paris,Blair") != -1: if key.find("fe18ebaf381a63b3bf6a76cadcaaeb6e") != -1:
return True, "Correct!" return True, "Correct!"
return False, "Nope!" return False, "Nope!"

File diff suppressed because it is too large Load diff

View file

@ -1 +1 @@
I found somebody's notes on their private RSA! Help me crack [this](${ciphertext_txt}). I found somebody's notes on their private RSA! Help me crack [this](${ciphertext1_txt}).

View file

@ -39,7 +39,7 @@ def generate_ciphertext(random):
def generate(random): def generate(random):
return dict(files={ return dict(files={
"ciphertext.txt": generate_ciphertext "ciphertext1.txt": generate_ciphertext
}) })
def grade(random, key): def grade(random, key):

View file

@ -1 +1 @@
Some more RSA! This time, there's no P and Q... [this](${ciphertext_txt}). Some more RSA! This time, there's no P and Q... [this](${ciphertext2_txt}).

View file

@ -38,7 +38,7 @@ def generate_ciphertext(random):
def generate(random): def generate(random):
return dict(files={ return dict(files={
"ciphertext.txt": generate_ciphertext "ciphertext2.txt": generate_ciphertext
}) })
def grade(random, key): def grade(random, key):

View file

@ -1,4 +1,4 @@
I've never seen such a cryptosystem before! It looks like a public key cryptosystem, though... Could you help me crack it? I've never seen such a cryptosystem before! It looks like a public key cryptosystem, though... Could you help me crack it?
[encrypt.sage](${encrypt_sage}) [encrypt.sage](${encrypt_sage})
[publickey_and_ciphertext.txt](${publickey_and_ciphertext_txt}) [publickey and ciphertext.txt](${publickey_and_ciphertext_txt})

Binary file not shown.

Binary file not shown.

View file

@ -1,2 +1,5 @@
Welcome to the RE training course, this problem has 4 phases. Solve all four to get the flag. Welcome to the RE training course, this problem has 4 phases. Solve all four to get the flag.
Note: On phase 1 round to 6 significant figures.
[Download](${morpher_exe}) [Download](${morpher_exe})

View file

@ -128,7 +128,7 @@ past_trash:
retn retn
b_val dd 0x4039999a b_val dd 0x4039999a
base_txt db 'Please enter the best number', ENDL, 0 base_txt db 'Please enter the best number, round to 6 significant figures.', ENDL, 0
a_val dd 0x40d00000 a_val dd 0x40d00000
scanf_txt db '%f', 0 scanf_txt db '%f', 0
final_val dd 0xc092e6a0 final_val dd 0xc092e6a0

Binary file not shown.

View file

@ -0,0 +1,12 @@
# Generates random flag thing
import random
flag_temp = '{%s}'
def gen_flag(len):
val = ''
for x in range(len):
val += random.choice(list('abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789'))
return flag_temp % val
print(gen_flag((4*3)-2))

Binary file not shown.