id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ap-688	Schmidt, J.; Novotný, M.	Scalable Normal Basis Arithmetic Unit for Elliptic Curve Cryptography	2005	6	.pdf	application/pdf	5140	256	65	i m i m� � � � �� �, , , ,0 1 2 1� (2) The number of clock cycles necessary for one point addition or doubling is then: � � � � C m w m C m w m C const PADD MUL SQR � � � � � � � � � � � � log ( ) ( ) ( ) 2 1 1 1 1 . (3) We can reduce the number of clock cycles CPADD in two ways: by reducing the number of clock cycles CMUL of the multiplications and the number of clock cycles CSQR of the iterative squaring.0 Both the Massey-Omura and the AMOV multipliers need m clock cycles for computing all m bits of the result.	cache/ap-688.pdf	txt/ap-688.txt