Mainframe Security

I was asked about sites that help people learn to hack, and/or present hackable applications, virtual machines and websites. The kind people over at twitter were helpful enough to post their favorites.

Here is a consolidated list as well as a link to the tweet, lots of other good suggestions in there too.

http://overthewire.org/wargames/
http://overthewire.org/wargames/
https://attackdefense.com/
https://azeria-labs.com/arm-lab-vm/
https://github.com/infoslack/awesome-web-hacking
https://github.com/rapid7/metasploitable3
https://github.com/s4n7h0/xvwa/blob/master/README.md
https://hack.me/
https://kb.help.rapid7.com/docs/setting-up-a-penetration-testing-lab
https://lab.pentestit.ru/
https://microcorruption.com/login
https://pentesterlab.com/exercises/
https://www.enigmagroup.org/
https://www.hacking-lab.com/index.html
https://www.hacksplaining.com/
https://www.hackthebox.eu/
https://www.hackthis.co.uk/levels/
https://www.hackthissite.org/
https://www.owasp.org/index.php/OWASP_Hackademic_Challenges_Project
https://www.owasp.org/index.php/OWASP_Security_Shepherd
https://www.owasp.org/index.php/OWASP_Vulnerable_Web_Applications_Directory_Project/Pages/Offline
https://www.root-me.org/?lang=en
https://pwnable.tw/
https://www.vulnhub.com/
http://opensecuritytraining.info/
Another great meta list:
http://www.amanhardikar.com/mindmaps/Practice.html

I’d been asked a few times recently for the code that generates the ICHDEX01 RACF masking exit. If you recall, this was the pre-DES (and long pre-KDFAES) algorithm that RACF used to store its passwords. (If you want more detail about this as the other algorithms, see my presentation from SHARE 2016)

The algorithm, through a series of shifts and XORs transforms the user’s 8 character password into the masked equivalent. Quick users will see that the algorithm does little to actually protect the passwords from reverse engineering as there is a 1:1 relationship with the input (plaintext) character in position X to its corresponding output masked character in the same position X.

For example, given algorithm mask(), the following examples hold true:

So all we need do is encode via the algorithm each character until we have positions in the new mask matching the given mask.

The github repo below has both the encoder (ichdex01.py) and brute-forcer (masking_bf.py)

Masking/Demasking python code

Enjoy.