Encryption methods not based on factorization / log functions

Maybe someone here can point me to some good information...

Advances in mathmatics and quantum processing are happening very quickly, and are threating the security of crypto techniques that use factorization/log and the apparent difficulty in working with large numbers. Things like quantum computers, the Shar algorithm, reimenn hypothesis, ...ect are all pointing to evidence that these encryption techniques will be broken (If there not already) in the forseable future. What im wanting some help with, and hoping someone might could enlighten me, is information on algorithms and techniques which are not susceptable to these threats (Yes Yes, im familiar with the One Time Pad), Is ecliptic curve cryptography threatened by this?