Let $E$ be an elliptic curve over $\mathbb{Q}$, then the group $E(\mathbb{Q})$ satisfies \begin{equation} E(\mathbb{Q}) \cong \mathbb{Z}^r \oplus \mathbf T \end{equation}
for some torsion group $\mathbf T$, and $r$ is the rank of $E$.
I know about the importance of elliptic curves w.r.t. public key cryptography, and I know that bounding the rank of an elliptic curve from above is a Millennium Prize Problem, but I don't know what is the practical use of bounding it from below. Any suggestions?
A bound from below for a given elliptic curve could tell you that the equation has infinitely many solutions.
Consider the congruent number problem: for a given positive integer $N$, does there exist a right-angled triangle with rational sides with area $N$? In other words, does there exist $a,b,c \in \mathbb{Q}$ such that $a^2+b^2=c^2$ and $\frac{1}{2}ab=N$?
This turns out to being equivalent to asking whether the elliptic curve $$y^2=x^3-N^2x,$$ has positive rank; a bound from below would help here. In fact, one can actually use the parity conjecture to say this should be true (in particular the rank is odd) whenever $N \equiv 5,6,7 \bmod{8}$.
As a side note, the Birch and Swinnerton-Dyer conjecture (the Millennium problem you mention) doesn't talk about bounding the rank but actually says it should be equal to something coming from analysis (roughly speaking, it comes from counting points $\bmod{p}$ for all $p$).
It is an open question whether the rank is bounded or not for elliptic curves over $\mathbb{Q}$.