úÎ a °     &Marcel Fourné (hecc@bitrot.dyndns.org) Safe-Infered binary addition of a and b a simple bitshift where n shifts right, a negative n shifts left binary multiplication of a and b polynomial reduction of a via r the power function, b ^ k', using Montgomery ladder and some low-k hardcoding against overheads conversion helper function conversion helper function the length of an F(2^e) ,is the number even? The last bit decides... +is the number odd? The last bit decides...  computing k/f mod m by binary inversion of f in m          hF2-0.1Data.F2F2addshiftmulreduceBypow fromInteger toIntegerlengthevenodddivbininv