To see the other types of publications on this topic, follow the link: Asymmetric Algorithm.
Journal articles on the topic 'Asymmetric Algorithm'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Asymmetric Algorithm.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Maxrizal, Maxrizal, and Baiq Desy Aniska Prayanti. "Application Of Rectangular Matrices: Affine Cipher Using Asymmetric Keys." CAUCHY 5, no. 4 (2019): 181. http://dx.doi.org/10.18860/ca.v5i4.4408.
Full textAbstract:
<p class="Abstract">In cryptography, we know the symmetric key algorithms and asymmetric key algorithms. We know that the asymmetric key algorithm is more secure than the symmetric key algorithm. Affine Cipher uses a symmetric key algorithm. In this paper, we introduce the Affine Cipher using asymmetric keys. Asymmetrical keys are formed from rectangular matrices.</p>
2
DM, Kuryazov. "Optimal Asymmetric Data Encryption Algorithm." International Journal of Science and Research (IJSR) 10, no. 1 (2021): 744–48. https://doi.org/10.21275/sr21107160459.
Full text
3
Karunarathne, J. R. M. D. B., Tharindu Wijethilake, and C. Keppitiyagama. "An Evaluation of Multipath TCP with Highly Asymmetric Subflows." International Journal on Advances in ICT for Emerging Regions (ICTer) 17, no. 1 (2024): 56–65. http://dx.doi.org/10.4038/icter.v17i1.7278.
Full textAbstract:
Multipath TCP (MPTCP) is an extension of the Transmission Control Protocol (TCP) that allows the simultaneous use of multiple available network interfaces to transmit and receive data. MPTCP can improve the throughput, lower the latency, and provide higher resilience to network failures. MPTCP creates a number of network connections (subflows) between the destination and presents a single endpoint to the application. MPTCP schedulers multiplexe data over subflows based on their end-to-end path metrics. In this study, we found that the presence of asymmetric links within an MPTCP connection can lead to suboptimal performance. We explored the architecture of the Linux implementation of MPTCP and identified the design choices that lead MPTCP to underperform in the presence of highly asymmetric links. To test the behaviour of MPTCP an emulation testbed was built using the Mininet emulator. We conducted comprehensive experiments in this controlled environment to analyze MPTCP behavior under asymmetric subflows in terms of bandwidth and latency. We designed a novel scheduling algorithm tailored to mitigate the impact of asymmetric subflows and implemented it in the Linux kernel. Building a scheduling algorithm for MPTCP in the Linux kernel is not a straightforward task. Several iterations of the algorithm had to be investigated in order to develop a practically deployable algorithm. The proposed algorithms were implemented in the Linux Kernel and were tested in the testbed. These algorithms were tested for their suitability to be used over highly asymmetric links under several test scenarios. Finally, we proposed the “Extended Dynamic Scheduler Algorithm” which observes the MPTCP connection and adjusts its subflows to limit the effect of asymmetric subflows in the MPTCP connection. The algorithm also has its own kickback policy where the throughput of the connection starts to improve when the asymmetry of the subflows decreases.
4
Narasimha Nayak, V., M. Ravi Kumar, K. Anusha, and Ch Kranthi Kiran. "FPGA based asymmetric crypto system design." International Journal of Engineering & Technology 7, no. 1.1 (2017): 612. http://dx.doi.org/10.14419/ijet.v7i1.1.10788.
Full textAbstract:
In the network security system cryptography plays a vital role for the secure transmission of information. Cryptography is a process of integrating and transferring the data to the genuine users against any attacks. There are two types of Cryptographic algorithm: Symmetric and Asymmetric algorithms. In the symmetric type cryptography, single key is used for both encryption and decryption. Symmetric algorithms are fast and simple. Asymmetric cryptographic algorithm uses different keys such as public key to encrypt the message at sender and private key which is known only to receiver for decrypting the encrypted message. Asymmetric algorithms are more secure and difficult, to decrypt the message unless hacker acquires the knowledge of private key. A new Asymmetric algorithm with Error Detection and Correction mechanism is proposed that can reduce hardware, and improves decryption time and security. Proposed Asymmetric algorithm uses the few properties of: RSA, Diffie-Hellman and ElGamal Algorithms. Performance of asymmetric algorithms is compared with proposed algorithm, which is designed using Verilog HDL. Algorithms are synthesized, simulated, implemented using Vivado and targeted for Artix-7 XC7A100T-1CSG324Carchitecture.Chipscope Pro logic analyzer-Virtual Input Output core is binded to design for hardware debugging, to monitor and capture the output signals at selected specified state by applying random input stimuli at runtime in Nexys4 DDR FPGA Board.
5
Kulkarni, P., and D. Dutta. "An Investigation of Techniques for Asymmetry Rectification." Journal of Mechanical Design 117, no. 4 (1995): 620–26. http://dx.doi.org/10.1115/1.2826730.
Full textAbstract:
This paper is concerned with symmetry and asymmetry in objects. Earlier studies on the subject have dealt with the detection of symmetry. We study the problem of asymmetry rectification, i.e., given an asymmetric profile, suggest geometric changes to make it symmetric. We have investigated two techniques for asymmetry rectification. This paper reports on the techniques and the results. First, we analyze the problem using skeleton representations and propose a simple algorithm for rectifying asymmetric convex profiles. Next, we outline an optimization scheme for the rectification of convex and nonconvex profiles, in 2D and 3D. Implemented examples are presented for both algorithms.
6
Zafarani, Mohammad M., Amir M. Halabian, and Saeed Behbahani. "Optimal coupled and uncoupled fuzzy logic control for magneto-rheological damper-equipped plan-asymmetric structural systems considering structural nonlinearities." Journal of Vibration and Control 24, no. 7 (2016): 1364–90. http://dx.doi.org/10.1177/1077546316660030.
Full textAbstract:
The main motivation of this paper is to examine the effect of structural nonlinearities on the engineering demand parameters (EDPs) of seismically excited controlled plan-asymmetric buildings equipped with magneto-rheological dampers. The development of a robust control algorithm for asymmetric buildings due to the randomness of ground excitations and their torsional response has always been a significantly challenging task in the vibrations control of structures. While the control algorithm in a simple approach could be designed ignoring the dependency of stiff and flexible edges of EDPs, the present research aimed also to develop a control strategy that mitigates simultaneously asymmetric edge responses of the structure using the multi-input multi-output ability of fuzzy logic control algorithms. In order to alleviate all difficulties to design an admissible control algorithm and attain the desired level of performance, the nondominated sorting genetic algorithm-II is applied. The effectiveness of the proposed controller on the inelastic seismic behavior of a controlled plan-asymmetric one-story structure is evaluated through a parametric study in which asymmetry is considered in the form of unidirectional mass eccentricity. To take the inelastic behavior of a controlled asymmetric building’s members into account, fiber elements modeling is employed. The model was subjected to a uniaxial lateral disturbance, including ordinary and strong ground motions exciting both lateral and torsional motions.
7
Liu, Fei, Changqin Gao, and Lisha Liu. "SK-PSO: A Particle Swarm Optimization Framework with SOM and K-Means for Inverse Kinematics of Manipulators." Symmetry 16, no. 12 (2024): 1667. https://doi.org/10.3390/sym16121667.
Full textAbstract:
In this paper, a particle swarm optimizer that integrates self-organizing maps and k-means clustering (SK-PSO) is proposed. This optimizer generates an asymmetric Cartesian space from random joint configurations when addressing the inverse kinematics of manipulators, followed by K-means clustering applied to the Cartesian space. The resulting clusters are used to reduce the dimensionality of the corresponding joint space using Self-Organizing Maps (SOM). During the solving process, the target point’s clustering region is determined first, and then the joint space point closest to the target point is selected as the initial population for the particle swarm algorithm. The simulation results demonstrate the effectiveness of the SK-PSO algorithm. Given the inherent asymmetry among different algorithms in handling the problem, SK-PSO achieves an average fitness value that is 0.02–0.62 times better than five other algorithms, with an asymmetric solving time that is only 0.03–0.34 times that of the other algorithms. Therefore, compared to the other algorithms, the SK-PSO algorithm offers high accuracy, speed, and precision.
8
MA Abualkas, Yaser, and Arshed Raad Raheem. "Asymmetric New Cryptography Algorithm Based on ASCII Code." International Journal of Science and Research (IJSR) 10, no. 6 (2021): 1–4. https://doi.org/10.21275/sr21528214956.
Full text
9
NIELSEN, THOMAS D., and FINN V. JENSEN. "REPRESENTING AND SOLVING ASYMMETRIC DECISION PROBLEMS." International Journal of Information Technology & Decision Making 02, no. 02 (2003): 217–63. http://dx.doi.org/10.1142/s0219622003000604.
Full textAbstract:
This paper deals with the representation and solution of asymmetric Bayesian decision problems. We present a formal framework, termed asymmetric influence diagrams. The framework is based on the syntax and semantics of the traditional influence diagram, and allows an efficient representation of asymmetric decision problems. As opposed to existing frameworks, the asymmetric influence diagram primarily encodes asymmetry at the qualitative level and it can therefore be read directly from the model. We give an algorithm for solving asymmetric influence diagrams. The algorithm initially decomposes the asymmetric decision problem into a structure of symmetric subproblems organized as a tree. A solution to the decision problem can then be found by propagating from the leaves towards the root using existing evaluation methods to solve the subproblems.
10
Hao, Jiakai, Ming Jin, Yuting Li, and Yuxin Yang. "Neural network-based symmetric encryption algorithm with encrypted traffic protocol identification." PeerJ Computer Science 11 (April 4, 2025): e2750. https://doi.org/10.7717/peerj-cs.2750.
Full textAbstract:
Cryptography is a cornerstone of power grid security, with the symmetry and asymmetry of cryptographic algorithms directly influencing the resilience of power systems against cyberattacks. Cryptographic algorithm identification, a critical component of cryptanalysis, is pivotal to assessing algorithm security and hinges on the core characteristics of symmetric and asymmetric encryption methods. A key challenge lies in discerning subtle spatial distribution patterns within ciphertext data to infer the underlying cryptographic algorithms, which is essential for ensuring the communication security of power systems. In this study, we first introduce a plaintext guessing model (SCGM model) based on symmetric encryption algorithms, leveraging the strengths of convolutional neural networks to evaluate the plaintext guessing capabilities of four symmetric encryption algorithms. This model is assessed for its learning efficacy and practical applicability. We investigate protocol identification for encrypted traffic data, proposing a novel scheme that integrates temporal and spatial features. Special emphasis is placed on the performance of algorithms within both symmetric and asymmetric frameworks. Experimental results demonstrate the effectiveness of our proposed scheme, highlighting its potential for enhancing power grid security.
11
Kozhevnikov, A. V., D. L. Shalaevskii, I. A. Kozhevnikova, A. S. Smirnov, and K. P. Korepina. "Algorithm for designing asymmetrical rolling mode." Ferrous Metallurgy. Bulletin of Scientific , Technical and Economic Information 80, no. 6 (2024): 72–81. http://dx.doi.org/10.32339/0135-5910-2024-6-72-81.
Full textAbstract:
Sliding of the work rolls along the strip is one of the emergency operating modes of the stand, as a result of which the steady rolling process is disrupted and fluctuations in the tension and thickness of the finished strip occur. The work obtained a condition for eliminating roll slippage along the strip in the general case of the technological process, when the diameters of the barrels of the upper and lower work rolls are different. To do this, when calculating the parameters of the asymmetric mode, the following actions are implemented. First, the presence of a leading zone is assessed at the initial surface roughness of the roll barrel. If there is an advance zone in the deformation zone on both sides of the strip, then the fulfillment of the classical gripping condition is checked with the initial surface roughness of the barrels of both rolls reduced by 60%, thereby simulating further wear of this roughness.It has been established that the greatest influence on the occurrence of slippage in the current state of the work roll barrel surface will be exerted by a combination of technology factors – strip compression in the stand, strip tension. The process asymmetry factor has very little effect on the probability of occurrence of the emergency rolling mode considered in the work.As part of the study, the previously developed algorithm for designing continuous rolling technology was improved, taking into account the possibility of roll slippage, incl. when using an asymmetric process.An asymmetric rolling mode created using a newly proposed technique for designing process parameters is presented.The work also demonstrates the influence of the asymmetry factor on the structure of the asymmetric deformation zone. It is shown that with increasing strip tension, the effectiveness of the impact of the difference in the diameters of the barrels of the lower and upper rolls on the source decreases
12
Duan, Banxiang. "The relaxed asymmetric HSS-like iteration algorithms for a class of weakly nonlinear complementarity problems." ITM Web of Conferences 47 (2022): 02004. http://dx.doi.org/10.1051/itmconf/20224702004.
Full textAbstract:
The problem of finding solutions to a class of weakly nonlinear complementarity problems is studied. And then, the authors present the relaxed asymmetric HSS-like iteration algorithm, the asymmetric HSS-like iteration algorithm and the HSS-like iteration algorithm for a class of weakly nonlinear complementarity problems. Under suitable conditions, they establish the convergence theory of the algorithms.
13
Pichai, Supailin, Khamron Sunat, and Sirapat Chiewchanwattana. "An Asymmetric Chaotic Competitive Swarm Optimization Algorithm for Feature Selection in High-Dimensional Data." Symmetry 12, no. 11 (2020): 1782. http://dx.doi.org/10.3390/sym12111782.
Full textAbstract:
This paper presents a method for feature selection in a high-dimensional classification context. The proposed method finds a candidate solution based on quality criteria using subset searching. In this study, the competitive swarm optimization (CSO) algorithm was implemented to solve feature selection problems in high-dimensional data. A new asymmetric chaotic function was proposed and used to generate the population and search for a CSO solution. Its histogram is right-skewed. The proposed method is named an asymmetric chaotic competitive swarm optimization algorithm (ACCSO). According to the asymmetrical property of the proposed chaotic map, ACCSO prefers zero than one. Therefore, the solution is very compact and can achieve high classification accuracy with a minimal feature subset for high-dimensional datasets. The proposed method was evaluated on 12 datasets, with dimensions ranging from 4 to 10,304. ACCSO was compared to the original CSO algorithm and other metaheuristic algorithms. Experimental results show that the proposed method can increase accuracy and it reduces the number of selected features. Compared to different optimization algorithms with other wrappers, the proposed method exhibits excellent performance.
14
Mitra, Pramita, and Christian Poellabauer. "Asymmetric Geographic Forwarding." International Journal of Embedded and Real-Time Communication Systems 2, no. 4 (2011): 46–70. http://dx.doi.org/10.4018/jertcs.2011100104.
Full textAbstract:
Geographic Forwarding (GF) algorithms typically employ a neighbor discovery method to maintain a neighborhood table that works well only if all wireless links are symmetric. Recent experimental research has revealed that the link conditions in realistic wireless networks vary significantly from the ideal disk model and a substantial percentage of links are asymmetric. Existing GF algorithms fail to consider asymmetric links in neighbor discovery and thus discount a significant number of potentially stable routes with good one-way reliability. This paper introduces Asymmetric Geographic Forwarding (A-GF), which discovers asymmetric links in the network, evaluates them for stability (e.g., based on mobility), and uses them to obtain more efficient and shorter routes. A-GF also successfully identifies transient asymmetric links and ignores them to further improve the routing efficiency. Comparisons of A-GF to the original GF algorithm and another related symmetric routing algorithm indicate a decrease in hop count (and therefore latency) and an increase in successful route establishments, with only a small increase in overhead.
15
Kong, Rui, Qiong Wang, Gu Yu Hu, and Zhi Song Pan. "Fuzzy Asymmetric Support Vector Machines." Advanced Materials Research 433-440 (January 2012): 7479–86. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.7479.
Full textAbstract:
Support Vector Machines (SVM) has been extensively studied and has shown remarkable success in many applications. However the success of SVM is very limited when it is applied to the problem of learning from imbalanced datasets in which negative instances heavily outnumber the positive instances (e.g. in medical diagnosis and detecting credit card fraud). In this paper, we propose the fuzzy asymmetric algorithm to augment SVMs to deal with imbalanced training-data problems, called FASVM, which is based on fuzzy memberships, combined with different error costs (DEC) algorithm. We compare the performance of our algorithm against these two algorithms, along with different error costs and regular SVM and show that our algorithm outperforms all of them.
16
Wei, Yingxin, Wei Zhou, Zhiqiang Xie, Ming Sun, Zhenjiang Tan, and Wangcheng Cao. "Integrated Scheduling Algorithm Based on the Improved Floyd Algorithm." Symmetry 17, no. 5 (2025): 682. https://doi.org/10.3390/sym17050682.
Full textAbstract:
In the research and practice of integrated scheduling problems, the tree structure of complex products usually presents an asymmetric and complex form. This asymmetry is mainly reflected in the hierarchical relationship between the various components of the product, the degree of dependence, and the sequence of production processes. Existing studies often neglect that leaf nodes with the lowest layer priority can be scheduled at any moment, leading to underutilization of parallelism potential under symmetric structures and exacerbation of critical path delays under asymmetric structures. Aiming at solving this kind of problem, an integrated scheduling algorithm based on the improved Floyd algorithm (ISA-IFA) is proposed. According to the improved Floyd algorithm, the algorithm proposed a path-weighted strategy, which constructs the vertical path value according to the processing time of the process itself. Combined with the proposed process scheduling advantage strategy, the leaf node process is especially emphasized as the priority scheduling object, which makes the connection between the processes more closely, and then significantly reduces the idle time of the equipment. The empirical results show that the ISA-IFA algorithm shortens the completion time of complex products and simultaneously improves the equipment utilization rate to 55.9%, verifying its effectiveness in dynamic scheduling and resource co-optimization.
17
M.A. Abualkas, Sabreen, and Yaser M. A. Abualkas. "IoT Security: Symmetric and Asymmetric Cryptography using RSA algorithm." International Journal of Science and Research (IJSR) 12, no. 9 (2023): 919–23. http://dx.doi.org/10.21275/sr23906202504.
Full text
18
Jeong, Yeon-Keun, and Kwang-Ryul Baek. "Asymmetric Gait Analysis Using a DTW Algorithm with Combined Gyroscope and Pressure Sensor." Sensors 21, no. 11 (2021): 3750. http://dx.doi.org/10.3390/s21113750.
Full textAbstract:
Walking is one of the most basic human activities. Various diseases may be caused by abnormal walking, and abnormal walking is mostly caused by disease. There are various characteristics of abnormal walking, but in general, it can be judged as asymmetric walking. Generally, spatiotemporal parameters can be used to determine asymmetric walking. The spatiotemporal parameter has the disadvantage that it does not consider the influence of the diversity of patterns and the walking speed. Therefore, in this paper, we propose a method to analyze asymmetric walking using Dynamic Time Warping (DTW) distance, a time series analysis method. The DTW distance was obtained by combining gyroscope data and pressure data. The experiment was carried out by performing symmetrical walking and asymmetrical walking, and asymmetric walking was performed as a simulation of hemiplegic walking by fixing one ankle using an auxiliary device. The proposed method was compared with the existing asymmetric gait analysis method. As a result of the experiment, a p-value lower than 0.05 was obtained, which proved that there was a statistically significant difference.
19
Stupak, Howard D., Alexander L. Ramirez, and Corey S. Maas. "Current Management of the Asymmetric Nose." American Journal of Cosmetic Surgery 22, no. 1 (2005): 45–55. http://dx.doi.org/10.1177/074880680502200107.
Full textAbstract:
The deviated or asymmetric nose poses multiple challenges to the cosmetic and reconstructive surgeon. Diagnosis, surgical planning, and execution are presented in this article in the ordered form of a surgical algorithm. The algorithm utilizes the external rhinoplasty approach to address asymmetries in the following structures in an individualized yet systematic fashion: nasal septum, upper and lower lateral cartilages, the bony dorsum, and the skin/soft-tissue envelope. A number of techniques are discussed here, some restoring native anatomy, others providing simple camouflage. With experience, excellent functional and cosmetic results can be obtained by following this algorithm.
20
Jun-On, Nipa, and Watcharaporn Cholamjiak. "Enhanced Double Inertial Forward–Backward Splitting Algorithm for Variational Inclusion Problems: Applications in Mathematical Integrated Skill Prediction." Symmetry 16, no. 8 (2024): 1091. http://dx.doi.org/10.3390/sym16081091.
Full textAbstract:
This paper introduces a new algorithm that combines the forward–backward splitting algorithms with a double inertial technique, utilizing the previous three iterations. The weak convergence theorem is established under certain mild conditions in a Hilbert space, including a relaxed inertial method in real numbers. An example of infinite dimension space is given with numerical results to support our proposed algorithm. The algorithm is applied to an asymmetrical educational dataset of students from 109 schools, utilizing asymmetric inputs as nine attributes to predict the output as students’ mathematical integrated skills. The algorithm’s performance is compared with other algorithms in the literature to demonstrate its effectiveness. The proposed algorithm demonstrates comparable precision, recall, accuracy, and F1 score but performs a relatively lower number of iterations. The contributions of each performance aspect to the mathematical integration skill of students are discussed to improve students’ mathematical learning.
21
Xu, Qiuyan, and Zhiyong Liu. "Alternating Asymmetric Iterative Algorithm Based on Domain Decomposition for 3D Poisson Problem." Mathematics 8, no. 2 (2020): 281. http://dx.doi.org/10.3390/math8020281.
Full textAbstract:
Poisson equation is a widely used partial differential equation. It is very important to study its numerical solution. Based on the strategy of domain decomposition, the alternating asymmetric iterative algorithm for 3D Poisson equation is provided. The solution domain is divided into several sub-domains, and eight asymmetric iterative schemes with the relaxation factor for 3D Poisson equation are constructed. When the numbers of iteration are odd or even, the computational process of the presented iterative algorithm are proposed respectively. In the calculation of the inner interfaces, the group explicit method is used, which makes the algorithm to be performed fast and in parallel, and avoids the difficulty of solving large-scale linear equations. Furthermore, the convergence of the algorithm is analyzed theoretically. Finally, by comparing with the numerical experimental results of Jacobi and Gauss Seidel iterative algorithms, it is shown that the alternating asymmetric iterative algorithm based on domain decomposition has shorter computation time, fewer iteration numbers and good parallelism.
22
Verma, Rohit, and Jyoti Dhiman. "Implementation of Improved Cryptography Algorithm." International Journal of Information Technology and Computer Science 14, no. 2 (2022): 45–53. http://dx.doi.org/10.5815/ijitcs.2022.02.04.
Full textAbstract:
A network is an interconnected group of independent computing devices which uses a different set of protocols to communicate with each other independently and meaningfully. This communication should be carried out securely. Due to different attacks, this security sometimes gets compromised. So, to communicate securely different cryptography algorithms are used i.e., symmetric and asymmetric algorithms. Cryptography helps to achieve authentication, confidentiality, integrity, non-repudiation, and availability of data. Nowadays many algorithms provide security to data but these algorithms have various security flaws. To improve the strength of these algorithms, a new security protocol is designed using features of symmetric key and asymmetric key algorithms. The security principles can be achieved by AES and RSA algorithms. The main purpose of designing this algorithm is to provide better security to data in transit against passive as well as from active attacks. The new proposed hybrid algorithm is implemented in MATLAB R2019a. This algorithm will be analysed and compared on three parameters like avalanche effect, performance, and security against attacks. The proposed model will contribute towards improving the excellence of educators and academics, as well as increase competitiveness of educational programmes on cybersecurity among similar institutions in the EU countries.
23
Ahmed, Zakir Hussain. "A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem." Mathematical Problems in Engineering 2011 (2011): 1–18. http://dx.doi.org/10.1155/2011/750968.
Full textAbstract:
A simple lexisearch algorithm that uses path representation method for the asymmetric traveling salesman problem (ATSP) is proposed, along with an illustrative example, to obtain exact optimal solution to the problem. Then a data-guided lexisearch algorithm is presented. First, the cost matrix of the problem is transposed depending on the variance of rows and columns, and then the simple lexisearch algorithm is applied. It is shown that this minor preprocessing of the data before the simple lexisearch algorithm is applied improves the computational time substantially. The efficiency of our algorithms to the problem against two existing algorithms has been examined for some TSPLIB and random instances of various sizes. The results show remarkably better performance of our algorithms, especially our data-guided algorithm.
24
Holló-Szabó, Ákos, and János Botzheim. "Bacterial Memetic Algorithm for Asymmetric Capacitated Vehicle-Routing Problem." Electronics 11, no. 22 (2022): 3758. http://dx.doi.org/10.3390/electronics11223758.
Full textAbstract:
The vehicle-routing problem (VRP) has many variants, including the most accurate models of real-life transportation tasks, making it one of the most important mathematical problems in the field of logistics. Our goal was to design an algorithm that can race against the most recent solutions for VRP and capacitated VRP (CVRP), while also being applicable to real-life models with simulations of real transports. Our algorithm is a variant of the bacterial memetic algorithm (BMA), which we improve upon with novel operators and better methods for manual parameter optimization. The key to our performance is a balanced mixture of the global search of evolutionary algorithms, local search of 2-OPT variants, and the pseudo-global search of probabilistic construction algorithms. Our algorithm benefits from the advantages of all three methods resulting in fast convergence and avoidance of global minima. This is the first time BMA is applied for VRP, meaning that we had to adapt the method for the new problem. We compare our method with some of the most-used methods for VRP on the ABEFMP 1995 dataset. We provide comparison results with the coronavirus herd immunity optimizer, genetic algorithm, hybridization of genetic algorithm with neighborhood search, firefly algorithm, enhanced firefly algorithm, ant colony optimization, and variable neighborhood search. Our algorithm performed better on all data instances, yielding at least a 30% improvement. We present our best result on the Belgium 2017 dataset for future reference. Finally, we show that our algorithm is capable of handling real-life models. Here we are also illustrating the significance of the different parameters.
25
Gorbenko, I. D., Ye G. Kachko, M. V. Yesina, and V. A. Ponomar. "Comparative characteristics of Crystals-Kyber and Skelya key encapsulation algorithms (DSTU 8961-2019)." Radiotekhnika, no. 210 (September 28, 2022): 7–21. http://dx.doi.org/10.30837/rt.2022.3.210.01.
Full textAbstract:
In recent years, there has been a significant amount of research related to the development of quantum computers. If such a computer were to be built, it would be able to break existing public-key cryptosystems that are currently used for many purposes. This will seriously affect the privacy and integrity of digital communications, etc. That is why special attention is currently being paid to post-quantum cryptography, the main goal of which is the development of cryptographic systems that are protected from both quantum and classical attacks, and will also be able to interact with existing communication protocols and networks. In view of the significant importance of the practical application of directional encryption algorithms, at the international and state level, special attention was paid to the implementation of the proposed requirements for key encapsulation protocols. Key-establishment algorithms (KEA) form a common secret – the key for a symmetric encryption algorithm. The paper considers two KEA algorithms that use algebraic lattices: one of the finalists of the 3rd round Crystals-Kyber and the Skelya algorithm (DSTU 8961-2019). The Kyber algorithm first performs asymmetric encryption of a 32-byte message, and then generates a shared secret. The Skelya algorithm performs the same actions, but for asymmetric encryption, it uses messages of any length that do not exceed the maximum possible. That is why the last algorithm can be used not only as a KEA algorithm, but also as an asymmetric encryption algorithm. According to the NIST Security level, the Kyber algorithm provides cryptographic 1, 3, and 5 security levels, and the Rock algorithm provides cryptographic 3, 5, and 7 security levels. The cryptographic stability that is ensured for both algorithms is determined by a set of parameters. Thus, the purpose of this work is to review the details of the implementation of each of the mentioned algorithms, to compare the speed of the key generation, encapsulation and decapsulation algorithms for the Kyber and Skelya algorithms in terms of key data lengths, and the encapsulation result and computational complexity of both algorithms.
26
Zhao, Feng, Yun Jie Zhang, and Min Cai. "An ICA Algorithm Based on Symmetric and Asymmetric Generalized Gaussian Model." Advanced Materials Research 204-210 (February 2011): 470–75. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.470.
Full textAbstract:
Maximum likelihood estimation is a very popular method to estimate the independent component analysis model because of good performance. Independent component analysis algorithm (the natural gradient method) based on this method is widely used in the field of blind signal separation. It potentially assumes that the source signal was symmetrical distribution, in fact in practical applications, source signals may be asymmetric. This article by distinguishing that the source signal is symmetrical or asymmetrical, proposes an improved natural gradient method based on symmetric generalized Gaussian model (People usually call generalized Gaussian model) and asymmetric generalized Gaussian model. The random mixed-signal simulation results show that the improved algorithm is better than the natural gradient separation method.
27
Zhang, Mengwan, Fengfeng Gao, Jialin Gao, Weiguo Chen, and Chong Aik Lee. "The Cross-Correlation Relationship Between the Real Estate Industry and High-Quality Economic Development." Journal of Systems Science and Information 9, no. 6 (2021): 704–20. http://dx.doi.org/10.21078/jssi-2021-704-17.
Full textAbstract:
Abstract Based on China’s real estate investment (REI), commercial housing sales (CHS), and GDP data from 2001 to 2020, we studied the dependence, asymmetry, and transmission direction of China’s real estate and economy. Their cross-correlation is demonstrated through the deep cross-correlation analysis (DCCA) algorithm, multifractal asymmetric detrended cross-correlation analysis (MF-ADCCA) algorithm and DCCA algorithm based on a time delay. Both REI and CHS have persistence with GDP. The real estate industry and economy have asymmetric multifractal characteristics. Meanwhile, real estate and the economy have different trends, and they can affect each other with the same length of time delay. This effect diminishes in a short period of time, and there are unsteady fluctuations in cross-correlation persistence in the long term.
28
Rogozhina, Yu S., S. I. Blokhina, and E. S. Bimbas. "Methodological algorithm for eliminating congenital asymmetric cleft of the upper lip and palate." Pediatric dentistry and dental profilaxis 20, no. 2 (2020): 116–22. http://dx.doi.org/10.33925/1683-3031-2020-20-2-116-122.
Full textAbstract:
Relevance. The current view of the problem of specialized care for children with congenital cleft upper lip and palate in the literature is described as a system-forming complex of medical and surgical aids. The issue of the further development of individual methods and algorithms for the rehabilitation of children of complex types of cleft, showing a pronounced asymmetry of the affected tissues, remains an urgent issue. The creation of «special» algorithms for therapeutic tactics and the choice of the method of surgical benefits of asymmetric forms of cleft upper lip and palate involves the interaction of each specialist, taking into account the variety of clinical characteristics of complex defects.Purpose. On specific clinical material describe the features of the algorithm for eliminating the asymmetric cleft of the upper lip and palate, taking into account the author’s methods of cheilorino-palatoplasty.Materials and methods. For the period 2015-2019. a group of patients (62 patients) with congenital asymmetric cleft of the upper lip and / or palate, including those with deficiency of their own tissues, was studied in the Multiprofile Clinical Medical Center «Bonum». The study used clinical, anthropometric, statistical methods, analysis of photographs of patients.Results. An algorithm has been developed to eliminate a complex variant of damage to tissues and structures of the maxillofacial region, taking into account the proprietary technologies for surgical care.Conclusions. The proposed methodological algorithm for the treatment tactics of complex clinical and anatomical variants of the cleft of the upper lip and / or palate allows us to assess the severity of damage of the maxillofacial region, establish indications for the use of additional therapeutic methods for orthodontic-surgical preparation for cheilorino-palatoplasty and adequately choose the method of surgical intervention.The use of original methods for surgical removal of asymmetric clefts of the upper lip and / or palate, including “wide” crevices with a deficit of their own tissues, increases the effectiveness of surgical and rehabilitation tactics in the general complex of specialized care for patients with complex tissue lesions of the maxillofacial region.The awareness of maxillofacial surgery doctors and rehabilitation dentistry specialists about modern methods of surgical care, about an improved methodological algorithm for eliminating asymmetric cleft upper lip and / or palate, including with deficiency of own tissues, can serve as a «road map» for the development of a specialized interdisciplinary health recovery complex this category of patients.
29
Khan, Sahib, Muhammad Abeer Irfan, Khalil Khan, et al. "ACO Based Variable Least Significant Bits Data Hiding in Edges Using IDIBS Algorithm." Symmetry 12, no. 5 (2020): 781. http://dx.doi.org/10.3390/sym12050781.
Full textAbstract:
This work presents a double asymmetric data hiding technique. The first asymmetry is created by hiding secret data in the complex region of the cover image and keep the smooth region unaffected. Then another asymmetry is developed by hiding a different number of secret bits in the various pixels of the complex region. The proposed technique uses the ant colony optimization (ACO) based technique for the classification of complex and smooth region pixels. Then, the variable least significant bits (VLSB) data hiding framework is used to hide secret bits in the complex region of the cover image. A distance-based substitution technique, namely increasing distance increasing bits substitution algorithm, is used to ensure the asymmetry in the number of hidden bits. The double asymmetric framework enhances the security of the hidden secret data and makes the retrieval of hidden information difficult for unauthorized users. The algorithm results in high-quality stego images, and the hidden information does not attract the human visual system (HVS).
30
Wang, Xingyuan, and Xiaomeng Qin. "Detecting communities by asymmetric intimacy in directed-weighted network." International Journal of Modern Physics C 28, no. 01 (2017): 1750006. http://dx.doi.org/10.1142/s0129183117500061.
Full textAbstract:
Community detection and analysis have attracted wide public concerns over the recent years. Meanwhile, many related algorithms in complex networks have been proposed. However, most of them concentrate on undirected and unweighted networks. Concerning the significant theoretical value and potential application foreground for directed-weighted networks, in this paper, a novel hierarchical communities detection algorithm (termed as DCBAI) has been proposed on the basis of asymmetric intimacy between nodes. Community structures are effectively detected by node clustering algorithm in directed-weighted network, and a set of optimal communities are generated. In addition, a new and asymmetric parameter is adopted to measure the intimate relationship between nodes. We make some simulation using the proposed algorithm in real-world networks and artificial networks, and the result obtained proves that the parameter can describe the direct and indirect relationships between two nodes. Eventually, comparison with similar algorithms shows that our proposed algorithm has better performance.
31
Mamunov, Maksim V., and Aleksandr V. Patrushev. "Diagnostic efficiency of the main dermatoscopic symptoms and algorithms for detecting skin melanoma." Russian Military Medical Academy Reports 40, no. 1 (2021): 45–52. http://dx.doi.org/10.17816/rmmar64477.
Full textAbstract:
AIM: to assess the diagnostic accuracy of the main dermatoscopic signs and algorithms used to diagnose skin melanoma.
 MATERIALS AND METHODS: To assess the diagnostic effectiveness of the performed dermatoscopy in detecting skin melanoma, the main dermatoscopic signs that occur in this disease were identified: atypical pigment network, atypical globules, asymmetry of pigmentation and structure, asymmetric stripes, asymmetric zones of hyperpigmentation (spots), blue-white (white-blue) veil, graininess, scar-like foci of depigmentation, white shiny stripes, negative pigment network. The study was carried out based on the analysis of 34 archival dermatoscopic images of melanocytic skin lesions with a morphologically verified diagnosis (11 melanomas and 23 melanocytic nevi). In addition, a comparison was made of the indicators of the diagnostic efficiency of two main dermatoscopic algorithms used in the diagnosis of skin melanoma: the algorithm by 3 signs and by 7 signs. For this, 186 archived dermatoscopic images of melanocytic skin lesions were analyzed. All patients included in the study were examined and treated at the clinic for skin and venereal diseases in the period from 2015 to 2019. The study was carried out using a HEINE DELTA 20 Plus dermatoscope in immersion mode and in cross-polarization.
 RESULTS: The following dermatoscopic features had the highest diagnostic efficiency for the diagnosis of skin melanoma: blue-white veil (86.8%), asymmetry of pigmentation and structure (82.6%), and white shiny stripes (72.8%). The diagnostic efficiency of the 3 signs algorithm was 93.0%, the 7 signs algorithm 90.5%.
 CONCLUSION: Diagnostic algorithms for confirming melanoma can be successfully used by both general practitioners and medical specialists (dermatologists, oncologists). In this case, it is preferable to use the three signs algorithm at the initial admission of patients as a screening option, and the seven-signs algorithm by experienced specialists in the field of dermatoscopy to confirm the diagnosis (4 figures, 3 tables, bibliography: 11 refs).
32
Premsai, Ranga. "IMPLEMENTING IDENTITY AND ACCESS MANAGEMENT FOR IMPROVING CYBER SECURITY." International Scientific Journal of Engineering and Management 03, no. 12 (2024): 1–7. https://doi.org/10.55041/isjem01283.
Full textAbstract:
Smart Banking Cyber-Physical Systems (SBCPS) face significant risks from various forms of financial fraud, including suspicious transactions, forgery, and identity theft. Traditional fraud detection methods often struggle to provide timely and reliable solutions. To address this, this study proposes an advanced fraud detection system based on a blockchain-enabled smart contract framework, integrating dual cryptographic algorithms: the Secure Asymmetric Hash Encryption Algorithm (SAHEA) and the Triple Integrity Twofish Algorithm (TITFA). The SAHEA ensures secure transaction data encryption using asymmetric encryption, while the TITFA employs triple layers of Twofish encryption to enhance data integrity and confidentiality. Together, these algorithms provide robust authentication and tamper-proof transaction records. By leveraging blockchain’s transparency and immutability, the proposed system creates a secure, auditable environment for financial transactions. This approach offers a more efficient, reliable, and scalable solution for detecting and preventing fraud in SBCPS, improving security while reducing computational overhead. The dual cryptographic system, integrated with blockchain, delivers a cutting- edge, trustworthy method for fraud detection in smart banking. Index Terms—Smart Banking Cyber-Physical Systems, Fraud Detection, Blockchain, Smart Contracts, Secure Asymmetric Hash Encryption Algorithm, Triple Integrity Twofish Algorithm, Cryptography
33
Wang, Pei, Xu Sheng Yang, Zhuo Yuan Wang, Lin Gong Li, Ji Chang He, and Qing Jie Wang. "Solving Large-Scale Asymmetric Sparse Linear Equations Based on SuperLU Algorithm." Advanced Materials Research 230-232 (May 2011): 1355–61. http://dx.doi.org/10.4028/www.scientific.net/amr.230-232.1355.
Full textAbstract:
This article introduces the recent research of SuperLU algorithms and the optimal storage method for [1] the sparse linear equations of coefficient matrix. How to solve large-scale non-symmetric sparse linear equations by SuperLU algorithm is the key part of this article. The advantage of SuperLU algorithm compared to other algorithms is summarized at last. SuperLU algorithm not only saves memory space, but also reduces the computation time. Because of less storage needed by this algorithm, it could solve equation with larger scale, which is much more useful.
34
Zhao, Hong Gang, Hao Shan Shi, and Yong Hui Zhao. "Range-Free Localization Algorithm in Wireless Sensor Networks with Asymmetric Links." Applied Mechanics and Materials 446-447 (November 2013): 1591–95. http://dx.doi.org/10.4028/www.scientific.net/amm.446-447.1591.
Full textAbstract:
Good positioning accuracy and coverage are important evaluation criterion for Wireless Sensor Network localization algorithm. DV-HOP is one of the classical range-free localization algorithms, which has good adaptivity and flexibility when node density (ND) and anchor density (AD) are both smaller. However, DV-HOP doesn't consider asymmetric links' influence in heterogeneous network, which is analyzed and proved as the main reason for poor positioning accuracy in DV-HOP. Then a Range-Free Localization Algorithm in Wireless Sensor Network with Asymmetric Links (RLAAL) is proposed, whose kernel mechanisms are Neighbor Discovery Algorithm (NDA) and Least Hops Acquiring Mechanism (LHAM). Every Node uses NDA to find all neighbors and uses LHAM to find least hops to Anchor nodes. Simulation results show that RLAAL can reduce asymmetric links' influence and have better positioning accuracy and coverage than DV-HOP.
35
Ady Putra, Wahyu, Suyanto Suyanto, and Muhammad Zarlis. "Performance Analysis Of The Combination Of Advanced Encryption Standard Cryptography Algorithms With Luc For Text Security." SinkrOn 8, no. 2 (2023): 890–97. http://dx.doi.org/10.33395/sinkron.v8i2.12202.
Full textAbstract:
Data security is very important as it is easy to exchange data today.
 Cryptographic techniques are needed as data security techniques. Combining two cryptographic algorithms is a solution for a better level of security. The Advanced Encryption Standard (AES) cryptographic algorithm requires low computational power and is the best symmetric algorithm. The LUC algorithm is an asymmetric algorithm that was developed from the RSA algorithm and has advantages in a better level of security and processing speed. In this research, two symmetric and asymmetric cryptographic algorithms will be combined in a hybrid scheme, namely the AES and LUC algorithms to improve data security. the AES algorithm will encrypt and decrypt messages, while the LUC algorithm performs encryption and decryption of the AES key. The results showed that the combination of the two AES and LUC algorithms was successful. However, the computational time needed by the two algorithms to perform the encryption and decryption process increases. The simulation results of the brute force attack performed show that the LUC algorithm can still be attacked. The greater the value of E (the public key of the LUC algorithm), the longer it takes for the brute force attack to be successful. The value of E is also directly proportional to the computational time required by the LUC. So it can be concluded that the AES algorithm is less precise when combined with the LUC algorithm.
36
Muzamil, Hussain Solangi, Ahmed Mahar Mukhtiar, Sattar Larik Abdul, and Raza Mahessar Mohsin. "Design a Perturb & Observe MPPT Algorithm for PV System Based Asymmetric Cascaded HalfBridge Multilevel Inverter." Indian Journal of Science and Technology 13, no. 4 (2020): 439–52. https://doi.org/10.17485/ijst/2020/v13i04/149530.
Full textAbstract:
Abstract <strong>Objectives/methods:</strong> This research proposes a Perturb and Observe (P&O) algorithm to extract maximum power point for photovoltaic (PV) system which then used as a direct current (DC) source for an asymmetrical cascaded half-bridge (ACHB) multilevel inverter (MLI). The whole system is modelled in MATLAB/SIMULINK. An approach is used to give input DC sources to asymmetrical cascaded halfbridge MVI with two PV systems. For PV system, a P&O maximum power point tracking (MPPT) algorithm is used to control the duty cycle of DC to DC boost converter for maintaining the constant output voltage. The switching pattern of MLI done by using pulse width modulation (PWM) technique. <strong>Findings:</strong> The proposed switching sample based on Multi Carrier (MC) PWM which reduces the voltage of components, decrease size, cost and also switching losses. ACHB MLI is attractive for its features as it gives higher level of output voltage by using fewer number of switching devices. Finally, two PV systems of different output voltages are integrated with asymmetrical cascaded half-bridge MVI. The results of the proposed model are verified in MATLAB/SIMULINK. <strong>Novelty:</strong> Dual P&O MPPT algorithms based PV system is used as input DC source for asymmetric cascaded half-bridge MLI which provides higher level output voltage as compared to conventional two-level inverter. <strong>Keywords:</strong> P&O, MPP, Photovoltaic, Asymmetric Cascaded HalfBridge Multilevel Inverter
37
Baraa, Tareq Hammad, Maki Sagheer Ali, Taha Ahmed Ismail, and Jamil Norziana. "A comparative review on symmetric and asymmetric DNA-based cryptography." Bulletin of Electrical Engineering and Informatics 9, no. 6 (2020): 2484–91. https://doi.org/10.11591/eei.v9i6.2470.
Full textAbstract:
Current researchers have focused on DNA-based cryptography, in fact, DNA or deoxyribonucleic acid, has been applied in cryptography for performing computation as well as storing and transmitting information. In the present work, we made use of DNA in cryptographic, i.e. its storing capabilities (superior information density) and parallelism, in order to improve other classical cryptographic algorithms. Data encryption is made possible via DNA sequences. In this paper, two cases utilizing different DNA properties were studied by combining the DNA codes with those conventional cryptography algorithms. The first case concerned on symmetric cryptography that involved DNA coding with OTP (one time pad) algorithms. Asymmetric cryptography was considered in the second case by incorporating the DNA codes in RSA algorithm. The efficiencies of DNA coding in OTP, RSA, and other algorithms were given. As observed, the computational time of RSA algorithm combined with DNA coding was longer. In order to alleviate this problem, data redundancy was reduced by activating the GZIP compressed algorithm. The present experimental results showed that DNA symmetric cryptography worked quite well in both time and size analyses. Nevertheless, it was less efficient than the compressed DNA asymmetric cryptography.
38
Rohe, Karl, Tai Qin, and Bin Yu. "Co-clustering directed graphs to discover asymmetries and directional communities." Proceedings of the National Academy of Sciences 113, no. 45 (2016): 12679–84. http://dx.doi.org/10.1073/pnas.1525793113.
Full textAbstract:
In directed graphs, relationships are asymmetric and these asymmetries contain essential structural information about the graph. Directed relationships lead to a new type of clustering that is not feasible in undirected graphs. We propose a spectral co-clustering algorithm called di-sim for asymmetry discovery and directional clustering. A Stochastic co-Blockmodel is introduced to show favorable properties of di-sim. To account for the sparse and highly heterogeneous nature of directed networks, di-sim uses the regularized graph Laplacian and projects the rows of the eigenvector matrix onto the sphere. A nodewise asymmetry score and di-sim are used to analyze the clustering asymmetries in the networks of Enron emails, political blogs, and the Caenorhabditiselegans chemical connectome. In each example, a subset of nodes have clustering asymmetries; these nodes send edges to one cluster, but receive edges from another cluster. Such nodes yield insightful information (e.g., communication bottlenecks) about directed networks, but are missed if the analysis ignores edge direction.
39
Vujnić, Aleksa, Žarko Stanisavljević, and Maja Vukasović. "Visual representation of post-quantum cryptographic algorithm Kyber." Tehnika 80, no. 1 (2025): 79–86. https://doi.org/10.5937/tehnika2501079v.
Full textAbstract:
Cryptographic algorithms form the foundation of protocols and applications that ensure confidentiality, integrity, and availability in modern information and communication technologies. These algorithms are broadly classified into symmetric and asymmetric cryptography. However, with the advancement of quantum computing, the mathematical foundations of current asymmetric cryptographic algorithms may become vulnerable. To address this challenge, efforts are underway to standardize post-quantum cryptographic algorithms that remain secure even in the presence of quantum computers. CRYSTALS Kyber post-quantum cryptographic algorithm is one of the most promising candidates for standardization due to its strong mathematical foundation and exceptional efficiency. Its security is based on the mathematical lattice problem, more precisely the Module-LWE problem. Although well documented, the Kyber algorithm is complex and difficult to understand. This paper describes the development of a visual representation of the Kyber algorithm, thus enabling a more intuitive understanding of its operations and structure. The solution is specially adapted to be used for educational purposes, with the intention of facilitating the acquisition of knowledge about new concepts in the field of data protection.
40
Gharehchopogh, Farhad Soleimanian, and Aysan Alavi Khargoush. "A Chaotic-Based Interactive Autodidactic School Algorithm for Data Clustering Problems and Its Application on COVID-19 Disease Detection." Symmetry 15, no. 4 (2023): 894. http://dx.doi.org/10.3390/sym15040894.
Full textAbstract:
In many disciplines, including pattern recognition, data mining, machine learning, image analysis, and bioinformatics, data clustering is a common analytical tool for data statistics. The majority of conventional clustering techniques are slow to converge and frequently get stuck in local optima. In this regard, population-based meta-heuristic algorithms are used to overcome the problem of getting trapped in local optima and increase the convergence speed. An asymmetric approach to clustering the asymmetric self-organizing map is proposed in this paper. The Interactive Autodidactic School (IAS) is one of these population-based metaheuristic and asymmetry algorithms used to solve the clustering problem. The chaotic IAS algorithm also increases exploitation and generates a better population. In the proposed model, ten different chaotic maps and the intra-cluster summation fitness function have been used to improve the results of the IAS. According to the simulation findings, the IAS based on the Chebyshev chaotic function outperformed other chaotic IAS iterations and other metaheuristic algorithms. The efficacy of the proposed model is finally highlighted by comparing its performance with optimization algorithms in terms of fitness function and convergence rate. This algorithm can be used in different engineering problems as well. Moreover, the Binary IAS (BIAS) detects coronavirus disease 2019 (COVID-19). The results demonstrate that the accuracy of BIAS for the COVID-19 dataset is 96.25%.
41
Astuti, Nur Rochmah Dyah Puji, Dimas Panji Setiawan, and Dhias Cahya Hakika. "COMPARATIVE STUDY OF ELGAMAL AND LUC ALGORITHM IN CRYPTOGRAPHIC KEY GENERATION." ASEAN Engineering Journal 13, no. 4 (2023): 61–68. http://dx.doi.org/10.11113/aej.v13.19184.
Full textAbstract:
In today’s era of digital, data security in communication channel becomes important factor to be considered during exchange of information. Cryptography is one of techniques to send and receive information securely through an insecure channel. Based on the number of keys used, encryption methods are categorized as symmetric and asymmetric cryptography. Compared to symmetric cryptography that often suffers from key management issues, asymmetric cryptography delivers higher level of data security. Thus, asymmetric cryptography is more preferred when security if the priority. To determine suitable algorithm, three essential aspects should be considered: security, speed, and prime numbers. This study aims to compare the application of asymmetric cryptographic algorithms between ElGamal and LUC algorithms in the key generation process. A comparative analysis of these two algorithms was conducted by evaluating the processing speed and prime numbers during key generation process to determine the advantages and drawbacks from ElGamal and LUC algorithms. The application in this study was developed using PHP programming language by following the Waterfall Model. Application testing involved two kinds of tests: (i) Black Box test and (ii) System Usability Scale (SUS) test. Results show the application developed from this study successfully performed the encryption, decryption, and checking of prime numbers from ElGamal and LUC algorithms. It displayed ciphertext, plaintext, and the speed of the encryption and decryption process from both methods. The black box test showed that all application functions follow the user's needs, while System Usability Scale (SUS) test obtained an average score of SUS interpretation of 83.75. This value means the adjective ratings was “excellent”, the grade scale was “B”, and the acceptability range was “acceptable”. It is concluded that the LUC algorithm superior to ElGamal in terms of the speed of encryption process. However, during the decryption process the LUC algorithm responded slower than ElGamal.
42
Pan, Rui, Wei Gao, Yunbo Zuo, Guoxin Wu, and Yuda Chen. "Investigation into defect image segmentation algorithms for galvanised steel sheets under texture backgrounds." Insight - Non-Destructive Testing and Condition Monitoring 65, no. 9 (2023): 492–500. http://dx.doi.org/10.1784/insi.2023.65.9.492.
Full textAbstract:
Image segmentation is a significant step in image analysis and computer vision. Many entropy-based approaches have been presented on this topic. Among them, Tsallis entropy is one of the best-performing methods. In this paper, the surface defect images of galvanised steel sheets were studied. A two-dimensional asymmetric Tsallis cross-entropy image segmentation algorithm based on chaotic bee colony algorithm optimisation was used to investigate the segmentation of surface defects under complex texture backgrounds. On the basis of Tsallis entropy threshold segmentation, a more concise expression form was used to define the asymmetric Tsallis cross-entropy in order to reduce the calculation complexity of the algorithm. The chaotic algorithm was combined with the artificial bee colony (ABC) algorithm to construct the chaotic bee colony algorithm, so that the optimal threshold of Tsallis entropy could be quickly identified. The experimental results showed that compared with the maximum Shannon entropy algorithm, the calculation time of this algorithm decreased by about 58% and the threshold value increased by about (26%, 54%). Compared with the two-dimensional Tsallis cross-entropy algorithm, the calculation time of this algorithm decreased by about 35% and about 20% was improved in the g-axis direction only. Compared with the two-dimensional asymmetric Tsallis cross-entropy algorithm, the calculation time of this algorithm decreased by about 30% and the threshold values of the two algorithms were almost the same. The algorithm proposed in this paper can rapidly and effectively segment defect targets, making it a more suitable method for detecting surface defects in factories with a rapid production pace.
43
Thomas, Ambili, and V. Lakshmi Narasimhan. "Symmetric and Asymmetric Encryption Algorithm Modeling on CPU Execution Time as Employed Over a Mobile Environment." International Journal of Natural Computing Research 10, no. 2 (2021): 21–41. http://dx.doi.org/10.4018/ijncr.2021040102.
Full textAbstract:
This paper presents results on modelling of AES and RSA encryption algorithms in terms of CPU execution time, considering different modelling techniques such as linear, quadratic, cubic, and exponential mathematical models, each with the application of piecewise approximations. C#.net framework is used to implement this study. The authors consider the symmetric encryption algorithm named AES and the asymmetric encryption algorithm named RSA to carry out this study. This study recommends quadratic piecewise approximation modelling as the most optimized model for modelling the CPU execution time of AES and RSA towards encryption of data files. The model proposed in this study can be extended to other symmetric and asymmetric encryption algorithms, besides taking them over a mobile cloud environment.
44
Liana, Liana, Muhammad Zarlis, and Tulus Tulus. "Hybrid Cryptosystem Analysis RSA Algorithm And Triple DES Algorithm." Sinkron 8, no. 3 (2023): 1461–73. http://dx.doi.org/10.33395/sinkron.v8i3.12467.
Full textAbstract:
Data security is needed in terms of communication. To guarantee data security, a technique is needed to make data and information called Critography. This study aims to analyze the process of Super Encryption in symmetric and asymmetric criterias using the Triple DES Algorithm and the RSA Algorithm. This can improve data security so that data is more confidential. The method used in Triple DES which is also called the symmetric algorithm is the OFB (Output feeback) method, and the RSA Algorithm (Riverst - Shamir-Adleman) which is an asymmetric algorithm using a random number system so that when these two algorithms are combined in the Super Encryption process the more accurate the data security. Super DES Triple Encryption and RSA algorithm analysis shows that the data created by text will be encrypted into ciphertext using both methods and re-described, so that the security of the data is relatively safe. Super Encryption on the two methods Algorithm is done because the level of complexity is difficult to make Cryptanalysts to steal data and the Encryption process becomes slow but data security becomes safer and not easy to attack Cryptanalysts. The problem in this research is how to increase encryption security and speed up the encryption process by combining the RSA and Triple DES methods.
45
Obaid, Taleb Samad. "Study A Public Key in RSA Algorithm." European Journal of Engineering Research and Science 5, no. 4 (2020): 395–98. http://dx.doi.org/10.24018/ejers.2020.5.4.1843.
Full textAbstract:
To transmit sensitive information over the unsafe communication network like the internet network, the security is precarious tasks to protect this information. Always, we have much doubt that there are more chances to uncover the information that is being sent through network terminals or the internet by professional/amateur parasitical persons. To protect our information we may need a secure way to safeguard our transferred information. So, encryption/decryption, stenographic and vital cryptography may be adapted to care for the required important information. In system cryptography, the information transferred between both sides sender/receiver in the network must be scrambled using the encryption algorithm. The second side (receiver) should be outlook the original data using the decryption algorithms. Some encryption techniques applied the only one key in the cooperation of encryption and decryption algorithms. When the similar key used in both proceeds is called symmetric algorithm. Other techniques may use two different keys in encryption/decryption in transferring information which is known as the asymmetric key. In general, the algorithms that implicated asymmetric keys are much more secure than others using one key. RSA algorithm used asymmetric keys; one of them for encryption the message, and is known as a public key and another used to decrypt the encrypted message and is called a private key. The main disadvantage of the RSA algorithm is that extra time is taken to perform the encryption process. In this study, the MATLAB library functions are implemented to achieve the work. The software helps us to hold very big prime numbers to generate the required keys which enhanced the security of transmitted information and we expected to be difficult for a hacker to interfere with the private information. The algorithms are implemented successfully on different sizes of messages files.
46
Obaid, Taleb Samad. "Study A Public Key in RSA Algorithm." European Journal of Engineering and Technology Research 5, no. 4 (2020): 395–98. http://dx.doi.org/10.24018/ejeng.2020.5.4.1843.
Full textAbstract:
To transmit sensitive information over the unsafe communication network like the internet network, the security is precarious tasks to protect this information. Always, we have much doubt that there are more chances to uncover the information that is being sent through network terminals or the internet by professional/amateur parasitical persons. To protect our information we may need a secure way to safeguard our transferred information. So, encryption/decryption, stenographic and vital cryptography may be adapted to care for the required important information. In system cryptography, the information transferred between both sides sender/receiver in the network must be scrambled using the encryption algorithm. The second side (receiver) should be outlook the original data using the decryption algorithms. Some encryption techniques applied the only one key in the cooperation of encryption and decryption algorithms. When the similar key used in both proceeds is called symmetric algorithm. Other techniques may use two different keys in encryption/decryption in transferring information which is known as the asymmetric key. In general, the algorithms that implicated asymmetric keys are much more secure than others using one key. RSA algorithm used asymmetric keys; one of them for encryption the message, and is known as a public key and another used to decrypt the encrypted message and is called a private key. The main disadvantage of the RSA algorithm is that extra time is taken to perform the encryption process. In this study, the MATLAB library functions are implemented to achieve the work. The software helps us to hold very big prime numbers to generate the required keys which enhanced the security of transmitted information and we expected to be difficult for a hacker to interfere with the private information. The algorithms are implemented successfully on different sizes of messages files.
47
Sholikhatin, Siti Alvi, Adam Prayogo Kuncoro, Afifah Lutfia Munawaroh, and Gilang Aji Setiawan. "Comparative Study of RSA Asymmetric Algorithm and AES Algorithm for Data Security." Edu Komputika Journal 9, no. 1 (2023): 60–67. http://dx.doi.org/10.15294/edukomputika.v9i1.57389.
Full textAbstract:
There are many ways to ensure data security, one of the classic way but still effective is to use encryption. Encryption itself has two techniques or algorithms: symmetric-key (also called secret-key) and asymmetric-key encryption (also called public key). In this paper, we proposed an analysis of two algorithm of encryption: RSA and AES algorithm in term of securing digital data. The method used in this research are: RSA and AES analysis, then retrieving the result. The two algorithm is deeply and thoroughly analyzed to discover the effectiveness to secure the data. The Technological Readiness Level (TKT) is at level 6, which means demonstration of a model or prototype or the analysis result of a system or subsystem or a study in a relevant environment. The result concluded that the application of the AES encryption algorithm is more optimal than RSA encryption in digital data security. Because the encryption and decryption process of using the AES algorithm is faster, although the difference in testing time of the two encryption algorithms is not too significant. The entropy value of 4.96 in AES encryption is greater than that of RSA proving that the even distribution of characters in the chiper text code does not accumulate on certain characters so that it will be difficult to attack using frequency analysis.
48
Korolyov, V., M. Ogurtsov, and A. Khodzinsky. "Multilevel Identification Friend or Foe of Objects and Analysis of the Applicability of Post-Quantum Cryptographic Algorithms for Information Security." Cybernetics and Computer Technologies, no. 3 (October 27, 2020): 74–84. http://dx.doi.org/10.34229/2707-451x.20.3.7.
Full textAbstract:
Introduction. Widespread use of unmanned aerial vehicles in the civilian and military spheres requires the development of new algorithms for identification friend or foe of targets, as used in the Armed Forces of Ukraine (AFU) devices of the "Parol" system are designed to service approximately 110 objects military equipment. AFU automation systems allow the use of additional sources of information about various objects from civil or special data transmission networks, which can be the basis for building a networked multi-level system of state recognition. Predictions of the development of quantum computers foresee the possibility of breaking modern algorithms for information security in polynomial time in the next 5-10 years, which requires the development and implementation of new encryption algorithms and revision of modern parameters. The purpose of the article is to develop a new algorithm for state recognition of objects, which can be scaled to process the required number of manned and unmanned aerial vehicles. Potential threats to classical cryptographic protection algorithms for data networks, which will result in the execution of algorithms such as Grover and Shore on quantum computers, were also discussed. Results. The article proposes a new multilevel algorithm of state recognition based on modern cryptographic methods of information protection, which allows to perform reliable automated identification of objects, scale systems using data on potential targets from other sources through secure special networks. Grover's search algorithm does not give a strong increase in key search performance for symmetric encryption algorithms, so there is no need to increase the key lengths for this type of information security algorithms. Post-quantum asymmetric encryption algorithms require additional study and comprehensive testing of information security or increasing the key lengths of cryptographic algorithms, which corresponds to the number of qubits, i.e. more than twice. The most promising is the family of asymmetric post-quantum cryptographic algorithms based on supersingular isogenic elliptic curves. Conclusions. The developed algorithm of identification friend or foe of objects is more secure compared to existing algorithms and is focused on the use of modern on-board computers and programmable radio modems. Shore's algorithm and the like will be a significant threat to modern asymmetric cryptography algorithms when the number of qubits of quantum computers exceeds the number of bits in public keys more than twice. Keywords: identification friend or foe, symmetric encryption, asymmetric cryptography, quantum computer, post-quantum cryptography.
49
Baxter, Michael. "Forum: A Better Rim Weighting Algorithm." International Journal of Market Research 58, no. 4 (2016): 621–34. http://dx.doi.org/10.2501/ijmr-2016-036.
Full textAbstract:
This paper proposes the asymmetric rim weighting algorithm as an alternative to rim weighting (also called raking). The latter is currently a popular method for grossing up the results of a sample survey, but asymmetric rim weighting produces results that are more efficient and have fewer high weights, with little or no increase in processing time.
50
Balea, Ioana D., Radu Hulea, and Georgios E. Stavroulakis. "Implementation of Eurocode Load Cases in Optimization Problems of Steel Frames, Based on Genetic Algorithms." Applied Mechanics and Materials 310 (February 2013): 609–13. http://dx.doi.org/10.4028/www.scientific.net/amm.310.609.
Full textAbstract:
This paper presents an implementation of Eurocode load cases for discrete global optimization algorithm for planar structures based on the principles of finite element methods and genetic algorithms. The final optimal design is obtained using IPE sections chosen as feasible by the algorithm, from the available steel sections from industry. The algorithm is tested on an asymmetric planar steel frame with promising results.