Nicht lieferbar
High Quality Content by WIKIPEDIA articles! This table relates to the computational cost for certain operations used in elliptic curve cryptography, used in practice for strong cryptographic security of a public key system. The columns of the table are labelled by various computational steps. The rows of the table are for different models of elliptic curves. Note that, this simple algorithm takes at most 2l steps and each step consists of a doubling and (if k_ine 0) adding two points. So, this is one of the reasons why addition and doubling formulas are defined. Furthermore, this method is applicable to any group and if the group law is written multiplicatively, the double-and-add algorithm is instead called square-and-multiply algorithm. To see what adding (ADD) and doubling (DBL) points on elliptic curves mean, see The group law.