dc.contributor.advisor | M, Viji | |
dc.contributor.author | P, Aboobacker | |
dc.date.accessioned | 2024-07-31T05:42:59Z | |
dc.date.available | 2024-07-31T05:42:59Z | |
dc.date.issued | 2024-06-20 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12818/1610 | |
dc.description.abstract | In the design of cryptographic algorithms, mathematical techniques,
particularly those based on number theory, abstract algebra, and lin-
ear algebra, have an inevitable place. Symmetric cryptographic algo-
rithms like block ciphers utilize finite field arithmetic and linear alge-
bra for their construction. The public key cryptographic algorithms
are sound with number-theoretical methods. Modern telecommuni-
cations technology is increasingly using advanced algebraic formula-
tions. As computational power keeps growing quickly, new ideas and
techniques for data encryption are being developed to safeguard infor-
mation as it is transmitted over open channels. So developing more
effective cryptographic primitives involving algebraic techniques is a
task strongly tied to further improving present cryptographic infor-
mation protection and communication systems. | en_US |
dc.description.statementofresponsibility | Aboobacker P. | en_US |
dc.format.extent | 128p. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Research and Postgraduate Department of Mathematics St. Thomas College (Autonomous) Thrissur | en_US |
dc.subject | cryptographic algorithms,Boolean function | en_US |
dc.title | Analysis and synthesis of functions over the rings z q with noval cryptographic characteristics | en_US |
dc.type | Thesis | en_US |
dc.description.degree | Ph.D | en_US |