Efficient modular operations using the adapted modular number system

Guest Editorial

A number system uses a set of digits and sign to represent all the numbers. Different number systems use different amount of digits and sign. To compare the leanness of a number system, the cardinality of the complete set of digits and sign are employed in this work. The 01 binary number system is used by almost all the modern computers. It can represent all the real numbers by two digits 0, 1 and a sign (-), which means its cardinality is 3. Thus, the 01 binary system is not a true binary system. After reviewing all the existing number systems it is found that no true binary system exists for real numbers. All the current binary number systems either don’t have radix 2, or have cardinality 3. In this paper, a true binary system for real numbers, with both radix and cardinality 2, is invented based on the principle of Yin-Yang. Surprisingly, this binary system can not only represent all real numbers without using a sign, but also perform arithmetic and Boolean operations without any problem. Furthermore, due to its radix being 2, this true binary system is compatible with the 01 binary system and many operations are interchangeable between the two systems. It is expected that this true binary system will be applied in the fields of number representation, computer science and cryptography.

This article discusses the actual issues of training mediators–translators in the light of the changes of the political situation in the country and overseas. The mediator–translator should use the digital environment, could possess knowledge of lingua-sociocultural and information security, and smooth out intercultural conflicts in the translation process. The goal of this research is to clarify the types of professional activity of the mediator-translator who functions in the digital environment with the focus on the information and lingua sociocultural security, and to define special skills of future mediators-translators for their development in the process of the university professional training. Methodology and research methods include the analysis and the synthesis of scientific literature on translation’s studies, cultural studies, psychology, linguistics, computer science, mediation and the analysis of Russian Federation government documents on the information security. Results. The main types of professional activity and requirements to the mediator-translator in the digital educational environment with focus on the information and lingua sociocultural security are clarified. The mediator-translator as “homo informaticus”- (human of information) within current changes is a specialist who values his or her sense of identity, permanently improves his or her mother tongue, protecting the Russian language from foreign influence, and critically tracks the information on translation machines within the digital environment. In conclusion the article presents the learning prospects of mediators-translators in Russia. The paper will be useful for teaching and learning foreign languages, intercultural communication, theory and practice on translation, pedagogy.

Elliptic Curve Cryptography operations rely heavily on the strong security of scalar multiplication. However, this operation is vulnerable to side channel (SCA) and fault injection (FA) attacks. The use of alternative arithmetic systems like Residue Number System (RNS) for all scalar multiplication underline operations has been proposed as an efficient countermeasure approach for the above attacks. In RNS, a number is represented as a set of smaller numbers, where each one is the result of the modular reduction with a given moduli basis. Under certain requirements, a number can be uniquely transformed from the integers to the RNS domain (and vice versa) and all arithmetic operations can be performed in RNS. This representation provides an inherent SCA and FA resistance to many attacks and can be further enhanced by additional RNS arithmetic manipulations or more traditional algorithmic countermeasures. In this paper, extending our previous work, we explore the potentials of RNS as an SCA and FA countermeasure. A description of RNS based SCA and FA resistance means is provided through appropriate scalar multiplication algorithmic variations, traces of the proposed algorithm are collected and the results are analyzed regarding the RNS countermeasure strength. More specifically, in this paper, a secure RNS based Montgomery Power Ladder based scalar multiplication algorithm is provided and is implemented on an ARM Cortex A7 processor. The implementation SCA-FA resistance is evaluated by collecting preliminary leakage trace results that validate our initial assumptions.

In the conditions of growing challenges in cyberspace, the information environment protection system is a preventive mechanism of protection against real and potential risks and threats to national interests. The study analyzed the position of Ukraine in the world rankings for cyber security and outlined promising directions for increasing its level, one of which is the improvement of information protection systems of critical infrastructure objects. A system of protection of the information environment against cyber attacks using of the modular number system based on non-positional code structures is proposed. Of the various options for the practice of intrusion detection and prevention systems, this chapter discusses the data comparison algorithm, which consists in continuously monitoring and scanning data by constantly comparing data with user and service information patterns, as well as threat patterns and indicators based on previous experience, not only own, within the local network or system, but also on a global scale. The chapter presents an improved method of fast comparison, which allows to carry out the comparison procedure in the modular number system, both in positive and negative numerical ranges. Improving the method of fast comparison of two integers is carried out by increasing the accuracy of comparison, by representing numbers in an artificial form, which expands the area of effective use of computer systems for processing integer economic data in the modular number system. The use of an improved method for fast comparison of data in the modular number system for one-byte, two-byte, three-byte, four-byte and eight-byte numerical bit grids of the computer systems, respectively, by 16 %, 37 %, 50 %. It is 58 % and 72 % more efficient in terms of number comparison time than using the fastest of the existing number comparison methods in the modular number system, which is based on the principle of nulling. The proposed method provides maximum comparison accuracy with a minimum amount of equipment for comparing devices. This circumstance makes it possible to obtain a reliable result of the data control operation. Its use makes it possible to identify potential cyber threats and take preventive measures, which will increase the level of protection of critical infrastructure objects.

In this paper, we proposed a method that allows the integration between privacy and understanding of data in Process Mining projects. Due to the latest reports of cyber attacks in health organizations, an integration method is proposed to protect the privacy and security of sensitive information using the discipline of Process Mining. Although there is research of interest related to process mining and data privacy oriented to the health field, there is still a need to protect the security of the information to protect the results and analysis of the processes. The proposed method is an extension of the methodological proposal of process mining projects including data privacy, which consists of four phases: 1. Definition of the project; 2. Data Preparation; 3. Process Analysis; 4. Redesign of Processes. For validation, data from the Surgery Block process of a private health institution in Lima, Peru was used. With the method, it was possible to protect 95% of the process data, obtaining as a result the optimization of the process by 50%.

The method of modular arithmetic consists in operating not with a number, but with its remainders after division by some integers. In the modular number system or the number system in the residual classes, a multi-bit integer in the positional number system is represented as a sequence of several positional numbers. These numbers are the remainders (residues) of dividing the original number into some modules that are mutually prime integers. The advantage of the modular representation is that it is very simple to perform addition, subtraction and multiplication operations. In parallel execution of operations, the use of modular arithmetic can significantly reduce the computation time. However, there are drawbacks to modular representation that limit its use. These include a slow conversion of numbers from modular to positional representation; the complexity of comparing numbers in modular representation; the difficulty in performing the division operation; and the difficulty of determining the presence of an overflow. The use of modular arithmetic is justified if there are fast algorithms for calculating a number from a set of remainders. This article describes a fast algorithm for converting numbers from modular representation to positional representation based on a geometric approach. The review is carried out for the case of a comparison system with two modules. It is also shown that as a result of increasing numbers in positional calculus, they successively change in a spiral on the surface of a two-dimensional torus. Based on this approach, a fast algorithm for comparing numbers and an algorithm for detecting an overflow during addition and multiplication of numbers in modular representation were developed. Consideration for the multidimensional case is possible when analyzing a multidimensional torus and studying the behavior of the turns on its surface.

We introduce a novel method for complex number representation. The proposed, redundant complex binary number system (RCBNS) is developed by combining a redundant binary number and a complex number in base (-1+j). Donald (1960) and Walter Penny (1964, 1965) represented complex numbers using base -j and (-1+j) in the classified algorithmic models. A redundant complex binary number system consists of both real and imaginary-radix number systems that form a redundant integer digit set. This system is formed by using complex radix of (-1+j) and a digit set of /spl alpha/=3, where /spl alpha/ assumes a value of -3, -2, -1, 0, 1, 2, 3. The arithmetic operations of complex numbers with this system treat the real and imaginary parts as one unit. The carry-free addition has the advantage of redundancy in number representation in the arithmetic operations. Results of the arithmetic operations are in the RCBNS form. The two methods for conversion from the RCBNS form to the standard binary number form have been presented. The RCBNS reduces the number of steps required to perform complex number arithmetic operations, thus enhancing the speed.

RFID in the Information Security and Privacy is hidden in a crisis. RFID Information Security and Privacy Protection using hardware ways to achieve the target is the best way, however, it is subject to the problem of Tag costs and capacity and is currently still unresolved issues. This study focus on the Information Security and Privacy Protection and put forth a EPC specifications to use the model of XOR logic operation with the method of CRC examining the computing, and simulating the shopping mall system which provides a Information Security and Privacy Protection system. We got the data after simulations to show that XOR computing to actual test of 8 bytes, the required time is 17.29 Ticks in average, the spend time is rather short. Follow-up our simulations to the test data of DES encryption methods, an average time of 8,039.41 Ticks is required, the two time required considerable differences. It was informed that this study through practical shows that we could provide a match hardware encryption methods of the specific solutions to achieve their personal privacy protection, confidentiality, confirmed, and the fulfillment of the Information Security and Privacy Protection.

HCISPP Study Guide

The sensitivity of health-care information and its accessibility via the Internet and mobile technology systems is a cause for concern in these modern times. The privacy, integrity and confidentiality of a patient's data are key factors to be considered in the transmission of medical information for use by authorised health-care personnel. Mobile communication has enabled medical consultancy, treatment, drug administration and the provision of laboratory results to take place outside the hospital. With the implementation of electronic patient records and the Internet and Intranets, medical information sharing amongst relevant health-care providers was made possible. But the vital issue in this method of information sharing is security: the patient's privacy, as well as the confidentiality and integrity of the health-care information system, should not be compromised. We examine various ways of ensuring the security and privacy of a patient's electronic medical information in order to ensure the integrity and confidentiality of the information.

Fast changing technologies and increased sophistication in cyberattacks have heightened the information security and privacy risks for all contemporary organizations. Research shows that security breaches are mainly internal and caused by ignorant and disgruntled employees. As human resource manages employees from recruitment to separation and handles most sensitive personal data of employees in the organization, it plays a critical role in protecting information security and privacy. This chapter provides an overview of the basics of information security and privacy concepts and frameworks. It highlights the major roles human resource functionaries can play in designing, applying, and monitoring appropriate controls throughout the employment cycle, that is, before, during, and after employment to protect information security and privacy.

Modern software systems increasingly rely on numerical algorithms that require high or arbitrary precision, especially in scientific computing, numerical modeling, optimization, and data analysis. The use of high-precision arithmetic significantly affects the computational behavior of programs, since the cost of arithmetic and transcendental operations depends on the precision level of numerical data representation. In such conditions, predicting program execution time and estimating computational complexity become non-trivial tasks, particularly in distributed computing environments. This paper presents an analysis of existing software complexity metrics with respect to their applicability to programs performing high-precision computations in distributed systems. Classical software metrics, including size metrics, control flow complexity metrics, and data flow complexity metrics, are considered and systematized. Their main limitations are identified in the context of high-precision arithmetic, where the assumption of constant-time arithmetic operations is no longer valid. It is shown that classical complexity metrics do not account for the dependence of computational cost on the mantissa length of numerical variables and the actual cost of arithmetic operations. As a result, programs with relatively simple control structures but intensive high-precision computations may require significantly more computational resources than programs with complex control logic implemented using standard floating-point arithmetic. The study substantiates the necessity of extending existing complexity evaluation approaches by incorporating parameters related to numerical precision and operation cost. The computational complexity of a program is proposed to be considered as a function of the types of arithmetic operations, their execution frequency, and the mantissa length of numerical data. Such an approach allows for a more accurate estimation of execution time and resource consumption, which is especially important for programs executed in distributed computing systems where communication overhead and data transfer costs play a significant role. The obtained results can be used for preliminary performance estimation, rational resource allocation, and the selection of appropriate parallelization strategies for high-precision numerical software in distributed environments.

Due to the wide application of the Internet, more and more attention has been paid to the security encryption technology of e-commerce users' privacy information. In order to improve the protection of e-commerce users' privacy information under the protection of civil and commercial law, an anti-counterfeiting encryption method of e-commerce users' privacy information under the protection of civil and commercial law is proposed to improve the protection of e-commerce users' privacy information in the Internet environment. Based on the civil and commercial law, this paper studies the security of e-commerce information, and optimizes the anti-counterfeiting encryption method of e-commerce users' privacy information combined with hyperchaotic sequence, so as to improve the accuracy of user authentication and protect the privacy of e-commerce users. The simulation results show that the anti-counterfeiting encryption method of e-commerce users' privacy information has good encryption effect under the protection of civil and commercial law.

A side channel analysis is major threat in secure communication device. Here our object is very clear to protect the sensitive information by adding DNA cryptography with chaotic countermeasure method. To overcome the side channel issues. Due to the side-channel attack can retrieve easily sensitive information from crypto embedded devices. So that the reason we need to protect the sensitive information (encryption key) in crypto embedded devices by applying the random number generation method. Mostly the random number generation used in medical data transmission, information security, and all sensitive areas. So in the research work, we apply a random generation by using the chaotic circuit. And also the paper concentrate to realize the chaotic circuit in hardware using FPGA with partially reconfigurable. And also based on Lorenz’s chaotic circuit used to protect sensitive information. Simulation and Synthesis verification done by using the VIVADO tool. Security analysis is done by hierarchical UACI, NPCR, and correlation.KeywordsSide channel attackFPGAChaotic