Talk:RSA code: Difference between revisions
Content added Content deleted
(→Split the task?: prime link) |
m (→Split the task?: rsa 129 link) |
||
| Line 32: | Line 32: | ||
:::::: [http://shop-js.sourceforge.net/crypto2.htm js key gen demo] |
:::::: [http://shop-js.sourceforge.net/crypto2.htm js key gen demo] |
||
:::::: [http://www.prime-numbers.org/ prime number source] - I've requested a few over 5 billion and will post some |
:::::: [http://www.prime-numbers.org/ prime number source] - I've requested a few over 5 billion and will post some |
||
:::::: [http://www.willamette.edu/~mjaneba/rsa129.html RSA 129 numbers] |
|||
:::::Character blocking/unblocking could be a whole other task. In fact we could clone the page and mark everything needs improvement (get the rsa out). This task needs more specification. The example text would encode ha as 0801 which is a character set size of 100 not the 31 or 32 shown. I think some of the code examples used base 30ish. This kind of task is common but unrelated to encryption. Older operating systems used to encode characters in 6 rather than 8 bits yielding 4 characters per 3 bytes, printable mappings as well. |
:::::Character blocking/unblocking could be a whole other task. In fact we could clone the page and mark everything needs improvement (get the rsa out). This task needs more specification. The example text would encode ha as 0801 which is a character set size of 100 not the 31 or 32 shown. I think some of the code examples used base 30ish. This kind of task is common but unrelated to encryption. Older operating systems used to encode characters in 6 rather than 8 bits yielding 4 characters per 3 bytes, printable mappings as well. |
||