Do you want to publish a course? Click here

التشفير باستخدام دالة فيثاغورثية خاصة

1239   2   484   0 ( 0 )
 Publication date 2016
  fields Mathematics
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

No English abstract

References used
Christof Paar & Jan Pelzl, Understanding Cryptography, © Springer-Verlag Berlin Heidelberg 2010
(GARRETT, P.: Making, Breaking Codes. An Introduction to Cryptology. Prentice–Hall (2007
(GOLDREICH, O.: Foundations of Cryptography. Basic Applications. Cambridge University Press (2009
rate research

Read More

This research gives a new type of encryption, using vectors give me a private encryption key, which generates a triangular matrices from the top (bottom), and check conditions matrix Hill. These matrices resulting from private vectors constitute a relatively preliminary numbers of size n = 256 The encryption process produces by multiplying the original matrix encryption keys.
The purpose of the research is to study Bergman distance to generalize Lasry – Lions regularization which play important role of theory optimization. To do that we replace the quardatic additive terms in Lasry – Lions regularization by more gene ral Bergman distance (non metric distance), and study properties generalized approximation and proof its continuous as we give a relationship between the solution minimization sets of function and Lions – Lasry Regularization and others properties.
In this paper, spline approximations with five collocation points are used for the numerical simulation of stochastic of differential equations(SDE). First, we have modeled continuous-valued discrete wiener process, and then numerical asymptotic st ochastic stability of spline method is studied when applied to SDEs. The study shows that the method when applied to linear and nonlinear SDEs are stable and convergent. Moreover, the scheme is tested on two linear and nonlinear problems to illustrate the applicability and efficiency of the purposed method. Comparisons of our results with Euler–Maruyama method, Milstein’s method and Runge-Kutta method, it reveals that the our scheme is better than others.
This paper presents a new type of encryption, using a matrix asymmetric and symmetric matrix inverse matrix clear text, which is an internal encryption. As well as asymmetric encryption, where the ciphertext is inversely symmetric matrix. Decryp tion matrix related to any asymmetric encryption keys depends on public and private, and is applied to the coded messages used in the current system ASCII our computers.
This paper describes POSTECH's quality estimation systems submitted to Task 2 of the WMT 2021 quality estimation shared task: Word and Sentence-Level Post-editing Effort. We notice that it is possible to improve the stability of the latest quality es timation models that have only one encoder based on the self-attention mechanism to simultaneously process both of the two input data, a source sequence and its machine translation, in that such models have neglected to take advantage of pre-trained monolingual representations, which are generally accepted as reliable representations for various natural language processing tasks. Therefore, our model uses two pre-trained monolingual encoders and then exchanges the information of two encoded representations through two additional cross attention networks. According to the official leaderboard, our systems outperform the baseline systems in terms of the Matthews correlation coefficient for machine translations' word-level quality estimation and in terms of the Pearson's correlation coefficient for sentence-level quality estimation by 0.4126 and 0.5497 respectively.

suggested questions

comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا