Archive for the ‘encryption’ Category

Triple Entry Book Keeping and Otherwise Accounting

Friday, August 4th, 2017

I need to know more about double entry book keeping and beyond.  This is where I will put my notes.

Research Links

Running SSL with DreamHost

Friday, May 5th, 2017

For a WordPress installation you could just secure the admin areas and thus avoid the yearly fee.

Research LInks


Friday, April 14th, 2017

How does Digipass work?

The secure key has a unique serial number allocated to it which is only known by the bank. The key has a clock in it which is synchronized with the clock on the bank's computers before it is sent out. You set the PIN on the secure key which is only known by you.  

I guess the internal clock must only be accurate to human scale time intervals.

Research Links

RSA Code Made Easy

Tuesday, January 31st, 2017

A code is implemented with the following statement.  Decrypt the code.

 x^197 mod 3131  

The totient of 3131 is needed and is found below:

 3131 = 31 * 101    

 {psi} (3131) = psi(31) * psi(101) = (31-1)(101-1)=3000     because 31 and 101 are prime

Eulers Theorem a^{psi(n)} mod n =1     so:

 x^{3000m} mod (3131) = 1    Where m is an integer to give us more flexibility in generating an inverse in step XXX below.   Multiply both sides by x

 x^{3000m+1} mod (3131) = (x) mod (3131)

So if you can find a power d where:

 197d = 3000m + 1  or equivalently:

 (197d) mod(3000) = (1) mod(3000) then you can take the encrypted numbers to the power of d and out will pop the plain text original series

Now you use the Euclidean algorithm to find 1 in terms of 197 and 3000. This yields:

1 = 533(197) - 35(3000)     Taking the mod(3000) of both sides

(1)mod(3000) = (533)(197)  which shows d=533   is the decryption power we are looking for

This example used smaller numbers so as to make the example transparent.  However if the input character were to be X=31 or 101 I think the system breaks down.

CS322 Computer Science Lecture Series with Emphasis on Encryption Theory – Including the Number Theory Required

Wednesday, December 7th, 2016

This is a video series by Steve Gordon and is well done.  I wanted to understand the cryptology underlying Bitcoin and found this series after fishing around on YouTube.  For my purposes I started off with the 11th lecture in the series that details the number theory required to understand encryption.  I have embedded the 11th lecture in the series below and it starts with lecture 11 but it is only one in the CS322 lecture series and the series is probably better viewed by going direct to YouTube.  Fore an easy and quick summary and numeric example see: RSA Code Made Easy

Research Links: Steve Gordon

Using HTTPS HTTP+TLS on Websites

Monday, May 9th, 2016

Research Links

Craig Wright comes out of the closet as Satoshi Nakamoto

Monday, May 2nd, 2016

Personality traits displayed demonstrated in regards "awards" and "fame" are very reminiscent of Feynman. I don't admire sports figures, presidents or musicians. I admire people like this who can scoop up bits and pieces of the universe and form them into something new. Most inventions are so derivative as to be barely worth mention. Very rarely as in this case something totally new in its application in created. This is one of those cases. If he does not receive the Nobel Prize it should be a shock.

Darknet Tool Kit

Monday, November 23rd, 2015

Research Links


USB Install of Linux on USB for Security Reasons

Sunday, October 11th, 2015


I want a system dedicated to only financial or encrypted transmissions.  These are my notes on the topic.

Research Links



The task bar at the bottom is what I have condition to and find it much more usable than other Linux versions.




PGP Encryption Software Notes

Thursday, October 8th, 2015

Browsing session has been hanging around on my computer for some time now.  Had to do something with it.

Research Links