Which of the statements below are true

Making collisions easy to find is a way to secure hash functions.

Groups of most practical applications in cryptography are multiplicative groups of prime fields and groups of points on curves $($elliptic curve cryptography$).$

RSA, Discrete Logarithm, Elliptic Curves cryptography are examples of asymmetric cryptography.

Baby$-$step giant$-$step algorithm and Pollard's$-$rho method, known as square root attacks are best known attacks on elliptic curve cryptosystems.