We have hired J. Milan as ingénieur associé to help us with our programs. He first spent some time making a tour of publicly available platforms implementing the IEEE P-1363 cryptography standards. Following this work, it appeared not interesting to add a new one to the list, and he switched to one of our other themes, namely writing software for which the results can be guaranteed.
His first task is to answer the question: How fast can we factor ``small'' integers, say around 200 bits (for elliptic curve related stuff), or 80 bits (as a tool in the implementation of more elaborate factorization algorithms). This forms the core of his library TIFA (Tools for Integer FActorisation), containing CFRAC and SIQS for a start.