The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

Past studies suggest that computer security countermeasures such as security policies, systems, and awareness programs would be effective in preventing computer abuse in organizations. They are based on the general deterrence theory, which posits that when an organization implements countermeasures that threaten abusers, its computer abuse problems would be deterred. However, computer abuse problems persist in many organizations despite these measures. This article proposes a new model of computer abuse that extends the traditional model with the social criminology theories. Focusing on computer abuse within organizations, the model explains the phenomenon through social lenses such as social bonds and social learning. The new model contributes to our theoretical body of knowledge on computer abuse by providing a new angle for approaching the problem. It suggests to practitioners that both technical and social solutions should be implemented to reduce the pervasive computer abuse problems.

A holistic model of computer abuse within organizations

Для числа ε > 0 и вещественной функции f на отрезке [a, b] обозначим через N(ε, f, [a, b]) супремум множества тех номеров n, для которых в [a, b] существует набор неналегающих отрезков [ai, bi], i = 1, . . . , n, таких, что |f(ai)− f(bi)| > ε для всех i = 1, . . . , n (sup ∅ = 0). Доказана следующая теорема: если {fj} – поточечно ограниченная последовательность вещественных функций на отрезке [a, b] такая, что n(ε) ≡ lim supj→∞N(ε, fj , [a, b]) < ∞ для любого ε > 0, то {fj} содержит подпоследовательность, которая всюду на [a, b] сходится к некоторой функции f такой, что N(ε, f, [a, b]) 6 n(ε) при любом ε > 0. Показано, что основное условие в этой теореме, связанное с верхним пределом, необходимо для равномерно сходящейся последовательности {fj} и “почти” необходимо для всюду сходящейся последовательности измеримых функций и что многие поточечные принципы выбора, обобщающие классическую теорему Хелли, вытекают из этой теоремы, а также приводятся примеры, иллюстрирующие ее точность. Библиография: 16 названий.

Место и роль инновационных технологий на уроках математики

Purpose – Recent disaster recovery planning (DRP) literature has mainly focused on qualitative research, while neglecting the quantification of critical success factors (CSFs) for information systems function (ISF). This paper aims to address this issue.Design/methodology/approach – This paper first conducts an extensive literature review, and then identifies 62 DRP measurement items for ISF. A questionnaire survey, which is based on these 62 measurement items, is used for data collection, and 129 managers of DRP in ISF participate in this paper.Findings – Through the use of convergent factoring analysis, this paper identifies ten DRP CSFs for ISF, they are: DRP documentations, DRP steering committee and DRP testing, DRP policy and goals, DRP training, DRP maintenance and staff involvement, DRP minimum IS processing requirements, top management commitment to DRP, prioritization IS functions/services, external, off‐site back‐up system, and internal, and on‐site back‐up system.Originality/value – This paper...

Determinants of the critical success factor of disaster recovery planning for information systems

Nowadays, for information systems at organizational and interorganizational levels, information sharing is essential for business operations and strategic decision-making. As a mixed blessing, however, the information sharing process also exposes information systems to more severe virus attacks. In light of this, research efforts on virus propagation and virus control have drawn increasing interests in both the academic and industrial domains. This paper thus presents a virus propagation model, namely E-SEIR, to gain insights of virus propagation in networks with Point-to-Group (P2G) information sharing patterns. Unlike most existing virus propagation models, E-SEIR has three important characteristics. First, an additional exposed state is integrated into the model to describe the latent period of computer viruses. Second, a P2G infection function is introduced to the model to characterize the real-world networks, which consist of many information-sharing sub-networks. Third, E-SEIR takes various antivirus countermeasures into consideration, which provides unique opportunities for studying the behaviors of virus propagation with the presence of antivirus activities. Based on this E-SEIR model, we have studied the possibility of short-term virus outbreaks and long-term network survivability, and the results revealed some key managerial insights that are helpful for the practice of virus propagation control in information sharing networks.

Jr. Bernard P. Zajac

Papers

Book review: Applied cryptography: Protocols, algorithms, and source code in C

Legal options to computer viruses

Technical evaluation: Dial-up communication lines: Can they be secured?

Special feature: Personnel: The other half of data security

Computer viruses: Can they be prevented?