Anonymous user
Talk:RSA code: Difference between revisions
→Draft
(→Draft) |
(→Draft) |
||
Line 21:
::: If blocking is arbitrary, perhaps blocking should be removed from the task description? The Python implementations currently use a block size of 1 character, and the blocking code adds some significant complexity, so why not just get rid of it? --[[User:Rdm|Rdm]] 11:45, 22 April 2011 (UTC)
::::I've been thinking about this and I see two tasks here. Let me explain.
:::::RSA should be about encryption/decryption. The problem is the demonstration numbers are too small for multiple ascii characters. Finding one or two sets of larger numbers would allow for this and remove the need for the blocking and some of the resulting constraints. RSA has no problem with zeros. Nor does it char about ascii, ebcdic, double-byte, etc. RSA also requires bignum support so having some numbers that exercise that would make sense. I was poking around looking for some, thinking of the smaller RSA challenges (140 bit) but haven't yet found the whole set of numbers. I think running a test message through a couple of different RSA key pairs would make a fine task.
:::::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.
:::::I also agree the huge UI thing didn't belong here. Possible another task.
:::: --[[User:Dgamey|Dgamey]] 14:15, 22 April 2011 (UTC)
==Blocking?==
| |||