It's not relevant for the size of integers considered for cryptographic applications, and I doubt sheer performance is the main consideration in such applicatio

It's not relevant for the size of integers considered for cryptographic applications, and I doubt sheer performance is the main consideration in such applications anyway. Having said that, if you do want a simple BSD licensed library for bignums that has asymptotically fast arithmetic, there is always the bsdnt library.