On some digital signature schemes based on factoring and discrete logarithm

Date of Publication

2016

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics with specialization in Business Applications

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

Due to the constant development of technology, Whitfield Diffie and Martin Hellman [3] started the concept of digital signatures which enables the sender and recipient to put signatures on electronic documents. The problem with digital signatures is that it is still prone to attacks that are based on mathematical principles. These lead to certain forgeries when an adversary computes the signer's private key allowing generation of fake signatures in any message. This paper tackles some digital schemes that are included in the papers of Verma and Sharma [18] tackling the merits of the schemes of He and Keisler [8] and Shimin Wei [19], which are based on the difficulty of solving factoring and discrete logarithm problems. With this, the authors made a modification on one of the parameters of Verma and Sharma's scheme after checking and studying the schemes of the other papers [8, 19] as well as studying the mathematical concepts of digital signatures.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU021090

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Physical Description

1 computer disc ; 4 3/4 in.

Keywords

Logarithms; Digital signatures; Data encryption (Computer science); Authentication; Factorization (Mathematics)

Embargo Period

5-12-2021

This document is currently not available here.

Share

COinS