Polish unfinished conclusion

conclusion.tex

@@ -3,10 +3,6 @@
 
 % TODO(_) We still need some argument on the needed perfomance here.
 
-In this paper we presented optimized algorithms
-for variable-basepoint scalar multiplication for
-the Weierstraß curve we call ``Curve13318''
-
 In this paper, we introduced Baretto's Weierstraß curve,
 which we call ``Curve13318''.
 We implemented optimized algorithms for variable-basepoint scalar multiplication
@@ -24,6 +20,7 @@ while prime-order Weierstraß curves may be slower,
 they are easier to implement securely in complex cryptographic protocols than their (twisted) Edwards counterparts.
 Moreover, we saw (again) that the overhead of complete formulas
 for arithmetic on Weierstraß curves is not that large.
+
 In the end, Weierstraß curves are still superseded by Curve25519.
 However for complex protocols,
 we discourage the unmodified use of this curve.