**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**17

# Search results for: cryptosystems

##### 17 Cryptographic Attack on Lucas Based Cryptosystems Using Chinese Remainder Theorem

**Authors:**
Tze Jin Wong,
Lee Feng Koo,
Pang Hung Yiu

**Abstract:**

_{4,6}) cryptosystem under the Lenstra’s attack as compared to the other two Lucas based cryptosystems such as LUC and LUC

_{3}cryptosystems. All the Lucas based cryptosystems were exposed mathematically to the Lenstra’s attack using Chinese Remainder Theorem and Dickson polynomial. Result shows that the possibility for successful Lenstra’s attack is less against LUC

_{4,6}cryptosystem than LUC

_{3}and LUC cryptosystems. Current study concludes that LUC

_{4,6}cryptosystem is more secure than LUC and LUC

_{3}cryptosystems in sustaining against Lenstra’s attack.

**Keywords:**
congruence,
Lucas sequence,
Dickson polynomial,
faulty signature,
corresponding signature

##### 16 An Approach to Secure Mobile Agent Communication in Multi-Agent Systems

**Authors:**
Olumide Simeon Ogunnusi,
Shukor Abd Razak,
Michael Kolade Adu

**Abstract:**

Inter-agent communication manager facilitates communication among mobile agents via message passing mechanism. Until now, all Foundation for Intelligent Physical Agents (FIPA) compliant agent systems are capable of exchanging messages following the standard format of sending and receiving messages. Previous works tend to secure messages to be exchanged among a community of collaborative agents commissioned to perform specific tasks using cryptosystems. However, the approach is characterized by computational complexity due to the encryption and decryption processes required at the two ends. The proposed approach to secure agent communication allows only agents that are created by the host agent server to communicate via the agent communication channel provided by the host agent platform. These agents are assumed to be harmless. Therefore, to secure communication of legitimate agents from intrusion by external agents, a 2-phase policy enforcement system was developed. The first phase constrains the external agent to run only on the network server while the second phase confines the activities of the external agent to its execution environment. To implement the proposed policy, a controller agent was charged with the task of screening any external agent entering the local area network and preventing it from migrating to the agent execution host where the legitimate agents are running. On arrival of the external agent at the host network server, an introspector agent was charged to monitor and restrain its activities. This approach secures legitimate agent communication from Man-in-the Middle and Replay attacks.

**Keywords:**
agent communication,
introspective agent,
isolation of agent,
policy enforcement system

##### 15 Efficient Semi-Systolic Finite Field Multiplier Using Redundant Basis

**Authors:**
Hyun-Ho Lee,
Kee-Won Kim

**Abstract:**

**Keywords:**
Cryptography,
systolic array,
Montgomery multiplication,
finite field

##### 14 Deterministic Random Number Generator Algorithm for Cryptosystem Keys

**Authors:**
Adi A. Maaita,
Hamza A. A. Al_Sewadi

**Abstract:**

**Keywords:**
Cryptosystems,
key distribution,
Random Numbers,
information security agreement

##### 13 Accelerating Side Channel Analysis with Distributed and Parallelized Processing

**Authors:**
Kyunghee Oh,
Dooho Choi

**Abstract:**

Although there is no theoretical weakness in a cryptographic algorithm, Side Channel Analysis can find out some secret data from the physical implementation of a cryptosystem. The analysis is based on extra information such as timing information, power consumption, electromagnetic leaks or even sound which can be exploited to break the system. Differential Power Analysis is one of the most popular analyses, as computing the statistical correlations of the secret keys and power consumptions. It is usually necessary to calculate huge data and takes a long time. It may take several weeks for some devices with countermeasures. We suggest and evaluate the methods to shorten the time to analyze cryptosystems. Our methods include distributed computing and parallelized processing.

**Keywords:**
Distributed Computing,
DPA,
parallelized processing

##### 12 Cryptography Over Elliptic Curve Of The Ring Fq[e], e4 = 0

**Authors:**
Chillali Abdelhakim

**Abstract:**

Groups where the discrete logarithm problem (DLP) is believed to be intractable have proved to be inestimable building blocks for cryptographic applications. They are at the heart of numerous protocols such as key agreements, public-key cryptosystems, digital signatures, identification schemes, publicly verifiable secret sharings, hash functions and bit commitments. The search for new groups with intractable DLP is therefore of great importance.The goal of this article is to study elliptic curves over the ring Fq[], with Fq a finite field of order q and with the relation n = 0, n ≥ 3. The motivation for this work came from the observation that several practical discrete logarithm-based cryptosystems, such as ElGamal, the Elliptic Curve Cryptosystems . In a first time, we describe these curves defined over a ring. Then, we study the algorithmic properties by proposing effective implementations for representing the elements and the group law. In anther article we study their cryptographic properties, an attack of the elliptic discrete logarithm problem, a new cryptosystem over these curves.

**Keywords:**
discrete logarithm problem,
Elliptic Curve Over Ring

##### 11 Securing Message in Wireless Sensor Network by using New Method of Code Conversions

**Authors:**
Ahmed Chalak Shakir,
GuXuemai,
Jia Min

**Abstract:**

**Keywords:**
Logic Gates,
gray-code,
code conversions,
and
clustering

##### 10 Novel Method for Elliptic Curve Multi-Scalar Multiplication

**Authors:**
Raveen R. Goundar,
Ken-ichi Shiota,
Masahiko Toyonaga

**Abstract:**

**Keywords:**
elliptic curve cryptosystems,
multi-scalar multiplication,
addition chains,
Fibonacci sequence

##### 9 An Efficient Architecture for Interleaved Modular Multiplication

**Authors:**
Ahmad M. Abdel Fattah,
Ayman M. Bahaa El-Din,
Hossam M.A. Fahmy

**Abstract:**

**Keywords:**
FPGA,
RSA,
modular multiplication,
Montgomery multiplication,
efficient architecture

##### 8 Efficient Large Numbers Karatsuba-Ofman Multiplier Designs for Embedded Systems

**Authors:**
M.Machhout,
M.Zeghid,
W.El hadj youssef,
B.Bouallegue,
A.Baganne,
R.Tourki

**Abstract:**

**Keywords:**
mathematical model,
finite field,
multiplication,
Karatsuba-Ofman,
long numbers,
recursivity

##### 7 New Analysis Methods on Strict Avalanche Criterion of S-Boxes

**Authors:**
Phyu Phyu Mar,
Khin Maung Latt

**Abstract:**

**Keywords:**
Function,
Cryptosystems,
analysis methods,
S-boxes,
strict avalanche criterion

##### 6 Modified Diffie-Hellman Protocol By Extend The Theory of The Congruence

**Authors:**
Rand Alfaris,
Mohamed Rushdan MD Said,
Mohamed Othman,
Fudziah Ismail

**Abstract:**

**Keywords:**
Extended theory of the congruence,
modified Diffie-
Hellman protocol

##### 5 Implementation and Analysis of Elliptic Curve Cryptosystems over Polynomial basis and ONB

**Authors:**
Yong-Je Choi,
Moo-Seop Kim,
Hang-Rok Lee,
Ho-Won Kim

**Abstract:**

**Keywords:**
Security,
polynomial basis,
Elliptic Curve Cryptosystem,
Crypto Algorithm,
Optimal Normal Basis

##### 4 Implementation of RC5 Block Cipher Algorithm for Image Cryptosystems

**Authors:**
Hossam El-din H. Ahmed,
Hamdy M. Kalash,
Osama S. Farag Allah

**Abstract:**

This paper examines the implementation of RC5 block cipher for digital images along with its detailed security analysis. A complete specification for the method of application of the RC5 block cipher to digital images is given. The security analysis of RC5 block cipher for digital images against entropy attack, bruteforce, statistical, and differential attacks is explored from strict cryptographic viewpoint. Experiments and results verify and prove that RC5 block cipher is highly secure for real-time image encryption from cryptographic viewpoint. Thorough experimental tests are carried out with detailed analysis, demonstrating the high security of RC5 block cipher algorithm.

**Keywords:**
security analysis,
Image Encryption

##### 3 A Cheating Model for Cellular Automata-Based Secret Sharing Schemes

**Authors:**
Borna Jafarpour,
Azadeh Nematzadeh,
Vahid Kazempour,
Babak Sadeghian

**Abstract:**

Cellular automata have been used for design of cryptosystems. Recently some secret sharing schemes based on linear memory cellular automata have been introduced which are used for both text and image. In this paper, we illustrate that these secret sharing schemes are vulnerable to dishonest participants- collusion. We propose a cheating model for the secret sharing schemes based on linear memory cellular automata. For this purpose we present a novel uniform model for representation of all secret sharing schemes based on cellular automata. Participants can cheat by means of sending bogus shares or bogus transition rules. Cheaters can cooperate to corrupt a shared secret and compute a cheating value added to it. Honest participants are not aware of cheating and suppose the incorrect secret as the valid one. We prove that cheaters can recover valid secret by removing the cheating value form the corrupted secret. We provide methods of calculating the cheating value.

**Keywords:**
Secret sharing,
cellular automata,
cheating model,
threshold scheme

##### 2 Finding More Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems

**Authors:**
Pu Duan,
Shi Cui,
Choong Wah Chan

**Abstract:**

**Keywords:**
Family of group order,
kth root of unity,
non-supersingular elliptic curves polynomial field

##### 1 Key Exchange Protocol over Insecure Channel

**Authors:**
Alaa Fahmy

**Abstract:**

**Keywords:**