Main Page
About FCIT
History
Strategy
Administration>
Current Administration
Prevouis Administration
Organization Strucutre
Industrial Advisory Board
PhotoAlbum
Lab Guides
Departments
Computer Science
Information Technology
Information Systems
Academics
Bachelor Programs
Graduate Programs
Executive Programs
Academic Calendar
Admission
Bachelor Degree & Transferring
Admission from the Foundation Year
Transferring to the Faculty
Graduate Studies
Graduate Programs
Executive Programs
Scientific Research
Groups and Units
Research Groups
Research Interests
Distinguished Scientists Program
Faculty Journal
Faculty and Staff
Faculty
CS Department
IT Department
IS Department
Staff
Accreditation Integration & Management System (AIM
Development and Quality Unit
Work at FCIT
Capabilities Under the Spotlight
Code of Ethics
Students
Bachelor
ِAcademic Services
Preparatory Year Courses
Students' Guide
Academic Advising
Laboratories and Facilities
Student rights and duties
Graduate
Polices and Regulations
Students' Guide
Student's Handbook
New Student Orientation
Templates of proposals and theses for masters and
Courses
CS Program
IT Program
IS Program
Alumni Registration
Students Activities
Entrepreneurship Club
Cybersecurity Club
Data Science Club
Programming Club
Community
Industrial partnerships
Cisco Academy
Microsoft Academy
Oracle Academy
Files
Researches
Contact Us
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Faculty of Computing and Information Technology
Document Details
Document Type
:
Article In Conference
Document Title
:
TWO EFFICIENT RSA DIGITAL MULTISIGNATURE AND BLIND MULTISIGNATURE SCHEMES
ظامان فعالان لخوارزمية التشفير RSA متعددا التواقيع الرقمية والتواقيع العمياء
Subject
:
Data encryption Algorithms
Document Language
:
Arabic
Abstract
:
In this paper we examine the techniques of adjusting the RSA algorithm to allow multisignatures being simply applied by many users. The proposed algorithms will be suitable for employ in organizations. However, general uses might be the signing of cheques for electronic funds transfer where two or more organization representatives are needed to sign the cheque. The algorithms suggested in this paper are not restricted to RSA scheme. It means that every encryption algorithm e with the multiplicative ability e(k1) * e(k2) = e(k1 * k2) will work. For concreteness, however, we will employ RSA widely in this paper.
Conference Name
:
The Fourth IASTED International Conference COMPUTATIONAL INTELLIGENCE
Publishing Year
:
1427 AH
2005 AD
Article Type
:
Article
Conference Place
:
Canada
Added Date
:
Monday, May 16, 2011
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
ستار عبود
Aboud, Sattar
Researcher
Doctorate
محمد أحمد الفيومي
Al-Fayoumi, Mohammad Ahmed
Researcher
Doctorate
M_Fayoumi99@yahoo.com
Files
File Name
Type
Description
29770.docx
docx
Back To Researches Page