dissass SimpleCryptographer
А вот в большинство случаев корни не помагают вообще даже если е=3, т.к. числа больше модуля...Думаю NIST другое имели ввиду...
Цитата: "The NIST Special Publication on Computer Security (SP 800-78 Rev 1 of August 2007) does not allow public exponents e smaller than 65537,...
UbIvItS Да. Мне нужно из своего output.bin сделать input.bin, которое потом с "досовской реализации" трансформировалось правильно опять в...
UbIvItS А ты его понял? Кто нибудь здесь его понял? Наверное он мне объяснял как найти точных кубов...Ето не подойдет для таких больших...
Ruptor Yes, so far I don't. Do I have to? I just wanted to know what is n-residue format. I skimmed through MIRACL docs again today after your...
Ruptor BTW: output.bin is in binary form - it is 100% a message and I know the meaning of every byte in it. It does not need any conversion except...
Ruptor How? And then what when I have several primes?
flankerx I've tried it with the output.bin (in reversed order of bytes, of course). So far it has found the following: PRIME FACTOR: 2 PRIME...
flankerx Sorry for incompetence, but what should be done with the factored message? Is there a software that is already made with which I could...
Ruptor What's the difference between factoring a 1536 bit modulus and a message of the same length?
Ruptor The message consists of 12 AES encryptions of constants 0-b with a single key...One of them is partially overwritten with a string. Does...
Ruptor Added: I've experimented with the given input (which appears to be in n-residue format) and failed with the big number calculator! Why?...
Ruptor Thank you for your competent directions. Could you tell me what is so specific about this Montgomery implementation that I am unable to...
deleted
Имена участников (разделяйте запятой).
