On applications of singular matrices over finite fields in cryptography

Authors:
Dhirendra Singh Yadav;Rajendra K. Sharma;Wagish Shukla
Affiliations:
Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India;Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India;Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India
Venue:
InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
Year:
2011

Citing 5
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Finite fields

Finite fields
Algebraic aspects of cryptography

Algebraic aspects of cryptography
The Design of Rijndael

The Design of Rijndael
Finite Fields: Theory and Computation The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography

Finite Fields: Theory and Computation The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main goal of this paper is to exhibit the use of singular matrices over finite fields in cryptography. Using these matrices, we propose a key exchange method in which two users over an insecure channel want to agree upon a secret key to be used in some private key cryptosystem.