I'm working on a new project and could use some help from anyone that has worked on or understands the SHA-256 algorithm. Basically I need to know how compatible the two cryptography algorithms are if at all and whether or not a new alt coin could be designed around Euclid's Algorithm using the Euler's totient function. Im not sure this is the best place to raise the question but was hoping someone with a bit of knowledge in cryptography could help me out.

 (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" (or true) (more accurately the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A.