Is converting boolean formulas to sum-of-products a hard problem?
Your reasoning is correct.  Your "sum-of-products" is more commonly known as disjunctive normal form (DNF).  It is easy to show that conversion from conjunctive normal form (CNF) to DNF is NP-hard, so converting from general Boolean formulas to DNF can't be any easier.