Cryptography

We present an asymptotically optimal reduction of one-outof-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunction with Privacy Amplification. Interactive Hashing is used in an innovative way to test the receiver's adherence to the protocol. We show that (1 + )k uses of Bit OT suffice to implement String OT for k-bit strings. Our protocol represents a two-fold improvement over the best constructions in the literature and is asymptotically optimal. We then show that our construction can also accommodate weaker versions of Bit OT, thereby obtaining a significantly lower expansion factor compared to previous constructions. Besides increasing efficiency, our constructions allow the use of any 2-universal family of Hash Functions for performing Privacy Amplification. Of independent interest, our reduction illustrates the power of Interactive Hashing as an ingredient in the design of cryptographic protocols.

Authentication is a well-studied area of classical cryptography: a sender and a receiver sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming and have access to an insecure quantum channel and share a private, classical random key, we provide a non-interactive scheme that both enables to encrypt and authenticate (with unconditional security) an Ñ qubit message by encoding it into Ñ•× qubits, where the probability decreases exponentially in the security parameter ×. The scheme requires a private key of size ¾Ñ • Ç´×µ. To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically: authentication and encryption are independent tasks, and one can authenticate a message while leaving it publicly readable. This reasoning has two important consequences: On one hand, it allows us to give a lower bound of ¾Ñ key bits for authenticating Ñ qubits, which makes our protocol asymptotically optimal. On the other hand, we use it to show that digitally signing quantum states is impossible, even with only computational security.

In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing qbc scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n 2 ) executions of the statistically binding scheme. As a consequence, statistically concealing but computationally binding quantum bit commitments can be based upon any family of quantum one-way functions. Such a construction is not known to exist in the classical world.

The standard security definition of unconditional secure function evaluation, which is based on the ideal/real model paradigm, has the disadvantage of being overly complicated to work with in practice. On the other hand, simpler ad-hoc definitions tailored to special scenarios have often been flawed. Motivated by this unsatisfactory situation, we give an information-theoretic security definition of secure function evaluation which is very simple yet provably equivalent to the standard, simulation-based definitions.

Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be consider in the scenario where a cheating party has some degree of control over the channel characteristics. Damg ård et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permited to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious transfer protocols. Given that noisy channels are a precious resource for cryptographic purposes, one important question is determining the optimal rate in which they can be used. The commitment capacity has already been determined for the cases of discrete memoryless channels and Gaussian channels. In this work we address the problem of determining the commitment capacity of unfair noisy channels. We compute a single-letter characterization of the commitment capacity of unfair noisy channels. In the case where an adversary has no control over the channel (the fair case) our capacity reduces to the well-known capacity of a discrete memoryless binary symmetric channel.

The Wire-Tap Channel of Wyner shows that a Binary Symmetric Channel may be used as a basis for exchanging a secret key, in a crypt,ographic scenario of two honest people facing an eavesdropper. Later CrCpeau and Kilian showed how a BSC may be used to implement Oblivious Transfer in a cryptographic scenario of two possibly dishonest people facing each other. Unfortunately this result is rather impractical as it requires f l ( n " ) bits to be transmitted through the BSC to accomplish a single OT. The current paper provides efficient protocols to achieve the cryptographic primitives of Bit Commitment and Oblivious Transfer based on the existence of a Binary Symmetric Channel. Our protocols respectively require sending O(n) and O ( n 3 ) bits through the BSC. These results are based on a technique known as Generalized Privacy Amplification [l] that allow two people to extract secret information from partially compromised data. * Supported in part by Qukbec's FCAR and Canada's NSERC.

Assume A owns two secret k-bit strings. She is willing to disclose one of them to B , at his choosing, provided he does not learn anything about the other string. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement One-out-of-two String Oblivious Transfer, denoted (:)-OTk. This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 of two one-bit secrets: this is known as One-out-of-two Bit Oblivious Transfer, denoted (:)-OT. We address the question of reducing (:)-OTk to (:)-OT. This question is not new: it was introduced in 1986. However, most solutions until now have implicitly or explicitly depended on the notion of self-intersecting codes. It can be proved that this restriction makes it asymptotically impossible to implement (:)-OTk with fewer than about 3.5277k instances of (:)-OT. The current paper introduces the idea of using privacy amplification as underlying technique to reduce (:)-Ork to (:)-OT. This allows for more efficient solutions at the cost of an exponentially small probability of failure: it is sufficient t,o use slightly more than 2k instances of (:)-OT in order to implement (f)-OTk. Moreover, we show that privacy amplification allows for the efficient implementation of (:)-OTk from generalized versions of (:)-OT that would not have been suitable for the earlier techniques based on self-intersecting codes. An application of this more general reduction is given.

The e-learning applications of today require a special focus on security. Distributed e-learning applications have several modules user can access using different clients (desktop or mobile). The same user has several accounts with different credentials. In this context, the SSO (Single Sign-On) solutions become very attractive since the user has to log in once and can access all the needed resources without being prompted again for the username and password. Using the OpenID standard for e-learning Web-based applications is a good and reliable solution because it supports both URL and XRI identifiers. This paper presents the main characteristics of OpenID standard and how this standard could be implemented for a distributed, Web-based, elearning application.

Due to the rapid growth of telemedicine and healthcare services, color medical image security applications have been expanded precipitously. In this paper, an asymmetric PTFrFT (Phase Truncated Fractional Fourier Transform)-based color medical image cryptosystem is suggested. Two different phases in the fractional Fourier and output planes are provided as deciphering keys. Accordingly, the ciphering keys will not be employed for the deciphering procedure. Thus, the introduced PTFrFT algorithm comprises asymmetric ciphering and deciphering processes in contrast to the traditional optical symmetric OSH (Optical Scanning Holography) and DRPE (Double Random Phase Encoding) algorithms. One of the principal impacts of the introduced asymmetric cryptosystem is that it eliminates the onedimensionality aspects of the related symmetric cryptosystems due to its remarkable feature of phase nonlinear truncation components. More comparisons on various color medical images are examined and analyzed to substantiate the cryptosystem efficacy. The achieved experimental outcomes ensure that the introduced cryptosystem is robust and secure. It has terrific cryptography performance compared to conventional cryptography algorithms, even in the presence of noise and severe channel attacks.

Abstract: In recent years, a discussion on relationship between Electronic Warfare (EW), Information Warfare (IW), Cyber Operations, Net-Centric Warfare, Command and Control, Information Operations (IO) and other constructs has emerged. This paper proposes a layered model, similar to the Open Systems Interconnection (OSI) model in an attempt provide a new perspective on this discussion. A number of layers are defined and the roles and relationships between EW, IW, IO etc. are considered with respect to this new model. ...

GOLOVKO V. A., MIKHNO E. V., BRICH A. L., MIKHNYAEV A. L., VOYTSEKHOVICH L. Yu., MATYUSHKOV A. L. The reduced svertochny neural network for exact recognition of hand-written figuresВ данной статье рассматривается сверточная нейронная сеть для распознавания рукописных цифр. Разработана упрощенная архитектура сверточной нейронной сети, которая позволяет классифицировать рукописные цифры с точностью 99.29% (ошибка тестирования 0.71%), что является лучшим результатом в классе неглубоких (shallow) сверточных нейронных сетей

This paper presents a synthesis of Sebastian Schepis' Prime Resonant Keytriplet framework into the broader architecture of Omniological Resonance Theory (ORT), offering a novel model for non-local, symbolic communication grounded in resonance dynamics. By aligning the Keytriplet structure—comprising private, public, and resonant keys—with ORT's cognitive coherence model, we construct a triadic formalism for symbolic field transmission. Through operator-based mappings, symbolic Hamiltonians, and session field evolution equations, this framework formalizes transpersonal resonance and secure, entropy-minimal information transfer. The result is a unified theory of symbolic coherence, capable of encoding and decoding meaning across space-time without reliance on classical signal propagation. This synthesis bridges quantum logic, symbolic cognition, and transdimensional communication into a coherent theoretical and practical schema, with implications for consciousness research, secure messaging, and the physics of coherence itself.

We present a rigorous formal framework for Prime-Resonant Universal Translation and Non-Local Communication (PR-UTC). Central to the system is the Keytriplet structure (K priv u , K pub u , K res u), a prime-resonant symbolic fingerprint enabling secure, entropy-conserving communication across symbolic fields. We define the Resonance Field Initialization Operator R, the Symbolic Projection Operator P, the Key Evolution Operator U (∆t), and formalize Session Field Evolution Equations governing dynamic symbolic collapse and message decoding. The framework models communication as symbolic field resonance rather than classical message passing, offering a fundamentally new paradigm for secure, non-local semantic interaction.

The invention is related to development of a secure, tamperproof, expandable, configurable electronic product for conducting fair polls compared to exiting polling methods. The invented system has been named as Indigenous Voting System (IVS). IVS is composed of the electronic Indigenous Voting Machine (IVM) and Operational Methodology (OM). IVM is an ensemble of electronic products (A Computer, Control Unit,

Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.

NIST is in the process of evaluating public-key digital signature algorithms for potential standardization to protect sensitive information into the foreseeable future, including after the advent of quantum computers. Any signature scheme that is eventually selected would augment FIPS 204, Module-Lattice-Based Digital Signature Standard; FIPS 205, Stateless Hash-Based Digital Signature Standard; FIPS 186-5, Digital Signature Standard (DSS); and SP 800-208, Recommendation for Stateful Hash-Based Signature Schemes. This report describes the evaluation criteria and selection process of the First Round of the Additional Digital Signatures for the NIST Post-Quantum Cryptography (PQC) Standardization Process. Based on public feedback and internal reviews of the first-round candidates, NIST selected14 candidate algorithms to move forward to the second round of evaluation: CROSS, FAEST, HAWK, LESS, MAYO, Mirath (merger of MIRA/MiRitH), MQOM, PERK, QR-UOV, RYDE, SDitH, SNOVA, SQIsign, and UOV.

The National Institute of Standards and Technology is in the process of selecting public-key cryptographic algorithms through a public, competition-like process. The new public-key cryptography standards will specify additional digital signature, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers. The first round of the NIST Post-Quantum Cryptography Standardization Process began in December 2017 with 69 candidate algorithms that met both the mini...

The National Institute of Standards and Technology (NIST) opened a public competition on November 2, 2007 to develop a new cryptographic hash algorithm -SHA-3, which will augment the hash algorithms currently specified in the Federal Information Processing Standard (FIPS) 180-3, Secure Hash Standard. The competition was NIST's response to advances in the cryptanalysis of hash algorithms. NIST received sixty-four submissions in October 2008, and selected fifty-one candidate algorithms as the first-round candidates on December 10, 2008, and fourteen as the second-round candidates on July 24, 2009. One year was allocated for the public review of the second-round candidates. On December 9, 2010, NIST announced five SHA-3 finalists to advance to the third (and final) round of the competition. This report summarizes the evaluation and selection of the five finalists -BLAKE, Grøstl, JH, Keccak and Skein.

There may be references in this publication to other publications currently under development by NIST in accordance with its assigned statutory responsibilities. The information in this publication, including concepts and methodologies, may be used by federal agencies even before the completion of such companion publications. Thus, until each publication is completed, current requirements, guidelines, and procedures, where they exist, remain operative. For planning and transition purposes, federal agencies may wish to closely follow the development of these new publications by NIST. Organizations are encouraged to review all draft publications during public comment periods and provide feedback to NIST. All NIST Computer Security Division publications, other than the ones noted above, are available at .

This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST's position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed.

This work describes the design and implementation of an auction system using secure multiparty computation techniques. Our aim is to produce a system that is practical under actual field constraints on computation, memory, and communication. The underlying protocol is privacy-preserving, that is, the winning bid is determined without information about the losing bids leaking to either the auctioneer or other bidders. Practical implementation of the protocol is feasible using circuit-based cryptographic proofs along with additively homomorphic bit commitment. Moreover, we propose the development of a Proof Certificate standard. These certificates convey sufficient information to recreate the cryptographic proofs and verify them offline.

In developing democracies of the world, the electoral process is often enmeshed in distrust, fraud, unprecedented level of rigging and in most cases ends up in courts of law where millions of hard earned funds (public and private) are wasted. Nigeria, despite her democratic experience, has remained ‘exemplary’ in such profligacy. The reason has always been the absence of a reliable electoral process capable of ensuring a fraud-free general election with the use of the available technology. In this paper, a Semi-Automated Electoral System (SAES) that uses biometric technology is proposed to enhance the electoral system and minimize fraud often associated with the process. The system is based on research into the past electoral processes in the years 2003, 2007 and 2011 in Nigeria and the attempted but unsuccessful introduction of said technology. Biometric technology is the most patronized identity enhancement technique used today in the ICT industry and has been successfully impleme...

As the dependence of daily life is increasing on Internet technology, the attacks on the systems, servers are also rapidly increasing. The motives of attacks are to steal the confidential data from the systems or making the system unavailable to the authorised users. An effective approach is required to detect the intrusions to provide the defence to the Networks. First we applied the feature selection to reduce the dimensions of NSL-KDD data set. By feature reduction and machine learning approach we able to build Intrusion detection model to find attacks on system and improve the intrusion detection using the captured data. The intrusion detection accuracy of learning algorithms is also performed on the data set, without the level 21 attacks which is most easy to identify attacks, using learning algorithms and the success rate of proposed model is calculated over the attacks which are hard to detect.

Steganography is the art and science of secret communication. Various types of media, such as images, videos, audio etc. can be used to hide the message. This paper presents an approach to steganography using LBP on a cluster formed by the CIELAB (Informally called Lab) based k-means clustering. Image Steganography embeds the secret message into the images exclusively. Basically Image Steganography uses LSB of pixels to embed the message, but this lone technique is easily detectable, so LBP is the technique which is used in the approach to embed data into image. It uses the pattern classification characteristics to modify the values of pixels in such a way that the modification yields the message requirements and aids the extraction process. But using pure LBP is also detectable and messages can be retrieved. Even to secure the location of LBP hidden message in the image, segmentation is used for hiding the using only desired areas of the image. For segmentation various clustering t...

The history of technology is marked by moments when two forces converge and reshape the world. Today, we stand at one of those inflection points: artificial intelligence (AI) and blockchain technology are not merely approaching each other… they are destined to merge. This document is not a technical thesis nor a traditional academic essay. It is a vision. A conviction. A manifesto on why the convergence of AI and blockchain represents the new foundation for the decentralized financial systems of the future.

This paper provides a thorough exploration of the applications of nilpotent groups for some n ≥ 1 in cryptography, focusing on their unique algebraic properties and their role in designing secure cryptographic systems. Through an in-depth analysis of cryptographic protocols utilizing nilpotent groups, this paper contributes to a deeper understanding of the potential and computational integration of nilpotent groups which isa key to quantum era cryptography.

With increasing popularity and applicability of wireless sensor networks, the limitations which restrict the lifetime of network are also arising. It is observed that the energy utilized in transmission is more than processing the data in wsn. So, many approaches are proposed to tackle the problem of power consumption, used while transmission. One of the approaches include the compression of data to be transmitted and recovery of it at sink node in wsn. Under this, different data compression algorithms which are compatible for wireless sensor network are described which helps to save energy in wireless sensor network.

In recent times the leakage of personal information and commercial secrets has increased by leaps and bounds. According to statistics in 2007 average no of victims for leak of personal information were 7, 85,568 and average no of victims for leak of commercial secrets were 2, 94,794. Of course these figures are not at all good for a developing company and nor for a company which is developed. Wireless Surveillance System has the solution to this problem. Wireless Surveillance System model consists of IR transmitter and receiver, microcontroller board, computer (with internet), webcam, mobile. In this model when IR is interrupted the signal is send to the microcontroller which is connected to the computer, the computer then disables the keyboard, mouse also activates web cam simultaneously and sends live video to the GPRS enabled mobile. It also sends SMS messages in case the administrator is unable to view online images due to lack of internet connection of less

A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.

The revolutionary advancement in the capabilities of hardware tools, software packages, and communication techniques gave rise to the Internet of Things-supported drone networks (IoD), thereby enabling smooth communication among devices and applications, and impacting drastically the various aspects of human lives. However, with the increasing sophistication in the infrastructure of IoD, new security threats arise that require novel algorithms and schemes as solutions. To this end, several schemes have recently been proposed. However, some schemes cannot perfectly address the novel security aspects associated with IoD environments, while others cannot provide computational or communication efficiency. Motivated by these research gaps in the existing literature, we leverage elliptic curve cryptography along with symmetric encryption and hash function, and propose a novel and robust user authentication mechanism for the IoD, called RUAM-IoD. We validate the security of the established SK formally through the random oracle model. Similarly, we provide informal security analysis to demonstrate the security capabilities of RUAM-IoD against different pernicious security attacks. Likewise, we establish a comparison of the RUAM-IoD with several state-of-the-art authentication schemes to show that RUAM-IoD acquires less storage, communication, and computational cost.

Optical tweezers represent a powerful tool for a variety of applications both in biology and in physics. Standard optical tweezers make use of a freely propagating laser beam that is tightly focused near the sample by means of a high-numerical-aperture microscope objective. Most of the limitations associated with the microscope's bulky structure could be overcome by exploiting optical fibres for the delivery of the trapping radiation, provided that proper beam-shaping is performed. Here we present the design and the realization of a miniaturized single-fibre optical tweezer that is able to create a purely optical three-dimensional trap. The tweezer uses engineered fibre structures with microstructured end surfaces, and its effectiveness is demonstrated by trapping 10-mm-diameter polystyrene beads. The optical tweezer is able to provide optical manipulation and analysis of microscale specimens and could be the fundamental building block in future integrated fibre-based devices.

The quantum cryptography (which is known as key-distribution) is the mechanism introduced to overcome the existing loophole of protection mechanisms to be prevented to compromise the systems with sensitive information. According to the facts on last decade such sensitive information will be passed on between allies along with plethora of different communication channel among the entire globe. Why quantum cryptography is dominated the communication technology is the brilliant question raised from the industries. Due to the sophisticated technology being applied reduced the threat level and exploitation via the communication channels to reach through the existing vulnerabilities. Quantum Key Distribution Protocol (QKD) is provided unconditional security of cyberspace in quantum cryptographic [9]. A technique which is more sophisticated to protected the critical information and the data with is important to business continuity is the field of Quantum Cryptography/Cryptology. Without the learning process of the cryptographic it is impossible to understanding of the method used for protection. Highly guaranteed security protocol is quantum cryptography which can be designed to offer guaranteed security services in communication networks. This paper briefly outlines the process of the general procedure of design and application of quantum cryptography protocol in network [1].

Francis Bacon, born in 1561, was a remarkable figure in English history, excelling as a politician, philosopher, scientist, and writer. Despite facing challenges and persecution, including false bribery charges, Bacon’s brilliance shone through in his contributions to science, literature, and law. He is remembered as the “father of modern science” for his groundbreaking works like “Novum Organum,” which revolutionized scholarship and laid the foundation for contemporary scientific inquiry.

The disappearance of Lord Francis Bacon in 1626 is shrouded in mystery, with evidence suggesting he faked his death to escape political persecution. His supposed tomb in St. Albans is elusive, with conflicting accounts and a puzzling bathroom tile covering a possible inscription. Bacon’s philosophy, emphasizing inductive reasoning, religious faith, and the unity of science and religion, remains influential, focusing on understanding human nature through observation, experimentation, and tradition.

Francis Bacon’s scientific method focused on removing superficialities to uncover the underlying reality. He believed that absolute truth, like God, is intangible and cannot be analyzed. Bacon advocated for a practical, dynamic approach to knowledge, emphasizing its application for progress and understanding the universe, ultimately seeking God.

Bacon envisioned a world ruled by wisdom and virtue, where living truths guide humanity. This ideal, the City of Peace, is achievable through knowledge, living, and teaching others.

Anyone can send a confidential message by just using public information, but the message can only be decrypted with a private key, which is in the sole possession of the intended recipient. It is really appreciable method to provide high security to the medical image or patient's information. Which provide us integrated secure transmission of medical information like Image, Audio, Video etc. with a common key. We also use lossless compression technique like SEQUITUR for efficient utilization of communication channel. The combination of encryption with compression provides confidentiality in the transmission.

1*Research Scholar Singhania University, Jhunjhunu, Rajsthan & Department of MCA, Raj Kumar Goel Engineering College, Ghaziabad, UP, India. dwivediabhi@gmail.com1 2Department of Mathematics, RKG Institute of Technology, Ghaziabad, UP, India. ojhdb@yahoo.co.in2 3 ...

Bina Darma University has a website where visitors can access various information, but specifically to enter the academic information system, students need to log in first. The log in page is implemented so that the page visitors who obtain the information are truly legitimate and authenticated people. The purpose of this study is to determine the speed performance of the Brute Force Algorithm to find out how well the security of the Bina Darma university's academic information system website from brute force attacks so that researchers are able to understand how the brute force attack works so that the best way to be safe from the attack can be obtained. This research uses C # programming language and Microsot Visual Studio as a text editor. The process of sending 500 -4000 data produces an average time of 0.17 seconds while for the manual process requires 16 seconds.

In the 1960's voice communication was carried to end subscribers almost exclusively on copper wires running from central office switches to homes and businesses, and television was broadcast to homes almost exclusively through the air modulated on electromagnetic ...

1M.E Student, Computer Department, Y.T.I.E.T Collage Karjat, Maharashtra, India 2,3Professor, Computer Department, Y.T.I.E.T Collage Karjat, Maharashtra, India ---------------------------------------------------------------------***---------------------------------------------------------------------Abstract The hyperchaotic sequence and the DNA sequence are utilized jointly for image encryption. A fourdimensional hyperchaotic system is used to generate a pseudorandom sequence. The main idea is to apply the hyperchaotic sequence to almost all steps of the encryption. All intensity values of an input image are converted to a serial binary digit stream, and the bitstream is scrambled globally by the hyperchaotic sequence. DNA algebraic operation and complementation are performed between the hyperchaotic sequence and the DNA sequence to obtain a robust encryption performance. The proposed hyperchaotic sequence and DNA sequence based (HC-DNA) method is compared with the chaotic sequence...

1SES’s YADAVRAO TASGAONKAR INSTITUTE OF ENGINEERING AND TECHNOLOGY, DEPARTMENT OF COMPUTER ENGINEERING. 2PROFESSOR, VILLAGE –CHANDHAI, TALUKA–KARJAT, DISTRICT-RAIGAD (MAHARASHTRA), INDIA. ----------------------------------------------------------------***--------------------------------------------------------------ABSTRACTThe purpose of homomorphic encryption is to allow computation on encrypted data. Thus data can remain confidential while it is processed, enabling useful tasks to be accomplished with data residing in entrusted environments. In a world of distributed computation and heterogeneous networking this is a hugely valuable capability. Many conventional encryption schemes possess either multiplicative or additive homomorphic property and are currently in use for respective applications. Yet, a Fully Homomorphic Encryption (FHE) scheme which could perform any arbitrary computation over encrypted data appeared in 2009 as Gentry’s work. In this paper, we propose a multi-clou...

Ransomware is a malware family that using security techniques such as cryptography to hijacking user files and associated resources and requests cryptocurrency in exchange for the locked data. There is no limit to who can be targeted by ransomware since it can be transmitted over the internet. Like traditional malware, ransomware may enter the system utilizing "social engineering, malware advertising, spam emails, take advantage of vulnerabilities, drive-by downloads or through open ports or by utilizing back doors". But in contrast to traditional malware, even after removal, ransomware influence is irreparable and tough to alleviate its impact without its creator assistance. This kind of attack has a straightforward financial implication, which is fueled by encryption technology, cyber currency. Therefore, ransomware has turned into a profitable business that has obtained rising popularity between attackers. As stated by "Cybersecurity Ventures", ransomware is the quickest increasing type of cybercrime. Since, global ransomware wastage expense is predicted to hit $20 billion in 2021, up from just $325 million in 2015 which, is 57X extra in 2021. In this paper, a brief of the recent research in the prevention of ransomware attacks and the best practices to mitigate the attack impact is presented.