Number Systems and Cryptography, some examples

Number systems are behind a lot of implementations. The role of representation is often underrated while its importance in implementation is crucial. We survey here some classes of fundamental systems that could be used in crypotgraphy. We present three main categories:<br/> - systems based on the Chinese Remainder Theorem which enter more generally in the context of polynomial interpolation,<br/> - exotic positional number representations using original approaches,<br/> - systems adapted to operations like the exponentiation.<br/> We stay at the level of the representation system, we do not deal with all the decomposition forms that can be used for accelerating the computation.<br/> lien: http://desktop.visio.renater.fr/scopia?ID=728862***9707&autojoin