Just a little slideshow for the screenshots…
Also I just listened to my episode again and realise I kept calling it VMWare. I was running Virtual Box. Apologies for the confusion.
Python will be the language I do my HPR on. Well I say 'do' because I just recorded it (although still have to edit it). I am thinking I will create a new section for programming here, with the scripts I started with (I do ad-lib a fraction mind) and the code examples and similar. I will also of course have show notes on the HPR site, but think putting a list here will be helpful.
So I have closed the poll. Thank you everyone who voted / commented / spoke to me about it in IRC.
My next HPR ep is due on the 28th I believe, so look for it then!
I talk about Encryption, various ways and some examples. Hopefully it's not completely confusing! Link is in the podcast section.
The notes seemed to have gone from the HPR website so they are below:
Three Prime Numbers: 2, 3 and 5.
I will call them A, B and C so A=2, B=3 and C=5
Working through x as the current position, and i being the unencrypted password and j being the encrypted as an array, so i[x] is the 'current' position we get:
j[x] = ((j[x-1] + i[x] + A) * B ) MOD C
The password example I give is:
Encrypting 123
1 (unencrypted password) + 2 (Prime A) = 3
3 * 3 (Prime B) = 9
9 MOD 5 (Prime C) = 4
4 (previous encrypted) + 2 (current unencrypted) + 2 (Prime A) = 8
8 * 3 (Prime B) = 24
24 MOD 5 (Prime C) = 4
4 (previous encrypted) + 3 (current unencrypted) + 2 (Prime A) = 9
9 * 3 (Prime C) = 27
27 MOD 5 (Prime C) = 2
So the encrypted password is 442
It can be found here and in it I install Windows in my Virtual Box. It was definitely interesting!
Podcasts I listen to feed