|
|
|
 |
Search published articles |
 |
|
Showing 7 results for Moradi
Mahdi Ahmadipari, Meysam Moradi,
Volume 4, Issue 1 (9-2015)
Abstract
In recent years, the use of Meta-heuristic algorithms on various problem taken into consideration. Meta-heuristic algorithms in solving various problem, different performance show. An Meta-heuristic algorithm to solve a particular problem may have better performance than other algorithms and poorer performance have in other issue. In this study the performance of Meta-heuristic algorithms for a specific problem that explore cryption key Vigenere encryption algorithm will be examined. And Meta-heuristic different algorithms performance in terms of accuracy and speed of convergence of the results will be cryptanalyzed and the best algorithm is selected
Dr Reza Alimoradi,
Volume 4, Issue 2 (3-2016)
Abstract
In public key cryptography, systems based on integer factorization problem are increasing replaced by systems based on discrete logarithm problem (DLP). In fact, Elliptic curve cryptography(ECC) makes the key size much smaller than similar RSA systems do that is why ECC became very popular among cryptography system designers. The designers always need to get to a cryptography system with the smallest key size the highest security. Thus they tend to use hyper elliptic curve in cryptography. In this paper, we will study how to use this type of curves in cryptography.
Also, this study takes a look at these curves’ resistance against algorithms of solving the discrete logarithm problem. Energy consumed for implementation of the scalar multiplication in hyper elliptic curves of the genus g<5 will be analyzed too.
Mahtab Roozbahani, Meysam Moradi, Parvaneh Mansoori,
Volume 5, Issue 1 (9-2016)
Abstract
In mathematics and computer science an optimization problem, the problem is finding the best solution among all possible solutions. Given the importance of the knapsack in computer sciences, different algorithms are used to solve it. Knapsack problem is a combinational problem of selectivity and the purpose of solving the most benefit by taking the capacity is the tolerable knapsack. Since the knapsack is a problem of constrained maximization. In this study, a mathematical model in the form of a function unlimited minimization and designed for it, hen this model on Particle Swarm Optimization , Firefly Algorithm and Artificial Bee Colony has been implemented in MATLAB software environment, The results show that the artificial bee colony algorithm, the model is better than the other two algorithms .The advantage of this model is the objective function , because minimization and unlimited models , to implement with many Bio-Inspired algorithms.
Meysam Moradi, Mahdi Abbasi,
Volume 7, Issue 2 (3-2019)
Abstract
For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algorithm has been used as a complete search algorithm, genetic algorithm as an evolutionary intelligence algorithm, and standard particle swarm as an optimization a swarm intelligence as algorithm. Along with these algorithms, a genetic algorithm has been also introduced by adjusting and designing the parameters and design algorithms has been introduced to discover of crypt key. There are attempts to evaluate the performance of different algorithms for cryptanalysis of the SDES encryption algorithm.
Javad Moradi, Majid Ghayoori Sales,
Volume 7, Issue 2 (3-2019)
Abstract
Data is one of the most valuable assets in today's world and is used in the everyday life of every person and organization. This data stores in a database in order to restore and maintain its efficiently. Since there is a database that can be exploited by SQL injection attacks, internal threats, and unknown threats, there are always concerns about the loss or alteration of data by unauthorized people. To overcome these concerns, there are several security layers between the user and the data in the network layer, host, and database. For instance, security mechanisms, including firewall, data encryption, intrusion detection systems, etc., are used to prevent infiltration. Database Intrusion Detection System uses a variety of data mining techniques to detect abnormalities and detect malicious and intrusive activities. In this paper, a category of intrusion detection techniques is presented first in the database, and a review of the general algorithms for intrusion detection in databases is demonstrated. Since signature-based methods are elder and less complex and less diverse, the main focus of this paper is on behavioral methods.
Mr Mohammad Hossein Noorallahzadeh, Mr Ahmad Gholami, Mr Reza Alimoradi,
Volume 9, Issue 2 (2-2021)
Abstract
With the advent of cloud computing, data owners tend to submit their data to cloud servers and allow users to access data when needed. However, outsourcing sensitive data will lead to privacy issues. Encrypting data before outsourcing solves privacy issues, but in this case, we will lose the ability to search the data. Searchable encryption (SE) schemes have been proposed to achieve this feature of searching encrypted data without compromising privacy. This method will protect both the user's sensitive information and the ability to search for encrypted data. In this article, we review the various SE designs. In this review, we present the classification of SE designs: symmetric searchable encryption, public key searchable encryption, and search attribute-based encryption schemes, and then a detailed discussion of SE designs in terms of index structure. And provide search functionality. There is also a comparison of SE design analysis in terms of security, performance and security. In addition, we talked about the challenges, leading directions and applications of SE schemes.
Mohammad Dakhilalian, Masomeh Safkhani, Fatemeh Pirmoradian,
Volume 12, Issue 1 (9-2023)
Abstract
Providing all remote services requires mutual authentication of participating parties. The framework by which this authentication is done is called authentication protocols. In other words, cryptographic or cryptographic protocol is a distributed cryptographic algorithm that establishes interactions between at least two or more hosts with a specific purpose. In fact, these protocols have provided secure and insecure channels for communication between the parties participating in the protocol. Usually, secure channels are used for registration and insecure channels for mutual authentication. After registering on the server and verifying its identity by the server, the user can benefit from the services provided by the server. Many authentication protocols have been proposed in fields such as e-medical care, Internet of Things, cloud computing, etc. The privacy and anonymity of users in these plans is the biggest challenge in implementing a platform to benefit from remote services. Due to the fact that authentication of users takes place on the insecure platform of the Internet, it can be vulnerable to all existing Internet attacks. In general, there are two methods to analyze and prove the security of authentication protocols. Formal method and In-formal method. The In-formal method, which is based on intuitive arguments, analyst's creativity and mathematical concepts, tries to find errors and prove security. While the formal method, which is done both manually and automatically, has used a variety of mathematical logics and automatic security analysis tools. Manual method using mathematical models such as Real Or Random and mathematical logics such as BAN logic, GNY logic, etc., and automatic method using AVISPA, Scyther, ProVerif, TAMARIN, etc. tools. In fact, the methods of proving and analyzing the security of security protocols are divided into two general categories based on proof of theorem and model verification, and in this article, the details of each of these methods of proving security are explained. It should be noted that most of the security protocol verification tools are based on model verification. The methods based on model checking and then the methods based on proving the theorem are described.
|
|
