A new elliptic cryptographic algorithm

2018 ◽  
Author(s):  
E. F. Dettrey ◽  
E. A. Yfantis
Keyword(s):  
Cryptographic Algorithm

Web Service Implementation in Logistics Company uses JSON Web Token and RC4 Cryptography Algorithm

2020 ◽  
Vol 4 (3) ◽  
pp. 591-600
Author(s):  
Mochammad Rizky Royani ◽  
Arief Wibowo
Keyword(s):  
Web Service ◽  
Data Storage ◽  
Growth Potential ◽  
Easy Access ◽  
Access Time ◽  
Mobile Platforms ◽  
Logistics Service ◽  
Authentication Mechanism ◽  
Cryptographic Algorithm ◽  
Service Application

The development of e-commerce in Indonesia in the last five years has significantly increased the growth for logistics service companies. The Indonesian Logistics and Forwarders Association (ALFI) has predicted the growth potential of the logistics business in Indonesia to reach more than 30% by 2020. One of the efforts of logistics business companies to improve services in the logistics services business competition is to implement web service technology on mobile platforms, to easy access to services for customers. This research aims to build a web service with a RESTful approach. The REST architecture has limitations in the form of no authentication mechanism, so users can access and modify data. To improve its services, JSON Web Token (JWT) technology is needed in the authentication process and security of access rights. In terms of data storage and transmission security, a cryptographic algorithm is also needed to encrypt and maintain confidentiality in the database. RC4 algorithm is a cryptographic algorithm that is famous for its speed in the encoding process. RC4 encryption results are processed with the Base64 Algorithm so that encrypted messages can be stored in a database. The combination of the RC4 method with the Base64 method has strengthened aspects of database security. This research resulted in a prototype application that was built with a combination of web service methods, JWT and cryptographic techniques. The test results show that the web service application at the logistics service company that was created can run well with relatively fast access time, which is an average of 176 ms. With this access time, the process of managing data and information becomes more efficient because before making this application the process of handling a transaction takes up to 20 minutes.

CRYPTOGRAPHIC ALGORITHM FOR DEFENDING INFORMATICS TEST RESPONSES

2018 ◽  
Vol 28 (4) ◽  
pp. 1361-1365
Author(s):  
Ilhan Istikbal Ibryam ◽  
Byulent Mustafa Mustafa ◽  
Atti Rashtid Mustafa
Keyword(s):  
Secondary School ◽  
Communication Systems ◽  
Word Processing ◽  
Evaluation Criteria ◽  
Educational Process ◽  
Microsoft Word ◽  
Cryptographic Algorithm ◽  
Technical Character ◽  
Access Rights ◽  
Effective Use

With the introduction of Information Technology in educational process we need more often to use electronic evaluation. The examples of test variants in the secondary school are often prepared with the help of word processing editors as WordPad that has good opportunities for elementary text formatting. Another part of the teachers often use Microsoft Word when preparing their tests. It is true that Microsoft Word has much more editing and formatting instruments than WordPad. For access to electronic educational resources suggested by the school teachers two or more computer networks are built (teachers' and learners'). Using these networks and their access rights, each user, learner or teacher, has the opportunity to add files and directories into the school database (DB). Learners can add files with the exercises they have done during their classes. Teachers suggest through the database the electronic lessons they have developed. At the end of each unit each teacher prepares an electronic test. In it there are described the evaluation criteria depending on the number of points the student has gathered through correct responses. In most cases we notice that in the teachers' network files with the responses of the tests are added later on. Not always the means for defence offered by the system administrators at the school can guarantee the safety of our files and more exactly the manipulation of the answers of the electronic forms of check up. Aiming at more effective defence of the text files, this article views an algorithm created by us for cryptographic defence of text files and it's application in secondary school. The effective use of cryptographic information defence minimises the opportunity to decipher the coded information aiming at its misuse by the learners. Providing safe defence against unsanctioned access in computer communication is a complex and extensive task which is solved by means of a set of measures of organisation and programme-technical character. The defence of the process of submitting data requires utmost attention because it concerns the most vulnerable and accessible for violation points in the communication systems.

A Novel Simplified AES Algorithm for Lightweight Real-Time Applications: Testing and Discussion

2020 ◽  
Vol 13 (3) ◽  
pp. 435-445 ◽  
Author(s):  
Malik Qasaimeh ◽  
Raad S. Al-Qassas ◽  
Fida Mohammad ◽  
Shadi Aljawarneh
Keyword(s):  
Processing Time ◽  
Block Size ◽  
Statistical Test ◽  
Mathematical Proofs ◽  
The Past ◽  
Aes Algorithm ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Compare And Contrast ◽  
Constrained Devices

Background: Lightweight cryptographic algorithms have been the focus of many researchers in the past few years. This has been inspired by the potential developments of lightweight constrained devices and their applications. These algorithms are intended to overcome the limitations of traditional cryptographic algorithms in terms of exaction time, complex computation and energy requirements. Methods: This paper proposes LAES, a lightweight and simplified cryptographic algorithm for constricted environments. It operates on GF(24), with a block size of 64 bits and a key size of 80-bit. While this simplified AES algorithm is impressive in terms of processing time and randomness levels. The fundamental architecture of LAES is expounded using mathematical proofs to compare and contrast it with a variant lightweight algorithm, PRESENT, in terms of efficiency and randomness level. Results: Three metrics were used for evaluating LAES according to the NIST cryptographic applications statistical test suite. The testing indicated competitive processing time and randomness level of LAES compared to PRESENT. Conclusion: The study demonstrates that LAES achieves comparable results to PRESENT in terms of randomness levels and generally outperform PRESENT in terms of processing time.

scholarly journals Implementation of Cryptographic Algorithm in Dynamic QR Code Payment System and Its Performance

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 122362-122372 ◽  
Author(s):  
Yukun Zhou ◽  
Baidong Hu ◽  
Yitao Zhang ◽  
Weiming Cai
Keyword(s):  
Payment System ◽  
Qr Code ◽  
Cryptographic Algorithm

scholarly journals New Statistical Randomness Tests Based on Length of Runs

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Ali Doğanaksoy ◽  
Fatih Sulak ◽  
Muhiddin Uğuz ◽  
Okan Şeker ◽  
Ziya Akcengiz
Keyword(s):  
Statistical Tests ◽  
Random Sequence ◽  
Cryptographic Protocols ◽  
Experimental Results ◽  
Security Evaluation ◽  
Random Numbers ◽  
Statistical Distributions ◽  
Cryptographic Algorithm ◽  
Encryption Algorithms ◽  
Randomness Tests

Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic protocols depend on random values. Randomness is measured by statistical tests and hence security evaluation of a cryptographic algorithm deeply depends on statistical randomness tests. In this work we focus on statistical distributions of runs of lengths one, two, and three. Using these distributions we state three new statistical randomness tests. New tests useχ2distribution and, therefore, exact values of probabilities are needed. Probabilities associated runs of lengths one, two, and three are stated. Corresponding probabilities are divided into five subintervals of equal probabilities. Accordingly, three new statistical tests are defined and pseudocodes for these new statistical tests are given. New statistical tests are designed to detect the deviations in the number of runs of various lengths from a random sequence. Together with some other statistical tests, we analyse our tests’ results on outputs of well-known encryption algorithms and on binary expansions ofe,π, and2. Experimental results show the performance and sensitivity of our tests.

Sign in / Sign up

Export Citation Format

Share Document