SIGNCRYPTION ANALYZE

The aim of this paper is to provide an overview for the research that has been done so far in signcryption area. The paper also presents the extensions for the signcryption scheme and discusses the security in signcryption. The main contribution to this paper represents the implementation of the signcryption algorithm with the examples provided.ElGamal, elliptic curves, encryption, identity-based, proxy-signcryption, public key, ring-signcryption, RSA, signcryption

A new digital signature scheme with message recovery using hybrid problems

We present a new digital signature scheme with message recovery and its authenticated encryption based on elliptic curve discrete logarithm and quadratic residue. The main idea is to provide a higher level of security than all other techniques that use signatures with single hard problem including factoring, discrete logarithm, residuosity, or elliptic curves. The proposed digital signature schemes do not involve any modular exponentiation operations that leave no gap for attackers. The security analysis demonstrates the improved performance of the proposed schemes in comparison with existing techniques in terms of the ability to resist the most common attack

A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters in WSN

The Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data’s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it’s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table

Study on elliptic curve public key cryptosystems with application of pseudorandom number generator.

by Yuen Ching Wah.Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.Includes bibliographical references (leaves 61-[63]).Abstract also in Chinese.Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Why use cryptography? --- p.1Chapter 1.2 --- Why is authentication important ？ --- p.2Chapter 1.3 --- What is the relationship between authentication and digital sig- nature? --- p.3Chapter 1.4 --- Why is random number important? --- p.3Chapter 2 --- Background --- p.5Chapter 2.1 --- Cryptography --- p.5Chapter 2.1.1 --- Symmetric key cryptography --- p.5Chapter 2.1.2 --- Asymmetric key cryptography --- p.7Chapter 2.1.3 --- Authentication --- p.8Chapter 2.2 --- Elliptic curve cryptography --- p.9Chapter 2.2.1 --- Mathematical background for Elliptic curve cryptography --- p.10Chapter 2.3 --- Pseudorandom number generator --- p.12Chapter 2.3.1 --- Linear Congruential Generator --- p.13Chapter 2.3.2 --- Inversive Congruential Generator --- p.13Chapter 2.3.3 --- PN-sequence generator --- p.14Chapter 2.4 --- Digital Signature Scheme --- p.14Chapter 2.5 --- Babai's lattice vector algorithm --- p.16Chapter 2.5.1 --- First Algorithm: Rounding Off --- p.17Chapter 2.5.2 --- Second Algorithm: Nearest Plane --- p.17Chapter 3 --- Several Digital Signature Schemes --- p.18Chapter 3.1 --- DSA --- p.19Chapter 3.2 --- Nyberg-Rueppel Digital Signature --- p.21Chapter 3.3 --- EC.DSA --- p.23Chapter 3.4 --- EC-Nyberg-Rueppel Digital Signature Scheme --- p.26Chapter 4 --- Miscellaneous Digital Signature Schemes and their PRNG --- p.29Chapter 4.1 --- DSA with LCG --- p.30Chapter 4.2 --- DSA with PN-sequence --- p.33Chapter 4.2.1 --- Solution --- p.35Chapter 4.3 --- DSA with ICG --- p.39Chapter 4.3.1 --- Solution --- p.40Chapter 4.4 --- EC_DSA with PN-sequence --- p.43Chapter 4.4.1 --- Solution --- p.44Chapter 4.5 --- EC一DSA with LCG --- p.45Chapter 4.5.1 --- Solution --- p.46Chapter 4.6 --- EC-DSA with ICG --- p.46Chapter 4.6.1 --- Solution --- p.47Chapter 4.7 --- Nyberg-Rueppel Digital Signature with PN-sequence --- p.48Chapter 4.7.1 --- Solution --- p.49Chapter 4.8 --- Nyberg-Rueppel Digital Signature with LCG --- p.50Chapter 4.8.1 --- Solution --- p.50Chapter 4.9 --- Nyberg-Rueppel Digital Signature with ICG --- p.51Chapter 4.9.1 --- Solution --- p.52Chapter 4.10 --- EC- Nyberg-Rueppel Digital Signature with LCG --- p.53Chapter 4.10.1 --- Solution --- p.54Chapter 4.11 --- EC- Nyberg-Rueppel Digital Signature with PN-sequence --- p.55Chapter 4.11.1 --- Solution --- p.56Chapter 4.12 --- EC-Nyberg-Rueppel Digital Signature with ICG --- p.56Chapter 4.12.1 --- Solution --- p.57Chapter 5 --- Conclusion --- p.59Bibliography --- p.6

Практические схемы реализации алгоритмов электронной цифровой подписи

Проведено порівняльний аналіз асиметричних схем формування ЕЦП, які засновані на проблемі дискретного логарифмування над скінченним полем та еліптичними кривими. На основі проведеного аналізу складена порівняльна таблиця оцінки ефективності використання даних алгоритмів. Описані основні стандарти, такі як DSA, ElGamal, ECDSA, ГОСТ Р 34.10-2001, що базуються на складності вирішення задачі дискретного логарифмування у скінченному полі. Також детально розглянуто криптографічні алгоритми з можливістю відновлення повідомлення при проведенні процедури верифікації цифрового підпису. Аналіз дозволив сформувати переваги і недоліки даних алгоритмів та виділити ефективний алгоритм цифрового підпису на дискретному логарифмі з властивістю відновлення повідомлення.The article provides a comparative analysis of the formation of the asymmetric digital signature schemes based on the discrete logarithm problem over finite fields and elliptic curves. Based on the analysis compiled a comparative table of assessing the efficiency of these algorithms. This paper describes the basic standards, such as DSA, ElGamal, ECDSA, GOST R 34.10-2001, based on the complexity of solving the discrete logarithm problem in a finite field. Also discussed in detail the cryptographic algorithms with the ability to recover the message during the procedure of verification of the digital signature. This analysis helped to formulate the advantages and disadvantages of these algorithms, and an efficient algorithm to allocate the digital signature of the discrete logarithm with property recovery messages.Проведен сравнительный анализ асимметричных схем формирования ЭЦП, основанных на проблеме дискретного логарифмирования над конечным полем и эллиптическими кривыми. На основе проведенного анализа составлена сравнительная таблица оценки эффективности использования данных алгоритмов. Описаны базовые стандарты, такие как DSA, ElGamal, ECDSA, ГОСТ Р 34.10-2001, основанные на сложности решения задачи дискретного логарифмирования в конечном поле. Также подробно рассмотрены криптографические алгоритмы с возможностью восстановления сообщения при проведении процедуры верификации цифровой подписи. Данный анализ позволил сформировать преимущества и недостатки данных алгоритмов и выделить эффективный алгоритм цифровой подписи на базе дискретного логарифма со свойством восстановления сообщения

Practical implementation and performance analysis on security of sensor networks

A wireless sensor network (WSN) is a network made of thousands of sensing elements called as nodes with wireless capabilities. Their application is varied and diverse ranging from military to domestic and household. As the world of self-organizing sensor networks tip to the edge of maximum utilization, their wider deployment is adding pressure on the security front. Powerful laptops and workstations make it more challenging for small sensors. In addition, there are many security challenges in WSN, e.g- confidentiality, authentication, freshness, integrity etc. Contributions of this work are as follows: “Symmetric” security implementation: This thesis work designs a symmetric-key based security in sensor hardware in the Link layer of sensor network protocols. Link Layer security can protect a wireless network by denying access to the network itself before a user is successfully authenticated. This prevents attacks against the network infrastructure and protects the network from devastating attacks. “Public key” implementation in sensor hardware: Asymmetric key techniques are attractive for authentication data or session keys. Traditional schemes like RSA require considerable amounts of resources which in the past has limited their use. This thesis has implemented Elliptic Curve Cryptography (ECC) in Mica2 hardware, which is an approach to public-key cryptography based on the mathematics of elliptic curves. Quantitative overhead analysis: This thesis work analyzes the wireless communication overhead (No. of packets transmitted) vs the (transmit and receive) energy consumed in mJoules and memory storage overhead (bytes) for ECC as compared to the symmetric counterpart for the implemented WSN security protocols

Recovering cryptographic keys from partial information, by example

Side-channel attacks targeting cryptography may leak only partial or indirect information about the secret keys. There are a variety of techniques in the literature for recovering secret keys from partial information. In this tutorial, we survey several of the main families of partial key recovery algorithms for RSA, (EC)DSA, and (elliptic curve) Diffie-Hellman, the public-key cryptosystems in common use today. We categorize the known techniques by the structure of the information that is learned by the attacker, and give simplified examples for each technique to illustrate the underlying ideas