Looking forward of my first article since 2009 to appear in IEEE volume early next year! It has been accepted along with the talk that has been delivered as part of MIPT EnT Conference http://www.en-t.info/ieee-articles-en.shtml . Thank you very much to Oksana Trushina for helping to make this happen!
We were focusing on Code-Based Cryptosystems and how they evolve since 197x. https://dasiopia.com/projects/code-based-cryptosystems-evolution/
Did you know that one of them (McEliece system) is a candidate to become a post-quantum cryptography standard?
And as always expressing my deepest gratitudes to E. Gabidulin and N. Pilipchuck.
Last year MIPT EnT papers can be found here: http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7807456
12 April, 2009.
Cosmonautics Day is an anniversary celebrated in Russia and former USSR countries.
That day I’ve landed in Australia. 8 years ago. And look… I survived!
We’ve visited The Canberra Deep Space Communication Complex (CDSCC) last Sunday and being there we even didn’t fully realised how lucky we were.
The fact is that the complex were receiving the signal from Voyager that day!
If you want to know what is happening with all radio telescopes in real life you would probably like to visit: http://eyes.nasa.gov/dsn/dsn.htm
We are waiting for first [working] q.computer for ages. I do remember lots of articles and news and of course speculation around q.computing and especially q.cryptography in early 2K. Post-quantum cryptography, how would you look like?
“New q. generation would kill all existing cryptosystem based on the practical difficulty of factoring the product of two large prime numbers, the factoring problem !” – said journalists. And everyone were filled up with awe.
Well new q.generation of machines means only that we might need to consider another options for widely used algorithms including public key systems like RSA.
Do we have something except well known RSA? Yes we do… indeed, not joking, we have lots of different algorithms and even approaches. It just easy to use well known library rather then right and spend nights testing something new, which might become vulnerable in one day.
Linear codes cryptosystems family. Those systems are based on … right, linear codes! but those codes are made to correct errors you would say, not encode/decode messages. Well in the first instance, yes. But all technological discoveries are cross-disciplinary, based on classical concepts and grow between scientific branches.
Let’s have a look at McEliece or similar (in fact opposite) Niederreiter cryptosystems which was invented in 1986. That’s actually a very cool idea to use error detection mechanism to encrypt/decrypt messages. Just imagine they use a syndrome as ciphertext and the message treat as an error pattern.
The original Niederreiter system was cracked in 1992 by Sidel’nikov&Shestakov. Since that time lots of crypto-strong (yeah, until someone else would find a way to crack them) modifications have been proposed and designed. If you know Russian please have a look at existing linear codes based algorithms review . Yeah, I should find time and energy to translate it into English some day…
One of those modifications is Frobenius matrix based modification my supervisor E.Gabidulin with assistance of myself in 2009.
DROWN is a cross-protocol attack that uses weaknesses in the SSLv2 implementation against transport layer security (TLS), and that can “decrypt passively collected TLS sessions from up-to-date clients.”
Here more info:
they are showing how to fix it, but….
for Python it’s not really too bad because of the buffer size which is quite bigger than Java’s one…
but the fix much, much slower 😦
Вот такую трехмерную снежинку вчера сделали.
Хорошая идея для оформления детских праздников.
25 марта 1923-17 февраля 2012
It will be the revolution in Moscow soon, am I right?