Mikcik, what you are obviously missing here, is that any encryption is composed of multiple elements.

So for your idea:

SHA256: this hashes the data nothing more: http://en.wikipedia.org/wiki/SHA-2#Pseudocode
Enigma machine simplification, the order you put the rotating encryption wheels.

secp256r1 & secp256k1: http://www.secg.org/collateral/sec2_final.pdf page 15 & 16
Uhm this is a hard one to explain, if you know a bit about crypto, you know that the more complex you make the encryption, the harder it to bruteforce it. What these curves are supposed to do, is give a map, where you only have to do one step and it shows you the whole path, but just by moving that step by a millimeter, you see a totally different path. Which results into the fact, that if you generate a very large random number, it will be impossible for anyone to figure out the path you take.
Enigma machine simplification, you have the rotating wheels for encrypting decrypting, see a curve as one of those wheels. (but instead of giving you number 1 to 27, it gives you a whole curve of numbers, almost stretching into infinity.)

ECDSA: http://en.wikipedia.org/wiki/Elliptic_Curve_DSA
You use this to get a conversion from private to public key.
Enigma machine simplification, this would be the full enigma machine.

Think this is as simple as I can put it.
One part breaks, it can affect the whole thing.
I could be wrong in some of this (I don't believe I am but still) so if I'm wrong please correct me. (with references please)