Cryptography

Embedded designers are forced to find new design solutions for fast growing embedded systems due to technological improvements. Despite Radio Frequency Identification (RFID) technology makes the lives of users easier, it also brings privacy and security problems. Therefore RFID designers use cryptographic algorithms to solve security and privacy problems. The aim of this study is to implement SEA algorithm designed for RFID systems by one of the system-level design languages called SystemC

Research into the security of the Internet of Things (IoT) needs to utilize particular algorithms that offer ultra-low power consumption and a long lifespan, along with other parameters such as strong immunity against attacks, lower chip area and acceptable throughput. This paper offers an ASIC-oriented comparative review of the most popular and powerful cryptographic algorithms worldwide, namely AES, 3DES, Twofish and RSA. The ASIC implementations of those algorithms are analyzed by studying statistical data extracted from the ASIC layouts of the algorithms and comparing them to determine the most suited algorithms for IoT hardwaresecurity applications. The AES algorithm is found to be the most suitable algorithm for IoT applications.

Local pseudorandom generators are a class of fundamental cryptographic primitives having very broad applications in theoretical cryptography. Following Couteau et al.'s work in ASIACRYPT 2018, this paper further studies the concrete security of one important class of local pseudorandom generators, i.e., Goldreich's pseudorandom generators. Our first attack is of the guess-and-determine type. Our result significantly improves the state-of-the-art algorithm proposed by Couteau et al., in terms of both asymptotic and concrete complexity, and breaks all the challenge parameters they proposed. For instance, for a parameter set suggested for 128 bits of security, we could solve the instance faster by a factor of about 2 61 , thereby destroying the claimed security completely. Our second attack further exploits the extremely sparse structure of the predicate P5 and combines ideas from iterative decoding. This novel attack, named guess-and-decode, substantially improves the guess-anddetermine approaches for cryptographic-relevant parameters. All the challenge parameter sets proposed in Couteau et al.'s work in ASIACRYPT 2018 aiming for 80-bit (128-bit) security levels can be solved in about 2 58 (2 78 ) operations. We suggest new parameters for achieving 80-bit (128-bit) security with respect to our attacks. We also extend the attack to other promising predicates and investigate their resistance.

Outsourcing data to remote cloud providers is becoming increasingly popular amongst organizations and individuals. A semi-trusted server uses Searchable Symmetric Encryption (SSE) to keep the search information under acceptable leakage levels whilst searching an encrypted database. A dynamic SSE (DSSE) scheme enables the adding and removing of documents by performing update queries, where some information is leaked to the server each time a record is added or removed. The complexity of structures and cryptographic primitives in most existing DSSE schemes makes them inefficient, in terms of storage, and query requests generate overhead costs on the Smart Device Client (SDC) side. Achieving constant storage cost for SDCs enhances the viability, efficiency, and easy user experience of smart devices, promoting their widespread adoption in various applications while upholding robust privacy and security standards. DSSE schemes must address two important privacy requirements: forward and backward privacy. Due to the increasing number of keywords, the cost of storage on the client side is also increasing at a linear rate. This article introduces an innovative, secure, and lightweight Dynamic Searchable Symmetric Encryption (DSSE) scheme, ensuring Type-II backward and forward privacy without incurring ongoing storage costs and high-cost query generation for the SDC. The proposed scheme, based on an inverted index structure, merges the hash table with linked nodes, linking encrypted keywords in all hash tables. Achieving a one-time O(1) storage cost without keyword counters on the SDC side, the scheme enhances security by generating a fresh key for each update. Experimental results show low-cost query generation on the SDC side (6,460 nanoseconds), making it compatible with resource-limited devices. The scheme outperforms existing ones, reducing server-side search costs significantly.

Ant colony optimization (ACO) has widely been applied to solve combinatorial optimization problems in recent years. There are few studies, however, on its convergence time, which re?ects how many iteration times ACO algorithms spend in converging to the optimal solution. This study aims at using a Max-Min Ant System (MMAS), which belongs to Ants Algorithm to obtain optimal tour of the Travelling Salesman Problem of Ghacem. The study considered a twelve city node graph (major sales point of Ghacem) with the nodes representing the twelve cities, and the edges representing the major roads linking the cities. Secondary data of the inter-city driving distances was obtained from the Ghana Highway Authority. The results showed that the objective of finding the minimum tour from the Symmetric Travelling Salesman Problem (STSP) model by using Max-Min Ants System (MMAS) Algorithm was successfully achieved. The optimal route of total cost distance was found to be 1873Km. Therefore, Ghacem coul...

Mobile cloud computing augments the resource-constrained mobile devices to run rich mobile applications by leveraging the cloud resources and services. Compute-intensive mobile apps require significant communication resources for migrating the code from mobile devices to the cloud. For such apps, distributed application execution frameworks (DAEF) have been proposed in the literature. These frameworks either migrate the mobile app code during runtime or keep the app synchronized with another remotely executed app on the cloud. Frameworks also support mobile app live migration to cater for compute node mobility. One key research question arises is how successful are these DAEFs in achieving the seamless application execution under various network conditions? The answer to this question entails formal analysis of the DAEFs to determine the realistic bounds on propagation delay, B Ejaz Ahmed

Today, all types of digital signature schemes emphasis on secure and best verification methods. Different digital signature schemes are used in order for the websites, security organizations, banks and so on to verify user's validity. Digital signature schemes are categorized to several types such as proxy, on-time, batch and so on. In this paper, different types of schemes are compared based on security level, efficiency, difficulty of algorithm and so on. Results show that best scheme depends on security, complexity and other important parameters. We tried simply to define the schemes and review them in practice.

The increase of the capacity of processing units and the growth of distributed computing make easy to collect and process information of Internet traffic flows. This information, however, can be used to perform attacks in anonymous communications that could compromise privacy. With the aim of preventing these attacks, we propose a scheme that implements a multimodal behavior using the random walk theory and crypto-types. The random walk mechanism is responsible for generating network patterns, and the cryptotype performs the micro-encryption tasks using series of quantum-resistant cryptography methods through the anonymous channel. The result shows that using this technique, we can prevent network analysis attacks by means of the generation of a different pattern in each execution for the same set of data. Namely, the experiments we have developed indicate that the average rate of true detections of application behaviors made by intruders does not exceed 24%. Thus, this multimodal pattern gives a high level of immunity against data analysis attacks because the intruders could consider the generated patterns as the typical patterns.

In order to effectively manage network resources and to serve different traffic needs, several works have been done in the QoS area. Basically, "Multi-Field (MF) packet classifiers" classify a packet by looking for multiple fields of the IP/TCP headers, recognize which flow the packet belongs to, and according to this information, provide service differentiation in IP networks. However, for security purposes, existing security protocols (such as the IPSec Encapsulating Security Payload (ESP) algorithm) hides much of this information in their encrypted payloads, preventing network control devices such as routers and switches from utilizing this information in performing classification appropriately. The ESPQ (ESP considered QoS) protocol deals with this problem but unfortunately, it has some security weaknesses. In this paper we present the ESPQ vulnerabilities and we propose EESP (Enhanced encapsulated security payload) as a security protocol that provides both security and QoS.

Improving software algorithms are not easy task, especially for increasing operating speed, and reducing complexity. Different algorithms implemented in cryptosystems used the exponentiation modular arithmetic, however, they suffer very long time complexity. Therefore, faster algorithms are strongly sought. This paper provides fast algorithms for modular multiplication and exponentiation that are suitable for implementation in RSA and DSS public key cryptographic schemes. A comparison of the time complexity measurements for various widely used algorithms is performed with the aim of looking for an efficient combination for the implementation of RSA cryptosystem. Two such algorithms were proposed in this work. The first is a modified convolution algorithm for modular multiplication while the second is a Tabulated Modular Exponentiation (TME) algorithm based on the modified sign-digit algorithm. They are found to give significant overall improvement to modular exponentiation over that of the fastest algorithms studied.

Extracting minutia and other features from fingerprint images is one of the most important steps in automatic fingerprint identification and classification. This paper proposes a method for the generation of long and secure code that may be used for multi-purpose applications, such as ATM, coded door locks and other security measures. The method consists of two phases; the first phase is carried out using fingerprint image enhancement and thinning. The second phase consists of extracting minutia, ridge ending, bifurcation and all other features in order to produce initial pattern. Finally the multipurposes secure code is generated by applying the one-way MD5 hash function on that pattern. The achieved results are discussed for security improvement. The proposed technique also shows considerable improvement in the minutia detection process in terms of both efficiency and speed.

This paper presents an approach to cryptanalysis of RSA cryptosystem based on the application of genetic algorithm. The search utilizes the idea of timing attack as computation time information may leak due to different modular operations throughout the RSA encoding. This approach suggests a speed up process, aiming at reducing the required number of plaintext-ciphertext samples needed for a successful timing attack. The proposed notion of timing attack outlined in this work with its preliminary implementation, have given encouraging results on RSA cryptosystem samples. Further work carried on to implement the idea of genetic algorithm technique to practical RSA system has demonstrated encouraging results.

The parallel division algorithms discussed in this paper may be classified among modified higher radix nonrestoring on-line division methods, where redundant representations are extensively utilized to speed up the operation. The network realizations of these algorithms are cellular, or even systolic with exclusively local control; they have size (area) and time both O ( n ) , where n is the length of the dividend representation. The same structures can also be used as a signed, digit-serial multiplier. When suitably equipped with some control and a few registers, the dividerhultiplier brings remarkable performance to large modular arithmetic, RSA cryptography, and gcd computations. They are also of interest to the design of floating-point units, and signal processing applications.

The essay, published by the magazine 'Aeon', is a reflection on what Language Deciphering is today and how life can get complicate (or 'bizarre') for a glyph-breaker. In our times, glyph-breakers cannot be anymore 'epic' figures like Champollion, Ventris, and Rawlinson, unfortunately, and that adds some 'confusion' to their role in academia and in the world of Science in general.

In this paper we consider the problem of securely measuring distance between two nodes in a wireless sensor network. The problem of measuring distance has fundamental applications in both localization and time synchronization, and thus would be a prime candidate for subversion by hostile attackers. We give a brief overview and history of protocols for secure distance bounding. We also give the first full-scale formal analysis of a distance bounding protocol, and we also show how this analysis helps us to reduce message and cryptographic complexity without reducing security. Finally, we address the important open problem of collusion. We analyze existing techniques for collusion prevention, and show how they are inadequate for addressing the collusion problems in sensor networks. We conclude with some suggestions for further research.

We study the problem of characterizing the wormhole attack, an attack that can be mounted on a wide range of wireless network protocols without compromising any cryptographic quantity or network node. Making use of geometric random graphs induced by the communication range constraint of the nodes, we present the necessary and sufficient conditions for detecting and defending against wormholes. Using our theory, we also present a defense mechanism based on local broadcast keys. We believe our work is the first one to present analytical calculation of the probabilities of detection. We also present simulation results to illustrate our theory.

Onion routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. Onion routing's anonymous connections are bidirectional, near real-time, and can be used anywhere a socket connection can be used. Any identifying information must be in the data stream carried over an anonymous connection. An onion is a data structure that is treated as the destination address by onion routers; thus, it is used to establish an anonymous connection. Onions themselves appear different to each onion router as well as to network observers. The same goes for data carried over the connections they establish. Proxy-aware applications, such as web browsers and e-mail clients, require no modification to use onion routing, and do so through a series of proxies. A prototype onion routing network is running between our lab and other sites. This paper describes anonymous connections and their implementation using onion routing. This paper also describes several application proxies for onion routing, as well as configurations of onion routing networks.

For a long time, random numbers have been used in many fields of application. Much work has been conducted to generate truly random numbers and is still in progress. A popular method for generating random numbers is a linear-feedback shift register (LFSR). Even though a lot of work has been done using this method to search for truly random numbers, it is an area that continues to attract interest. Therefore, this paper proposes a circuit for generating random numbers. The proposed circuit is designed to produce different sequences of numbers. Two segments of Fibonacci LFSR are used to form a generator that can produce more varied random numbers. The proposed design consists of blocks: segment 1, segment 2, and a clock controller. The system produces random numbers based on an external clock. The clock signal for the first segment is that of the external clock, whereas that for the second segment is modified by the clock controller. The second stage (segment 2) is executed only after...

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

The notion of Integrated Modular Avionics (IMA) refers to inter-connected pieces of avionics equipment supported by a wired technology, with stringent reliability and safety requirements. If the inter-connecting wires are physically secured so that a malicious user cannot access them directly, then this enforces (at least partially) the security of the network. However, substituting the wired network with a wireless network -which in this context is referred to as an Avionics Wireless Network (AWN) -brings a number of new challenges related to assurance, reliability, and security. The AWN thus has to ensure that it provides at least the required security and safety levels offered by the equivalent wired network. Providing a wired-equivalent security for a communication channel requires the setting up of a strong, secure (encrypted) channel between the entities that are connected to the AWN. In this paper, we propose three approaches to establish such a secure channel based on (i) preshared keys, (ii) trusted key distribution, and (iii) key-sharing protocols. For each of these approaches, we present at least two representative protocol variants. These protocols are then implemented as part of a demo AWN and they are then compared based on performance measurements. Most importantly, we have evaluated these protocols based on security and operational requirements that we define in this paper for an AWN.

EMV (Europay MasterCard Visa) is a globally accepted standard for chip card-based payment transactions, which benefits from the intrinsic security characteristics of chip cards. The EMV specification is relatively flexible and can be deployed in both online and offline card acceptance environments. In the offline environment, payment terminals and cards only communicate with each other in order to approve/decline the payment transactions, whereas in the online environment authorisation entities are also involved in the overall process. An authorisation entity can either be the Card Issuing Bank (CIB) or the payment scheme operator (e.g. Visa, Master-Card). Aside from the transaction authorisation, the EMV specifications define offline-PIN verification as one of the main cardholder verification methods. However, in an online authorisation environment, the PIN verification process is referred to as Online-PIN Verification (OPV). This process is the main focus of this paper. We discuss the OPV process that has placed indelible trust assumptions on the intermediary entities (subcontractors) between a payment terminal and a scheme operator/CIB. When this trust (assumption) is scrutinised, there is a potential attack scenario that an adversary can use to gain access to PIN data. This information can be used by an adversary to carry out an online PIN approved transaction without the involvement of the genuine cardholder but with the correct PIN. We then propose three solutions based on the existing OPV process as potential countermeasures that are then implemented to measure any incurred performance penalties and subjected to mechanical formal analysis using CasperFDR.

Thalamita crenata is one of the most common swimming crabs of the mangrove creeks of the East African coast. In Mida Creek, Kenya, this species inhabits the extreme seaward fringe of the mangrove swamp and the intertidal platform in front of the mangal, sheltering in small pools during low tide. Gut content analysis reveals that T. crenata is a generalistic predator, its diet being mainly composed of bivalves and slow-moving crustaceans. Both the stomach fullness and the relative presence of animal prey in the contents were significantly higher in crabs collected at sunset than in those caught at dawn. Stomach fullness seems to depend also on the tidal rhythm; in fact, it is higher during spring tide periods. Females had stomachs slightly fuller than those of males, while there was no difference in diet between juveniles and older specimens. Thalamita crenata forages more actively during daytime, thus differing from the majority of swimming crabs. Both the great abundance of this species and its diet, based on a wide range of slow-moving or sessile species, testify to the importance of the role played by this predator in the mangrove ecosystem of Mida Creek.

This paper goes for taking care of the issues of layman which are being confronted all the live long day relating to District Council.A site outlined with Responsive Web Development (RWD) adjusts the format to the client by utilizing liquid, extent based grids, flexible pictures, and CSS3 media inquiries an expansion of the media guideline. This can be accomplished by utilizing CSS3 and HTML5 for planning. Distinctive classes are planned in CSS, which are utilized in various areas as a part of code, these classes helps decrease the number of lines of code of the undertaking and keeps from inline styling, which helps in keeping up symmetry all through the outline and design. For this we are going to consolidate PHP and it can just be blended with HTML code. The approval strategy proposed in this paper is connected to the minority asset database administration framework, it enhances the proficiency of framework advancement, lessen the support workload, enhance the precision of accepta...

1(M.Tech. Scholar), Swami Vivekanand College of Science and Technology 2A.Prof., Swami Vivekanand College of Science and Technology ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract The period of vast database is currently a major issue. So specialists attempt to build up an elite stage to proficiently secured these sort of information before distributing. Here proposed work has resolve this issue of computerized information security by finding the connection between the segments of the dataset which depends on the profoundly relative affiliation designs. Here when various party undergo any data sharing than utilization of super-modularity is likewise done which adjust the risk and utilization of the information. While at the same time sensitive rules are hide and then send this data to the knowledge server for gathering information for multiple parties. Examination is done on vast dat...

1(M.Tech. Scholar), Swami Vivekanand College of Science and Technology 2A.Prof., Swami Vivekanand College of Science and Technology ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract The period of vast database is currently a major issue. So specialists attempt to build up an elite stage to proficiently secured these sort of information before distributing. Here proposed work has resolve this issue of computerized information security by finding the connection between the segments of the dataset which depends on the profoundly relative affiliation designs. Here when various party undergo any data sharing than utilization of super-modularity is likewise done which adjust the risk and utilization of the information. While at the same time sensitive rules are hide and then send this data to the knowledge server for gathering information for multiple parties. Examination is done on vast dat...

In recent years, the concept of the Internet of Things has been introduced. Information, communication, and network technology can be integrated, so that the unmanned aerial vehicle (UAV) from consumer leisure and entertainment toys can be utilized in high value commercial, agricultural, and defense field applications, and become a killer product. In this paper, a traceable and privacy-preserving authentication is proposed to integrate the elliptic curve cryptography (ECC), digital signature, hash function, and other cryptography mechanisms for UAV application. For sensitive areas, players must obtain flight approval from the ground control station before they can control the UAV in these areas. The traditional cryptography services such as integrity, confidentiality, anonymity, availability, privacy, non-repudiation, defense against DoS (Denial-of-Service) attack, and spoofing attack can be ensured. The feasibility of mutual authentication was proved by BAN logic. In addition, the computation cost and the communication cost of the proposed scheme were analyzed. The proposed scheme provides a novel application field.

The advancement of public-key cryptography in recent years has offered strong background support for the invention of numerous new system applications vastly employed in electronic business as well as other fields. However, that does not change the fact that the one-and-only Internet still remains open and unprotected. Therefore, for the sake of information security, confirming the legality of an entity's public key is always critical. Typically, a key authentication scheme needs one or more authorities to authenticate keys. To make a difference, in this study, we have developed a new key authentication scheme using generalized Communicated by A. Di Nola.

We present Kaleidoscope an innovative system that supports live forensics for application performance problems caused by either individual component failures or resource contention issues in large-scale distributed storage systems. The design of Kaleidoscope is driven by our study of I/O failures observed in a peta-scale storage system anonymized as PetaStore. Kaleidoscope is built on three key features: 1) using temporal and spatial differential observability for end-to-end performance monitoring of I/O requests, 2) modeling the health of storage components as a stochastic process using domain-guided functions that accounts for path redundancy and uncertainty in measurements, and, 3) observing differences in reliability and performance metrics between similar types of healthy and unhealthy components to attribute the most likely root causes. We deployed Kaleidoscope on PetaStore and our evaluation shows that Kaleidoscope can run live forensics at 5-minute intervals and pinpoint the...

Cloud computing is set of resources and services offered through the Internet. Cloud services are delivered from data centers located throughout the world. Cloud computing facilitates its consumers by providing virtual resources via internet. General example of cloud services is Google apps, provided by Google and Microsoft SharePoint. The rapid growth in field of "cloud computing" also increases severe security concerns.

An increasing number of healthcare applications are making use of wireless body sensor networks (WBSNs). WBSN technology provides a framework that allows for remote physiological monitoring of patients without the use of wired connections in the house. Furthermore, these systems provide real-time data transfer for medical personnel, allowing them to make timely decisions regarding patient care. Despite this, worries remain about patient data being compromised. This research presents a strategy for protecting patient-provider communications by making use of WBSNs. To solve the problem of how to securely store sensitive information on blockchains, a hybrid cryptographic architecture is proposed. The strengths of both public key and symmetric key cryptography are leveraged in my approach. In order to achieve this goal, I have developed a new algorithm by fusing the AES, RSA, and Blowfish algorithms. My experiments have shown that the proposed solution can keep private data safe without affecting its scalability. Using Logi-XGB as a prediction model for attacks, the proposed approach can successfully thwart 99.7 percent of them.

We propose a new scheme for synchronization of the optical chaos generated by a semiconductor laser subjected to external reflection. The scheme is based on optical feedback and will be analyzed from the viewpoint of static and dynamic properties and of robustness to external perturbations and noise. An application to cryptographic communications (chaotic shift keying) is finally proposed.

Interactions with outside world are not only natural but mandatory, in DIS user can communicate to doctors through the system for retrieving information about diseases by giving symptoms as input. The system is designed specifically for users who are patients and diagnostic clinics. DIS provides a collaboration and communication platform for first doctors, extension diagnosticians to share information on human body related diseases. The system uses patient data and AI based database for medicines to respective diseases as tools for enhancement of diagnosis of diseases. Through interactions on the Internet between extension doctors and specialists, problems can be communicated immediately and assessed. Specialists authorized to the system can perform diagnosis and identification and provide the best remedy recommendations to the users. Also, an algorithm independent approach for mounting poisoning attack across a dataset of DIS system is being implemented which in turn may lead to fa...

The security policy addresses constraints on functions and flow among them, constraints on access by external systems and adversaries including programs and access to data by people. Sound security policies architecture protects organization from attacks as well as accidental internal leakage of information, and data mishandling. This paper presents an architecture which deals the policies implemented at different level in an organization for secure and smooth functioning of business.

The Stratfraudian claim that William Shakspere of Stratford was the writer of the Shakespeare poems and plays and that none of his contemporaries ever doubted this, is a demonstrable falsehood.

The ‘Witness’ book and video series presents over a hundred contemporary witnesses to Francis Bacon’s Shakespeare authorship.

The whole foundation of the fraud that William Shakspere of Stratford wrote the Shakespeare poems and plays rests upon the lie/falsehood that none of his contemporaries in the Elizabethan and Jacobean eras expressed any doubts about his authorship: never once did any whisper, even hint of it, ever leak out. In fact this lie/falsehood extends much further with a whole phalanx of orthodox Shakespeare scholars insisting not only did any of the Stratford man’s contemporaries not hint, allude to, or raise any doubts about his authorship, but none were raised for some two
hundred years after his death. This fraudulent and dishonest fabrication is absolutely critical to the deception that William Shakspere wrote the Shakespeare poems and plays because it allows orthodox Shakespeare scholars to insist that the authorship question is a modern phenomenon
that only took root in the second half of the nineteenth century and need not be taken seriously.

This fictitious and mendacious narrative is a demonstrable falsehood one known to some of the key institutions and orthodox Shakespeare scholars who peddle this transparent fraud. It is an attestable and provable truth that there were an enormous number of expressions of doubt about the authorship of the Shakespeare works which began literally weeks after the publication of the Shakespeare poems Venus and Adonis and The Rape of Lucrece, the first works to carry the pseudonym William Shakespeare below their dedications to the Earl of Southampton.   

Yet this scarcely scratches the surface and only serves to conceal an overwhelming mountain of irrefutable evidence revealing and confirming that the great philosopher-poet Francis Bacon was the true author of the Shakespeare works, a secret known to many of his contemporaries,
who repeatedly alluded, indicated and pointed to it, in their respective literary publications.

This work presents more than a hundred various witnesses to Lord Bacon’s authorship of the Shakespeare works from a wide range of different perspectives.

Security of data is the major concern in today’s scenario. Transferring of data from one source point to a destination point is referred as data transfer. Encryption is one of the methods which is widely used for transfer of information over secured communication channel. Through security of various encryption techniques, we can make our data safe from hackers. Confidential data can be secured by various proposed methodologies and algorithms. Survey has been performed taking into consideration various image encryption techniques and algorithms as well as procedures in this paper and reference ideas about various cryptography techniques and discussed about the challenges faced in the image encryption.

A Stream Cipher (SC) is a symmetric-key encryption type that scrambles each piece of data in clear text to conceal it from hackers. Despite its advantages, it has a substantial challenge. Correct handwriting of the script code for the cipher scheme is a challenge for programmers. In this paper, we propose a graphical Domain-Specific Modeling Language (DSML) to make it easier for non-technical users and domain specialists to implement an SC domain. The proposed language, SCLang, offers great expressiveness and flexibility. Six different methods of keystream generation are provided to obtain a random sequence. In addition, fifteen tests in the NIST suite are provided for random statistical analysis. The concepts of the SC domain and their relationships are presented in a meta-model. The evaluation of SCLang is based on qualitative analysis and is presented to demonstrate its effectiveness and efficiency.

This paper examines the transformative potential of artificial intelligence (AI) in enhancing cybersecurity, particularly within Security Operations Centers (SOCs). By integrating advanced machine learning and deep learning techniques, AI is shown to augment human expertise in detecting and responding to cyber threats more effectively than traditional rule-based systems. Through an extensive literature review, comparative analysis, and real-world case studies including applications in ChatOps, DDoS mitigation, speech recognition, and image captioning the study demonstrates how AI can process vast amounts of security data to reduce false positives and shorten incident response times. The findings reveal that while AI significantly improves operational efficiency and threat detection, its integration also introduces technical challenges and ethical concerns, such as algorithmic bias and privacy issues. The paper concludes with strategic recommendations for embedding AI within existing cybersecurity frameworks and outlines future research directions focused on advanced AI models, natural language processing, and adaptive security strategies.

Cryptography is the science of maintaining data confidentiality, where the original text (plaintext) is encrypted using an encryption key to be ciphertext (text that has been encrypted). In this case cryptography secures data from a third party so that the third party cannot know the original contents of the data because the one who holds the key for encryption and decryption is only the sender and receiver. There are several cryptographic methods that are commonly used, one of which is DES or Data Encryption Standard. DES is included in the key-symmetric cryptography and is classified as a block cipher type

Citra memegang peranan sangat penting dalam bentuk informasi visual sebagai salah satu komponen multimedia. Peredaran citra dalam bentuk digital sangat mudah dan cepat baik melalui media sosial atau E-mail (Elektronic-mail). Citra digital lebih dinamis dan dapat dengan mudah di ubah-ubah (editable) baik dari segi bentuk, ukuran, maupun objek yang ada dalam citra digital tersebut. Seiring perkembangan teknologi dan komputer, peningkatan kejahatan komputer pun semakin meningkat terutama dalam manipulasi citra. Banyak cara yang di gunakan orang untuk memanipulasi citra yang dampaknya merugikan orang lain. Orisinalitas citra digital adalah keaslian dari citra tersebut baik dari segi warna, bentuk, objek dan informasi tanpa ada perubahan sedikitpun dari pihak lain. Saat ini banyak citra digital yang beredar di internet yang sudah di manipulasi dan bahkan citra sudah digunakan untuk bahan kecurangan dalam kompetisi, sehingga dibutuhkan suatu metode yang bisa untuk mendeteksi citra tersebut asli atau palsu. Dalam penelitian ini, penulis menggunakan metode Anaconda Hash untuk mendeteksi orisinalitas citra digital, dengan menggunakan metode ini citra yang masih diragukan keasliannya dapat di ketahui citra tersebut asli atau palsu.

Machine learning relies on the availability of vast amounts of data for training. However, in reality, data are mostly scattered across different organizations and cannot be easily integrated due to many legal and practical constraints. To address this important challenge in the field of machine learning, we introduce a new technique and framework, known as federated transfer learning (FTL), to improve statistical modeling under a data federation. FTL allows knowledge to be shared without compromising user privacy and enables complementary knowledge to be transferred across domains in a data federation, thereby enabling a target-domain party to build flexible and effective models by leveraging rich labels from a source domain. This framework requires minimal modifications to the existing model structure and provides the same level of accuracy as the non-privacy-preserving transfer learning. It is flexible and can be effectively adapted to various secure multi-party machine learning tasks.

With the fast development of blockchain technology in latest years, its application in scenarios that require privacy, such as health area, became encouraged and widely discussed. This paper presents an architecture to ensure the privacy of health-related data, which are stored and shared within a blockchain network in a decentralized manner, through the use of encryption with the RSA, ECC and AES algorithms. Evaluation tests were performed to verify the impact of cryptography on the proposed architecture in terms of computational effort, memory usage and execution time. The results demonstrate an impact mainly on the execution time and on the increase in the computational effort for sending data to the blockchain, however, justifiable considering the privacy and security provided with the architecture and encryption.

In a network analysis, find the critical path of the problem is an important techniques which involves planning and control of the large projects that are very complex in nature. Clear identification of each task will help to implement critical path successfully.But in real life situations the time duration cannot be predicted accurately due to  various delay or vagueness while execution of the project. During implementation of the project  one may encounter various delay or vagueness while  execution of the project.Critical path of the network gives an idea of minimum time one may expect to complete the project. Hence  the importance of the critical path play a major role in network analysis. In this paper, the concept of finding fuzzy critical path Haar Octagonal fuzzy number is introduced. New Algebraic arithmetic  of Haar Octagonal fuzzy numbers is also  discussed. A new method  for finding the critical path of the problem is introduced with the help of Floyd - Warshall  Algorithm and Haar Octagonal fuzzy numbers. A  suitable numerical examples are given to demonstrate the above methods.

As mobile devices enter a new era with high speed connectivity and increasing compute capabilities a new class of applications called social networking applications is being showcased as the next revolution in mobile computing. In this class of applications each user in a ...