Do you want to publish a course? Click here

A study about the solution of the cubic congruence module a prime and application it in cryptography

دراسة حلول التطابق التكعيبي بالنسبة للأعداد الأولية و تطبيقاته في علم التشفير

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




Ask ChatGPT about the research

In This Paper we will determine the solution of the congruence and apply the results in cryptography.



References used
DENCE, J.B. ,and DENCE,T.P., (1999) ˗ Elements of the theory of numbers. Missouri J. Math . sci. , 10 , 217-239P
IRELAND, K & ROSEN, M,( 1990) ˗ A Classical Introduction to Modern Number Theory, Springer -Verlag , New York, Inc,28-33 P
K, NEAL,(1987)-A course in Number Theory and Cryptography, Springer –Verlag, 33-123P
rate research

Read More

This thesis presents new mechanisms and methods for encryption from algorithms and mathematical theories with their proofs. Methods for encryption (blinding) and decryption (decryption) within text messages have been presented.
In this paper we study the relationship between the maximal (prime) elements of M and the maximal (prime) elements of L. We show that, if L is a local lattice and the greatest element of M is weak principal, then M is local . Then we define the Ja cobson radical of M and denote it by J(M) and we study its relationship with the Jacobson radical of L (J(L)) . Afterwards, we define the semiprime element in a lattice module M, and we show that the definitions of prime element and semiprime element are equivalent when the greatest element of M is multiplication and we study the properties equivalent to the properties of prime element in lattice module .
The subject of the option exchange of important issues in the jurisprudence of financial transactions, as it falls under the jurisprudence of the options associated with Palmtbaiein and needs of Islamic banks in their commercial transactions, as p eople need to be treated in Bauahm, and briefly enable the requirement of prudence in the price it becomes Mncoda or not, what is the truth this option? Schools of Islamic jurisprudence and the position of it? , And what are the conditions of his? And its impact on the contracts? What are the applications in modern banks?.
Quantum Computers can be considered the biggest threat against cryptography algorithms especially the public key algorithms. In this seminar, we will discuss Quantum Computers starting from a simple explanation about the physics and mathematics basic s behind these computers, then explaining why these computers are special in regard of cracking the public key algorithms. Finally, we will describe an example of quantum resistant algorithms.
Linear programming (LP, or linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region is a convex polyhedron, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality. Its objective function is a real-valued affine function defined on this polyhedron. A linear programming algorithm finds a point in the polyhedron where this function has the smallest (or largest) value if such a point exists.

suggested questions

comments
Fetching comments Fetching comments
mircosoft-partner

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