scholarly journals DIGITAL SIGNATURE :BEST PRACTICE SOLUTION FOR THE DISTRIBUTION OF LETTERS IN COLLEGE

CCIT Journal ◽  
2013 ◽  
Vol 6 (3) ◽  
pp. 265-286
Author(s):  
Untung Rahardja ◽  
Muhamad Yusup ◽  
Ari Asmawati

Purpose of implementation ofweb-based information systems that allow user stoaccess information anywhere and anytime. Especiallyin making letters out stillusea wet signature. So that has not been able to provide information quickly and accurately. Identified there are7 (seven) point concerns the handling and processing of the paperstoday. However, the problem can besolved by building a Digital Signature Designand is online, so it can reduce the error rate and the information obtainedis really precise, accurate and in accordance with the needs. Obviously with the directional flow methodology description, ranging from th eillustration Figure Digital Signature, Flow distribution sub part Digital Signature, Digital Signature Flowchart, cycle and Digital Signature Digital Signature Use Case. From the Literature Review,has been much research on the Digital Signature Algorithm and Digital Signature Scheme. In the implementation phaseof the prototype described in detail the design of Digital Signature, the program listings are shown to display a letter that has been approved and has been signed. It can be also generatedauthentication system called digital signature is a waytoen sure the authenticity of an electronic document and keep documents in a time sender can not deny that she has sent the document.

2018 ◽  
Vol 5 (6) ◽  
pp. 180410 ◽  
Author(s):  
I. Stewart ◽  
D. Ilie ◽  
A. Zamyatin ◽  
S. Werner ◽  
M. F. Torshizi ◽  
...  

Quantum computers are expected to have a dramatic impact on numerous fields due to their anticipated ability to solve classes of mathematical problems much more efficiently than their classical counterparts. This particularly applies to domains involving integer factorization and discrete logarithms, such as public key cryptography. In this paper, we consider the threats a quantum-capable adversary could impose on Bitcoin, which currently uses the Elliptic Curve Digital Signature Algorithm (ECDSA) to sign transactions. We then propose a simple but slow commit–delay–reveal protocol, which allows users to securely move their funds from old (non-quantum-resistant) outputs to those adhering to a quantum-resistant digital signature scheme. The transition protocol functions even if ECDSA has already been compromised. While our scheme requires modifications to the Bitcoin protocol, these can be implemented as a soft fork.


Author(s):  
Dhanashree Toradmalle ◽  
Jayabhaskar Muthukuru ◽  
B Sathyanarayana

With the internet today available at the user’s beck, and call data or Information Security plays a vital role. Confidentiality, Integrity, Availability, and Non-repudiation are the pillars of security on which every application on the web is based on. With these basic requirements the users also need the security in low resource constrained environments making it more challenging for the security experts to design secured cryptographic algorithms. Digital Signatures play a pivotal role in Authentication. They help in verifying the integrity of the data being exchanged. Elliptical curves are the strongest contenders in Digital Signatures, and much research is being done to enhance the method in many ways. The paper briefs a secured and improved ECDSA Elliptical Curve Digital Signature Algorithm which is an improved and secured version of the Digital Signature Algorithm.


1997 ◽  
Vol 33 (22) ◽  
pp. 1861 ◽  
Author(s):  
Wei-Hua He ◽  
Tzong-Chen Wu

Author(s):  
Nikolay A. Moldovyan ◽  
◽  
Alexandr A. Moldovyan ◽  

The article considers the structure of the 2x2 matrix algebra set over a ground finite field GF(p). It is shown that this algebra contains three types of commutative subalgebras of order p2, which differ in the value of the order of their multiplicative group. Formulas describing the number of subalgebras of every type are derived. A new post-quantum digital signature scheme is introduced based on a novel form of the hidden discrete logarithm problem. The scheme is characterized in using scalar multiplication as an additional operation masking the hidden cyclic group in which the basic exponentiation operation is performed when generating the public key. The advantage of the developed signature scheme is the comparatively high performance of the signature generation and verification algorithms as well as the possibility to implement a blind signature protocol on its base.


Sign in / Sign up

Export Citation Format

Share Document