Hillrunner
Sep24-10, 01:30 PM
Hey folks,
I have a bit of a brain teaser I'm stumped on at the moment. I have an encrypted message I could use some help decrypting. The encryption algorithm is as follows: Read the plain text into 16 character blocks. Each such block will be converted to a BigInteger by treating it as a 16 digit number in a base 128 number system. (The ASCII code of a character is 7 bits.) Incomplete blocks should be padded up by blanks at the end. This will produce a sequence of
BigIntegers representing the block-by-block encoding of the plain text input. Then those BigIntegers will be encrypted by multiplying each by a BigInteger (the Key) that is supposed to be secret.
This is very straight forward and easy to implement, but decrypting a secret message without the key is my current goal. If you are up for the challenge give this a shot and keep me posted on the results.
37224137215972342065076509239832851201669012604787 30869
67366389766386157586229971168233107670960860807868 04802
18367149181949799441371264923695009409379157085659 64527
62004502865654861960743880598586038083989767241014 00303
57502880609452560267026058218389602674733731776394 09286
58328163550982758292018758496074464392913411679530 35910
56633748008757190564910760339402203935768242225511 38258
63716705998320706415421583048337565609446309441090 70063
62004502865680572031872047960887872446335335794398 98834
Again, this would be divided by the secret key, and then the plain text could be derived by modding and dividing by 128 and converting into ascii.
I have a bit of a brain teaser I'm stumped on at the moment. I have an encrypted message I could use some help decrypting. The encryption algorithm is as follows: Read the plain text into 16 character blocks. Each such block will be converted to a BigInteger by treating it as a 16 digit number in a base 128 number system. (The ASCII code of a character is 7 bits.) Incomplete blocks should be padded up by blanks at the end. This will produce a sequence of
BigIntegers representing the block-by-block encoding of the plain text input. Then those BigIntegers will be encrypted by multiplying each by a BigInteger (the Key) that is supposed to be secret.
This is very straight forward and easy to implement, but decrypting a secret message without the key is my current goal. If you are up for the challenge give this a shot and keep me posted on the results.
37224137215972342065076509239832851201669012604787 30869
67366389766386157586229971168233107670960860807868 04802
18367149181949799441371264923695009409379157085659 64527
62004502865654861960743880598586038083989767241014 00303
57502880609452560267026058218389602674733731776394 09286
58328163550982758292018758496074464392913411679530 35910
56633748008757190564910760339402203935768242225511 38258
63716705998320706415421583048337565609446309441090 70063
62004502865680572031872047960887872446335335794398 98834
Again, this would be divided by the secret key, and then the plain text could be derived by modding and dividing by 128 and converting into ascii.