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. 3722413721597234206507650923983285120166901260478730869 6736638976638615758622997116823310767096086080786804802 1836714918194979944137126492369500940937915708565964527 6200450286565486196074388059858603808398976724101400303 5750288060945256026702605821838960267473373177639409286 5832816355098275829201875849607446439291341167953035910 5663374800875719056491076033940220393576824222551138258 6371670599832070641542158304833756560944630944109070063 6200450286568057203187204796088787244633533579439898834 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.