scholarly journals A New Method Encryption and Decryption

Webology ◽  
2021 ◽  
Vol 18 (1) ◽  
pp. 20-31
Author(s):  
Ali Abdulwahhab Mohammed ◽  
Haitham A. Anwer
Keyword(s):  
New Method ◽  
Huge Number ◽  
Private Key ◽  
Encryption And Decryption ◽  
Long Time ◽  
Security Guarantees

In all times manual investigation and decryption of enciphered archives is a repetitive and mistake inclined work. Regularly considerably in the wake of investing a lot of energy in a specific figure, no decipherment can be found. Computerizing the unscrambling of different kinds of figures makes it conceivable to filter through the huge number of encoded messages found in libraries and files. We propose in this paper new algorithm has been made to encrypt the information; this algorithm works to shield information from robbery and can't be decrypted in the text. It is taken care of precisely to very accurately to avoid any penetration to arrive at the first text. It tends to be used in companies or some other system; however, it takes a long time to encrypt it. To the first text when encryption to ensure the assurance of information in full and security. Encrypted text contains a unique key, even when stolen. The private key can't be decrypted by the specialist and licensed by the maker of the code in order to protect the data in an excellent manner. While demonstrating in addition much stronger security guarantees with regards to Differential/ direct assaults. Specifically, we are can to provide new Method Encryption and Decryption with strong bounds for all versions.

Taufiqul Hakim “Amtsilati” dan Pengajaran Nahwu-sharaf

1970 ◽  
Vol 11 (3) ◽  
pp. 389-407
Author(s):  
M Misbah
Keyword(s):  
Reading Skill ◽  
Huge Number ◽  
Time Efficiency ◽  
Study Materials ◽  
Long Time

One of skill becoming goals in study Arabic Ianguage reading skill. Someone wish to reach it must mastering various interconnected knowledge, among others Nahwu –Sharaf. This knowledge becomes burden to one whom studying it especially for beginner. This because the huge number of items exist in Nahwu-Sharaf, so that need very long time to mastering it. This Items effectiveness and time efficiency represent the problem in Nahwu-Sharaf learning. These matters become Taufiqul Hakim’s study materials and concern. Finally he found one new format of efficient and effective method and items in learning Nahwu-Sharaf. The Items compiled in his books entitled “Buku Amtsilati” and his method knows as Amtsilati Method. The application of Amtsilati Method in Nahwu – Sharaf learning emphasize the student activeness, with rather few theory but much practice and also delivering items start from easy then gradually reaching difficult ones.

EVOLUTION OF SANDY BEACH IN THE CITY OF VARNA

2017 ◽  
Author(s):  
Dachev Veliko Z ◽  
Dachev Veliko Z
Keyword(s):  
Retrospective Review ◽  
Anthropogenic Impact ◽  
Sandy Beach ◽  
New Method ◽  
Coastal Protection ◽  
Area Growth ◽  
Long Time ◽  
The City ◽  
Further Development ◽  
Beach Volume

The article represents a retrospective review of long time research of genesis and development of the Central beach in the City of Varna which makes possible a forecast of its further development. Both natural and anthropogenic impact on the beach evolution is taken into consideration. It is ascertained that construction of coastal protection structures at the northern part of the beach in 80’s resulted in cessation of natural beach area growth. The strengthen of a breakwater in the main port and illegal building also contributed to considerable coast recession and beach volume reducing. Because of this a recreational potential of the Central beach is gradually decreasing. New method named “cross-shore sediment bypassing” is suggested to reduce the negative trend.

EVOLUTION OF SANDY BEACH IN THE CITY OF VARNA

2017 ◽  
Author(s):  
Dachev Veliko Z ◽  
Dachev Veliko Z
Keyword(s):  
Retrospective Review ◽  
Anthropogenic Impact ◽  
Sandy Beach ◽  
New Method ◽  
Coastal Protection ◽  
Area Growth ◽  
Long Time ◽  
The City ◽  
Further Development ◽  
Beach Volume

The article represents a retrospective review of long time research of genesis and development of the Central beach in the City of Varna which makes possible a forecast of its further development. Both natural and anthropogenic impact on the beach evolution is taken into consideration. It is ascertained that construction of coastal protection structures at the northern part of the beach in 80’s resulted in cessation of natural beach area growth. The strengthen of a breakwater in the main port and illegal building also contributed to considerable coast recession and beach volume reducing. Because of this a recreational potential of the Central beach is gradually decreasing. New method named “cross-shore sediment bypassing” is suggested to reduce the negative trend.

scholarly journals Clustering-Based Component Fraction Estimation in Solid–Liquid Two-Phase Flow in Dredging Engineering

Sensors ◽  
2020 ◽  
Vol 20 (19) ◽  
pp. 5697
Author(s):  
Chang Sun ◽  
Shihong Yue ◽  
Qi Li ◽  
Huaxiang Wang
Keyword(s):  
Clustering Algorithm ◽  
Two Phase Flow ◽  
Low Cost ◽  
Fast Response ◽  
New Method ◽  
Phase Flow ◽  
Reference Distribution ◽  
Two Phase ◽  
Long Time ◽  
Solid Liquid

Component fraction (CF) is one of the most important parameters in multiple-phase flow. Due to the complexity of the solid–liquid two-phase flow, the CF estimation remains unsolved both in scientific research and industrial application for a long time. Electrical resistance tomography (ERT) is an advanced type of conductivity detection technique due to its low-cost, fast-response, non-invasive, and non-radiation characteristics. However, when the existing ERT method is used to measure the CF value in solid–liquid two-phase flow in dredging engineering, there are at least three problems: (1) the dependence of reference distribution whose CF value is zero; (2) the size of the detected objects may be too small to be found by ERT; and (3) there is no efficient way to estimate the effect of artifacts in ERT. In this paper, we proposed a method based on the clustering technique, where a fast-fuzzy clustering algorithm is used to partition the ERT image to three clusters that respond to liquid, solid phases, and their mixtures and artifacts, respectively. The clustering algorithm does not need any reference distribution in the CF estimation. In the case of small solid objects or artifacts, the CF value remains effectively computed by prior information. To validate the new method, a group of typical CF estimations in dredging engineering were implemented. Results show that the new method can effectively overcome the limitations of the existing method, and can provide a practical and more accurate way for CF estimation.

Security Based Processed Video Distribution on Multi-Core System

2014 ◽  
Vol 984-985 ◽  
pp. 1357-1363
Author(s):  
M. Vinothini ◽  
M. Manikandan
Keyword(s):  
Computation Time ◽  
Communication Process ◽  
Secret Key ◽  
Core System ◽  
Ip Address ◽  
Video Distribution ◽  
Encryption And Decryption ◽  
Security Guarantees ◽  
Secured Communication ◽  
Parallel Fashion

During real time there are problems in transmitting video directly to the client. One of the main problems is, intermediate intelligent proxy can easily hack the data as the transmitter fails to address authentication, and fails to provide security guarantees. Hence we provide steganography and cryptography mechanisms like secure-code, IP address and checksum for authentication and AES algorithm with secret key for security. Although the hacker hacks the video during transmission, he cannot view the information. Based on IP address and secure-code, the authenticated user only can get connected to the transmitter and view the information. For further improvement in security, the video is converted into frames and these frames are split into groups and separate shared key is applied to each group of frames for encryption and decryption. This secured communication process is applied in image processing modules like face detection, edge detection and color object detection. To reduce the computation time multi-core CPU processing is utilized. Using multi-core, the tasks are processed in parallel fashion.

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

scholarly journals Matrix-Based RSA Encryption of Streaming Data

2021 ◽  
Author(s):  
Michael Prendergast
Keyword(s):  
Streaming Data ◽  
New Method ◽  
Encryption Algorithm ◽  
Public Key ◽  
Invertible Matrix ◽  
Integer Coefficients ◽  
Private Key ◽  
Matrix Generalization ◽  
Euler Totient Function ◽  
The Matrix

This paper describes a new method for performing secure encryption of blocks of streaming data. This algorithm is an extension of the RSA encryption algorithm. Instead of using a public key (e,n) where n is the product of two large primes and e is relatively prime to the Euler Totient function, φ(n), one uses a public key (n,m,E), where m is the rank of the matrix E and E is an invertible matrix in GL(m,φ(n)). When m is 1, this last condition is equivalent to saying that E is relatively prime to φ(n), which is a requirement for standard RSA encryption. Rather than a secret private key (d,φ(n)) where d is the inverse of e (mod φ(n)), the private key is (D,φ(n)), where D is the inverse of E (mod (φ(n)). The key to making this generalization work is a matrix generalization of the scalar exponentiation operator that maps the set of m-dimensional vectors with integer coefficients modulo n, onto itself.

scholarly journals RISKS, DANGERS, THREATS OF “CONTINUOUS” E-EDUCATION

2020 ◽  
pp. 58-62
Author(s):  
T. Yu. Krotenko
Keyword(s):  
Information And Communication Technologies ◽  
Communication Technologies ◽  
Educational Process ◽  
Digital Learning ◽  
Educational Materials ◽  
Huge Number ◽  
Significant Events ◽  
Educational Structures ◽  
Long Time ◽  
Information And Communication

The term “digitalization” for a long time settled in the agenda of significant events dedicated to education. The education system, fulfilling the adopted program, should prepare a huge number of schoolchildren, students and workers for life with the indispensable use of information and communication technologies. However, often the actual digitalization is reduced either to the digitization of educational materials and documents in educational structures, or to unhindered access to the Internet. If the request for digitalization is addressed to education, then, being in the pedagogical space, it would be reasonable to first determine what and how to teach. The problem of the lack of a reasonable psychological and pedagogical concept of digital learning, which could be used by the subjects of the educational process as a basic one, is raised in the article.

Implementation of Algorithms for Identity Based Encryption and Decryption

2021 ◽  
pp. 315-327
Author(s):  
Kannan Balasubramanian ◽  
M. Rajakani
Keyword(s):  
Third Party ◽  
Public And Private ◽  
Trusted Third Party ◽  
Private Key ◽  
Identity Based Encryption ◽  
Encryption And Decryption ◽  
Semantic Security ◽  
Identity Based ◽  
Mail Address ◽  
E Mail

Identity-based cryptosystems were introduced to overcome one of the main problems in public key encryption, the generation of public and private keys. In the identity-based cryptosystem, an identifier such as an e-mail address of a user can be used to generate public and private keys by a trusted third party. The trusted third party uses a system-wide master secret to provide private keys to a user. Identity-based cryptosystems can be constructed using the idea of pairings. This article discusses four different identity-based cryptosystems: the Boneh-Franklin scheme, the Cock's scheme, the Authenticated IBE scheme and the Hierarchical IBE scheme. This article also discusses the security notions considered for the identity-based cryptosystem. The security notions considered are: one-wayness, indistinguishability, semantic security and non-malleability. An architecture consisting of a public parameter server and private key generator for the implementation of the identity-based cryptosystems is also discussed.

Hybrid Cryptography for Random-key Generation based on ECC Algorithm

2017 ◽  
Vol 7 (3) ◽  
pp. 1293 ◽  
Author(s):  
P. Gayathri ◽  
Syed Umar ◽  
G. Sridevi ◽  
N. Bashwanth ◽  
Royyuru Srikanth
Keyword(s):  
Security Level ◽  
Key Generation ◽  
Public Key Encryption ◽  
Private Key ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Safe Side ◽  
Key Length ◽  
High Level ◽  
User Friendly

As more increase in usage of communications and developing them more user friendly. While developing those communications, we need to take care of security and safety of user’s data. Many researchers have developed many complex algorithms to maintain security in user’s application. Among those one of the best algorithms are cryptography based, in which user will be safe side mostly from the attackers.  We already had some AES algorithm which uses very complex cryptographic algorithm to increase the performance and more usage of lookup tables. So the cache timing attackers will correlates the details to encrypt the data under known key with the unknown key. So, for this we provide an improvised solution. This paper deals with an extension of public-key encryption and decryption support including a private key. The private key is generated with the combination of AES and ECC. In general AES, key length is 128 bits with 10 times of iterations. But with this, users won’t get efficient security for their operations, so to increase the security level we are implementing 196-bit based encryption with 12 times round-key generation iterations. By this enhancement, we can assure to users to high level security and can keep users data in confidential way.

Sign in / Sign up

Export Citation Format

Share Document