Re: Insecure?
No algorithm is known in the line of exploiting smoothness as for the sub-exponential factorization techniques.
At any rate, no such algorithm has been published, and no one has published any credible reason to believe one exists, which is as good as the situation gets.
(There are techniques for attacking particular ECC constructions, such as Pollard's rho against ED discrete log, which are faster than naive approaches; but they just tell us what the effective key length is.)
Perhaps equally importantly, the phrase "inherently insecure" is meaningless without context. Security is not an absolute attribute. All encryption is "inherently insecure" against some attacks, such as suborning an authorized user; that's not a part of the threat space that encryption protects against. Someone who asks a question like the OP's is just demonstrating a poor understanding of information security. And there may not be any shame in that, particularly (who can be an expert in every aspect of their profession?) - but it means the question is as much a category error as anything else.