Quantum computers evolution and the enormous effect of their computation speed is one of the main topics of every scientific gathering today. This massive computation power of theirs will enable them to solve some problems which are unfeasible to solve, even with the use of the strongest classic super computers available today. Cryptographies, which we use for military and non-military applications today, are based on computational hardness of some problems like factorization of a big number or computing discrete log. Post quantum cryptography will be the only solution left to protect our data in the era of converting to quantum world, as they are believed to be resistant to both classical and quantum attacks and also can be exploited without needing quantum infrastructures. By introducing and studying post quantum cryptographies in this work, we tried to propose necessary strategies to employ post quantum cryptographies in I. R. I including armed forces. For this purpose, after reviewing classical cryptographies, we would introduce post quantum cryptographies and we would present the reasons to exploit post quantum cryptographies. After that we would use SWOT method and elite experts of quantum technologies and information security’ s opinion through step-by-step questionnaires, to perform gap analysis and propose strategies to utilize post quantum cryptography in all sectors and forces of Islamic Republic of Iran. Outputs of this research show that I. R. I is on WT sector for post quantum cryptography deployment and proper strategies to encounter the related threats and covering weaknesses of this sector can briefly be stated as: 1) Establishing a national center to specify and approve standard and accepted post quantum cryptographies. 2) Motivating Iranian post quantum experts and elite for collaboration and participation. 3) Fundraising and attracting governmental and private organizations on importance of this field. 4) Providing educational and information sharing infrastructure.

There have been encrypted connections among human societies for sending confidential messages a long time ago. In the history of Iran also many encryption lines have been used by crypto-writers. With the telegraph introduction, the old encryption lines were out of use. by the invention of new lines, they got used in confidential conversations and reports. This research's central question is to find how the former lines got removed, and Iranian crypto-writers invented the new ones. This research aims to view Iranian crypto-writers' attempts to find a solution for encryption connections through a security canal in Qajar periods. In this research, we have used library resources, especially lithography books and documents. The use of developmental encryption in encrypted connections, especially in telegraph, resulted from the extending political and economic relationship with the western world and being familiar with the modern west cryptography and finding the simple usage rather than the traditional one in the Qajar period. Hence, some Iranian crypto-writers made new encrypted lines with the necessary assurance for sending the internal and external encrypted messages.

In this paper, we propose public key cryptography using recursive block matrices involving generalized Fibonacci numbers over a finite field $\mathbb{Z}_{p}$. For this, we define multinacci block matrices, a kind of upper triangular matrix involving multinacci matrices at diagonal places and give some of its algebraic properties. Moreover, we set up a method for key element agreement at end users, which makes cryptography more efficient. The proposed cryptography comes with a large key space and its security relies on the Discrete Logarithm Problem (DLP).

Visual cryptography is one of the newest techniques is image encryption. Visual cryptography encrypts visual information and generates two or more shares which contain no information separately, but reveal the secret when superposed. The main advantage of this scheme is that the decoding process does not need any knowledge of cryptography and human visual system is able to decrypt the secret message. In this article, a new encryption method based on particle swarm optimization is provided. The basis matrices are obtained using this approach and then used for encryption. In previous work, a Genetic Algorithm based method was proposed. In our work we fix a subtle yet crucial bug in the GA based method which is generating pictures with negative contrast in some cases and propose a simpler alternative. Simulation results show that the proposed method meets all the initial conditions of visual cryptography while decreasing the number of function evaluations and can provide a contrast enhancement. Moreover, the proposed method has the advantage of being generic and can be used in various threshold based visual cryptography.

With the advent of computers and quantum algorithms, the security of current public key cryptography systems can face challenges. Breaking the current cryptographic structures would require multi-million qubit quantum computers, which have not yet been built; however, with significant advancements in quantum technology by leading companies in this field and the concern within the cryptography community, there has been a felt need to quickly provide countermeasures. In 2016, the National Institute of Standards and Technology (NIST) sought proposals from around the world to standardize post-quantum cryptographic schemes to address this issue. At that time, the McEliece code-based encryption system (and its equivalent Niederreiter system), despite being proven resistant to both classical and quantum algorithms, was not accepted due to its large public keys. Ultimately, the Classic McEliece, HQC, and BIKE encryption systems, which fall under code-based cryptography, advanced to the final stage of these competitions, and the winners of this cryptographic category will be announced by the end of 2024. This paper aims to review the developments made to optimize code-based structures and to examine the selected code-based cryptographic schemes and the latest status of Classic McEliece standardization.

Now days, sharing data in communication systems and computers require high levels of Information security. Side channel attack is one of the methods which it is applied to attack cryptographic systems such as smart cards. In this paper, a new approach for countermeasuring cryptographic algorithms has been proposed and implemented on FPGA. The scheme is based on using Phase Locked Loop in AES algorithm which by disturbing power consumption pattern and execution time of different rounds, the resistance of the algorithm against power attack has been increased. Masking and hiding technique has been used to protect the encryption key. Overall, the proposed method has been simulated within TSMC 65nm technology platform and outstanding success has been obtained; in applying the technique to AES, the overhead was 13% in CMOS area, 15% in power consumption, 2% decrease in working frequency while finding the key became difficult for attackers. In addition, the proposed method has been implemented on FPGA and satisfactory results have been obtained for an acceptable number of samples of the power trace.

We consider a new class of square Fibonacci $(q+1)\times(q+1)$-matrices in public key cryptography. This extends previous cryptography using generalized Fibonacci matrices. For a given integer $q$, a $(q+1)\times(q+1)$ binary matrix $M_{q}$ is a matrix which nonzero entries are located either on the super diagonal or on the last row of the matrix. In this article, we have proposed a modified public key cryptography using such matrices as key in Hill cipher and key agreement for encryption-decryption of terms of $M_{q}$-matrix. In this scheme, instead of exchanging the whole key matrix, only a pair of numbers needed to be exchanged, which reduces the time complexity as well as the space complexity of the transmission and has a large key space.

Anonymous networks provide data confidentiality and anonymity as two important factors through the Internet. In recent years, with growing of quantum computing and also newly performed attacks, it's necessary to reform classic anonymous networks like Tor. So we need a new architecture which is quantum- resistant. In the other side, this is important to block attacks like user identity detection so we need to revise classic structures. In this paper, we propose a lattice-based architecture which includes NTRU cryptographic system and NSS digital signature. Finally, the structure of the anonymous networks has been revised according to the performance requirements and security issues. The proposed architecture should be quantum-resistant that is investigated within highly practical security analysis.