Show simple item record

dc.contributor.advisorM, Viji
dc.contributor.authorP, Aboobacker
dc.date.accessioned2024-07-31T05:42:59Z
dc.date.available2024-07-31T05:42:59Z
dc.date.issued2024-06-20
dc.identifier.urihttps://hdl.handle.net/20.500.12818/1610
dc.description.abstractIn 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.statementofresponsibilityAboobacker P.en_US
dc.format.extent128p.en_US
dc.language.isoenen_US
dc.publisherResearch and Postgraduate Department of Mathematics St. Thomas College (Autonomous) Thrissuren_US
dc.subjectcryptographic algorithms,Boolean functionen_US
dc.titleAnalysis and synthesis of functions over the rings z q with noval cryptographic characteristicsen_US
dc.typeThesisen_US
dc.description.degreePh.Den_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record