Implementasi Kriptografi Pengamanan Data Pribadi Siswa SMA Swasta Jaya Krama Beringin Dengan Algoritma RC4

The personal data of the Jaya Krama Beringin Private High School students is required in the administrative data collection by the school. Personal data includes student identification such as student name, family identification number (NIK), gender, address, mobile number, e-mail, and so on. In today's digital era data is everything, with the development of the internet network that is increasingly easy to access, it is necessary to know and be aware of what things are personal data and what should be done to protect personal data. The research problem is that the personal data security of Jaya Krama Beringin High School students needs attention due to the widespread occurrence of data theft by hackers to be misused, it is necessary to need computer software for data security. The first step in the RC4 algorithm stage is to carry out the KSA (Key Scheduling Algorithm) process which at this stage is the process of forming an S-Box (Array S) with a length of 256 bytes (index 0 to 255) based on the encryption key. After using the XOR operation on the ciphertext with the key, the XOR result of the binary number obtained is converted into plaintext.

Optimization of Different Fitness Functions Using Reproduction, Crossover and Mutation of Genetic Algorithm With Binary Number Scheduling

Genetic algorithms are search algorithms based on the mechanics of natural selection and natural genetics. In this paper, we investigate a novel approach to the binary coded testing process based on a genetic algorithm. This paper consists of two parts. Thefirst part addresses the problem in the traditional way of using the decimal number system to define the fitness function to study the variations of counts and the variations of probability against the fitness functions. Second, the initialpopulationsare defined using binary coded digits (genes). For the evaluation of the high fitness function values,three genetic operators, namely, reproduction, crossover and mutation, are randomly used. The results show the importance of the genetic operator, mutation, which yields the peak values for the fitness function based on binary coded numbers performed in a new way.

Simultaneous All-optical 1's Complement Cum Division-by-two Schemes

Odd and even number detection is an important mathematical operation. Generally when any number divisible by 2 then it is called even number, otherwise it is odd number. Division by 2 can be easily obtained by putting a point before least significant bit (LSB) of any binary number. As an example a number (27)10 = (11011)2 when divided by 2 its result will be (1101.1)2 = (13.5)10. Hence when we find the fractional bit as logic-1 we can say that the number is odd, otherwise it is even. This operation can be obtained by using a demultiplexer. Here we have developed an optical circuit which can divide any binary integer number by 2, apart from that its 1’s complement can also be obtained from the circuit. Both of the result can be obtained simultaneously. Terahertz optical asymmetric demultiplexer (TOAD) based generally switch assumes a vital part to plan this n-bit circuit. Numerical simulations are done to urge the exhibition of the circuit.

Application of Mathematics in Computer Science

No one escape the learning of mathematics in one way or other, ranging from our kitchen to our journey from earth to Moon or Mars. Mathematics persists everywhere around us. It can be perceived in our garden or park from symmetry of leaves, flowers, fruits etc. and by so many examples of Geometry and symmetry can be seen in nature. God used mathematics in creation of the universe in one form or the other. Likewise, Mathematics is the queen of all sciences. Scientists and researchers can not perfectly accomplish their work without including mathematics. Mathematics is the foundation of Computer Science. If one is eager to learn any arena of Computer Science, first he/she has to imbibe a love of Mathematics that will be supportive for progressive learning of the said subject. Mathematics is friendly for analytical skills needed in Computer Science. Concepts of binary number system, Boolean algebra, Calculus, Discrete mathematics, linear algebra, number theory, and graph theory are the most applicable to the subject of computer science with the emergence of new concepts like machine learning, artificial intelligence, virtual reality and augmented reality.

A review of DNA data storage technologies based on biomolecules

: In the information age, data storage technology has become the key to improving computer systems. Since traditional storage technologies cannot meet the demand for massive storage, new DNA storage technology based on biomolecules attracts much attentions. DNA storage refers to the technology that uses artificially synthesized deoxynucleotide chains to store and read all information, such as documents, pictures, and audio. First, data are encoded into binary number strings. Then, the four types of base, A(Adenine), T(Thymine), C(Cytosine), and G(Guanine), are used to encode the corresponding binary numbers so that the data can be used to construct the target DNA molecules in the form of deoxynucleotide chains. Subsequently, the corresponding DNA molecules are artificially synthesized, enabling the data to be stored within them. Compared with traditional storage systems, DNA storage has major advantages, such as high storage density, long duration, as well as low hardware cost, high access parallelism, and strong scalability, which satisfies the demands for big data storage. This manuscript first reviews the origin and development of DNA storage technology, then the storage principles, contents and methods are introduced. Finally, the development of DNA storage technology are analyzed. From the initial research to the cutting edge of this field and beyond, the advantages, disadvantages, and practical applications of DNA storage technology require continuous exploration.

A Digitized Representation of the Modified Prandtl–Ishlinskii Hysteresis Model for Modeling and Compensating Piezoelectric Actuator Hysteresis

Piezoelectric actuators are widely used in micromanipulation and miniature robots due to their rapid response and high repeatability. The piezoelectric actuators often have undesired hysteresis. The Prandtl–Ishlinskii (PI) hysteresis model is one of the most popular models for modeling and compensating the hysteresis behaviour. This paper presents an alternative digitized representation of the modified Prandtl–Ishlinskii with the dead-zone operators (MPI) hysteresis model to describe the asymmetric hysteresis behavior of piezoelectric actuators. Using a binary number with n digits to represent the classical Prandtl–Ishlinskii hysteresis model with n elementary operators, the inverse model can be easily constructed. A similar representation of the dead-zone operators is also described. With the proposed digitized representation, the model is more intuitive and the inversion calculation is avoided. An experiment with a piezoelectric stacked linear actuator is conducted to validate the proposed digitized MPI hysteresis model and it is shown that it has almost the same performance as compared to the classical representation.

Simultaneous All-optical 1's Complement Cum Division-by-two Schemes

Odd and even number detection is an important mathematical operation. Generally when any number divisible by 2 then it is called even number, otherwise it is odd number. Division by 2 can be easily obtained by putting a point before least significant bit (LSB) of any binary number. As an example a number (27)10 = (11011)2 when divided by 2 its result will be (1101.1)2 = (13.5)10. Hence when we find the fractional bit as logic-1 we can say that the number is odd, otherwise it is even. This operation can be obtained by using a demultiplexer. Here we have developed an optical circuit which can divide any binary integer number by 2, apart from that its 1’s complement can also be obtained from the circuit. Both of the result can be obtained simultaneously. Terahertz optical asymmetric demultiplexer (TOAD) based generally switch assumes a vital part to plan this n-bit circuit. Numerical simulations are done to urge the exhibition of the circuit.

Analysis of trigonometric chaotic sequence by proposing an index-based bit level scrambling image encryption

Chaotic map is applied to numerous research fields, such as encryption of data and information. In this paper, a novel bit-level scrambling encryption based on three-dimensional trigonometric chaotic sequence is proposed. This encryption is operated on grayscale images because pixel value of which is between 0 and 255, which can be converted into 8-bit binary number, then each image can be converted into eight binary images. Combine binary images a three-dimensional matrix as input, which have three index values width, height, and page. Generate three numbers by the chaotic sequence to locate the value of the matrix need to be changed. After the value is located, change its value 0 to 1 or 1 to 0, this is the basic encryption scheme. This paper makes a three-dimensional binary matrix with 32 images to test the encryption scheme, and get average value of images’ number of pixel change rate at 0.9603, unified averaged change intensity at 31.27%, information entropy at 7.9891, also the histograms. And correlation coefficients of each pixel from three directions are small. There are comparisons with other encryptions too. The key space of this encryption is more than 10[Formula: see text].

Improved Redundant Binary Adder Realization in FPGA

This paper presents the design of improved redundant binary adder (IRBA) by utilizing positive–negative encoding rules in FPGA platform. The proposed design deals with inverted encoding of negative binary (IEN) and positive binary number to get addition result using readily available standard hardware module. The Verilog hardware description language is used as design entry for synthesis of the proposed architecture in Xilinx ISE Desisn Suite 14.4 software. This structure is realized on Vertex-4 xc4vfx12-12sf363 FPGA device. The proposed IRBA is found to be time efficient in comparison with the performance parameters such as propagation delay and area over previous reported architecture.