The best known algorithm for modular exponentiation M**e . mod t for arbitrary M, e and t is of O(n**3) where n is the number of bits in the largest of M, e and t. This paper presents an O(n**2) algorithm for the prob...
详细信息
The best known algorithm for modular exponentiation M**e . mod t for arbitrary M, e and t is of O(n**3) where n is the number of bits in the largest of M, e and t. This paper presents an O(n**2) algorithm for the problem where M**e mod t is required for many values of M and e with constant t. Some preprocessing is done on t, and the results are applied repeatedly to different values of M and e. The main algorithm involves on-line arithmetic in a redundant number system. An immediate application is in encoding/decoding of messages in an RSA-based public-key cryptosystem.
For a suitable participation of the citizen in the digital economic era, it is crucial to have an efficient, inclusive and embracing citizen identification system (CIDS). However, there are still many people worldwide...
详细信息
ISBN:
(纸本)9798400707421
For a suitable participation of the citizen in the digital economic era, it is crucial to have an efficient, inclusive and embracing citizen identification system (CIDS). However, there are still many people worldwide without any legal identity. Strong action by governments and other stakeholders is therefore recommended to change this scenario. The Mozambican citizen identification system based on Information and Communications Technologies (ICT) is improving, for that reason, the purpose of this article is to describe the current situation, its problems and propose a model adjusted to the technological evolution, based on the fundamentals of Working Systems Theory (WST). Therefore, at the end of the article, we make recommendations focused on the rationalization of the identification system, aiming at proposing a Conceptual Model that maximizes the ICT potentials, interoperable and working system.
A technique is presented whereby a significant amount of program validation can be done simply by exercising the program components in a model environment provided by a finite state machine, specially built to charact...
详细信息
A technique is presented whereby a significant amount of program validation can be done simply by exercising the program components in a model environment provided by a finite state machine, specially built to characterise the real environment of that component. The tools necessary to support such a technique are characterised and the merits and demerits of the technique are discussed.
A subroutine is written to partially verify zip codes and validate the destination state. This machine language subroutine uses a table published by the Post Office to first verify that the two-character state abbrevi...
详细信息
A subroutine is written to partially verify zip codes and validate the destination state. This machine language subroutine uses a table published by the Post Office to first verify that the two-character state abbreviation is correct then check that the zip code is within the range for that state as set by the table. The source listing is well commented and documented. It was written as a dBASE II subroutine but can easily be adapted to any high-level language that can pass a string type memory variable to the called subroutine and modify that variable if required and pass it back to the calling program.
Generating interest in specialized areas of computer Science (CS) is one of the goals of the department of computer and Information Science at Spelman College as with most departments. Achieving this goal in a new, ex...
详细信息
ISBN:
(纸本)9781595939470
Generating interest in specialized areas of computer Science (CS) is one of the goals of the department of computer and Information Science at Spelman College as with most departments. Achieving this goal in a new, exciting, and innovative manner provided the inspiration to establish the Spelman College computer Science Olympiad (SC CS Olympiad). The SC CS Olympiad is patterned after the Olympics athletic event. Students participate in the Olympiad as a part of a team as with the Olympics. In addition, there are several events for competition as there are in the Olympics. The events are designed to expose students to the interesting breadth of CS over several days. In this paper, the events are in the following categories: Cryptography, Robotics, Website Design, Hardware and Software Integration, and programming. Teams use their CS knowledge and problem-solving skills to complete hands-on exercises in each area. Each teams receives points based on the quality of their results from the exercise. In this paper, we present the implementation, results, and future directions of the Spelman College computer Science Olympiad.
Parallel and direct computational algorithms are developed to evaluate linear recurrence systems with constant coefficients. All algorithms are aimed at easy data routings and simple machine control structures. Thus, ...
详细信息
Parallel and direct computational algorithms are developed to evaluate linear recurrence systems with constant coefficients. All algorithms are aimed at easy data routings and simple machine control structures. Thus, they can be easily implemented through software such as parallel compiler algorithms, numeric subroutines, or hardware control programs for future parallel or pipeline processors.
WAIT UNTIL is implemented as a source language extension to SIMULA 67. It could similarly be added to other languages, although the implementation might not be as elegant. Efforts are made to minimize the overhead res...
详细信息
WAIT UNTIL is implemented as a source language extension to SIMULA 67. It could similarly be added to other languages, although the implementation might not be as elegant. Efforts are made to minimize the overhead resulting from use of this feature. The WAIT UNTIL statement has been shown to be a powerful scheduling tool. It also leads to a natural description of many situations. This feature, present in older languages, is absent from the modern generation of general purpose simulation languages.
The precision pointing and tracking system combines a sampled data and a continuous system in an attempt to understand and to better appreciate some of the problems involved in such a system, a single plane hybrid sim...
详细信息
The precision pointing and tracking system combines a sampled data and a continuous system in an attempt to understand and to better appreciate some of the problems involved in such a system, a single plane hybrid simulation is generated. The purpose of the simulation is to lay the ground work for future and more complex sampled data/continuous systems. The simulation is instrumented on the APL hybrid computer consisting of an EAI 680 analog computer interfaced to an IBM 360/91 digital computer.
Concern for the poor reliability of software, schedule slippages, and inadequate documentation has prompted the development of the Integrated Software Development System (ISDS). The project began with an assessment of...
详细信息
Concern for the poor reliability of software, schedule slippages, and inadequate documentation has prompted the development of the Integrated Software Development System (ISDS). The project began with an assessment of the state-of-the-art tools and has evolved to a system for processing and analyzing software data during design, checkout and test. The progress made in developing the tools which comprise ISDS is discussed. Focusing on design aids, a tool was developed to interactively enter and edit design charts and generate quality hardcopy. Since ISDS design charts are machine-readable, automated analysis tools were then designed, including a standards auditor, test path determination, skeletal code generator, a data usage and definition tool, and a program complexity measure.
This paper proposes a practical framework for quantum programming. In our framework, the parts of a program to be performed on a quantum computer are almost automatically determined, and the other parts are performed ...
详细信息
This paper proposes a practical framework for quantum programming. In our framework, the parts of a program to be performed on a quantum computer are almost automatically determined, and the other parts are performed on a classical computer. We only consider Grover Search to be performed on a quantum computer in the framework because the other quantum algorithms known so far cannot be applied to general cases. By considering only Grover Search, we have several advantages that show our framework is really practical.
暂无评论