Well, you might need to prove P/=NP along the way, but surely that wouldn't be much of a problem? If it turned out that P=NP there'd be more of an issue with making a secure crypto algorithm (and thus with proving one), I guess.

Of course, in either case you could gain credibility with your Fermat proof, which would probably be enough to get someone to take a serious look at anything else you did.