CRYPTO1 - The Bytelandian Cryptographer (Act I)
The infamous Bytelandian Bit-eating Fanatic Organisation (BBFO for short) plans to launch an all-out denial-of-service attack on the Bytelandian McDecimal's fast food network by blocking the entrance to every restaurant with a camel (the purpose being to rid the Organisation of unhealthy competition, obviously). In a sly and perfidious move, the head cryptographer of BBFO decided to disclose the date and time of the planned attack to the management of McDecimal's, but in encrypted form (ha ha). He calculated the number of seconds from midnight 1970.01.01 GMT to the moment of attack, squared it, divided it by 4000000007 and sent the remainder by e-mail to McDecimal's. This made the original date impossible to decode.
Or did it?
You work as the head algorthimist at McDecimal's HQ and know nothing of what is happening in Byteland. Things are not going well. You are playing a quiet game of hearts against your computer and wondering why on earth Management are considering making you redundant. Suddenly, the CEO bursts into your office, saying:
- Look here, young man[lady]! I have this number and those guys claim it is supposed to be some date. I am giving you one second to tell me what it all means!
I am afraid you have no choice. You can't ask any further
You just have to answer, now.
The encrypted timestamp.
The decrypted GMT time and date of attack, somewhere between 1970 and 2030, using standard 26 character formatting.
Sun Jun 13 16:20:39 2004
for the given output, the input should be 1749870178.What is wrong????
there are two soln to above problem 1087143639 and 2912856368. First one gives the output as Sun Jun 13 21:50:39 2004Last edit: 2013-04-12 09:01:44
How is it even possible to solve this with TEXT??????
I guess the answer is expected to be integer
if there are multiple answers, how would we know which use? beacouse for the same number the answers could be, int theory, infinite.
George Bezerra [UnB]:
@Nagoorkani A: x would be 1087143639 and not 1087136439 as you stated. f(x) given by the example is correct.
encryption seems to be f(x) = x^2 mod p
4000000007 is prime, so i guess trying to factor out some trials isn't going to help. thus, i'm stuck at brute-force. i'll have to come back to this one when it's earlier in the day. :)
.:: Jarv1s ::.:
as the square of max timestamp(i.e. 3580269465600000000) is much larger than 4000000007,hence there can be more than one solutions for a decoded timestamp can exist.