| 摘要 |
The invention uses a correspondence table between first sets of at least one number, expressed in accordance with a signed code where each number may have the value of 0, 1 or 1, and second sets of at least one number, expressed according to a simple form where each number may have the value 0 or 1. On the basis of said table, the method consists in a conversion with means comprising: breakdown means for breaking down said sequence of numbers into sets of numbers present in said correspondence table; retrieval means for retrieving from said correspondence table or equivalent, for each set of numbers derived from the breakdown, the corresponding set of numbers given by said correspondence table; and compiling means for compiling a sequence of numbers from said sets thus retrieved by the retrieval means. The invention is in particular useful is various algorithms, such as in cryptography, for example to store values in signed binary mode, in compact non-adjacent form with only the numbers 0, 1 and/or for rapidly producing random numbers in said non-adjacent form.
|
