Search

The new stream encryption algorithm (NSA-New Stream Algorithm) is proposed in this work. The input parameters are considered a 128-bit secret key and 128-bit initialization vectors in the new algorithm. A 64-bit line is generated in each round as the output value. The architecture of the algorithm is particularly suitable for efficient hardware implementations, together with this, this algorithm is also suitable for software implementation. On the other hand, the security was evaluated for resynchronization attack, related key attack, and attack methods on the basis of linear correlation of the output sequence. Analysis confirms that this algorithm is a secure stream encryption algorithm., {"references":["1.\tJ. Daemen, \"Cipher and hash function design strategies based on linear and differential cryptanalysis,\" Doctoral Dissertation, March 1995, K. U. Leuven","2.\tJ. Daemen, R. Govaerts, J. Vandewalle, \"Resynchronization weaknesses in synchronous stream ciphers,\" Advances in Cryptology, Proceedings Eurocrypt'93, Springer-Verlag, LNCS 765, pp. 159-169, 1994.","3.\tJ. Daemen, L. Knudsen, V. Rijmen, \"The BlockCipher Square,\" Fast Software Encryption, Springer-Verlag, LNCS 1267, pp. 149–165, 1997.","4.\tE. Biham, A. Shamir, \"Differential Cryptanalysis of the Data Encryption Standard,\" Springer-Verlag, 1993","5.\tM. Matsui, \"Linear cryptanalysis method for DES cipher,\" Advances in Cryptology, Eurocrypt'93, Springer-Verlag, LNCS 765, pp. 159–169, 1994.","6.\tJ. Daemen, R. Govaerts, J. Vandewalle, \"Resynchronization weaknesses in synchronous stream ciphers,\" Advances in Cryptology, Proceedings Eurocrypt'93, Springer-Verlag, LNCS 765, pp. 159-169, 1994.","7.\tS. Fluhrer, M. Shamir, \"Weaknesses in the Key Scheduling Algorithm of RC4,\" Selected in Areas in Cryptography, SAC 2001, Springer-Verlag, LNCS 2259, pp. 1– 24, 2001.","8.\tA. Clark, J. Golic, W. Millan, L. Penna, L. Simpson, \"The LILI-128 Keystream Generator,\" NESSIE project submission, 2000, available at http://www.cryptonessie.org","9.\tS. Fluhrer, \"Cryptanalysis of the SEAL 3.0 Pseudorandom Function Family,\" Fast Software Encryption, FSE 2001, Proceedings, pp. 142–151, 2001.","10.\tT. Jacobsen and L. R. Knudsen, \"The Interpolation AttackonBlockCiphers,\" Fast Software Encryption, FSE'97, Springer-Verlag, LNCS 1267, pp. 28–40, 1997."]}

In paper highlights of hash functions differential cryptanalysis on an example of algorithm SHA-1 are considered. The technique of carrying out of the differential analysis of SHA-1 hash function and other hash functions having a similar structure is offered.

In this paper, we examine algebraic attacks on the O'zDSt 1105:2009. We begin with a brief review of the meaning of algebraic cryptanalysis, followed by an algebraic cryptanalysis of O'zDSt 1105:2009. Primarily O'zDSt 1105:2009 encryption algorithm is decomposed and each transformation in it is algebraic described separately. Then input and output of each transformation are expressed with other transformation, encryption key, plaintext and cipher text. Created equations, unknowns on it and degree of unknowns are analyzed, and then overall result is given. Based on experimental results, it is impossible to save all system of equations that describes all transformations in O'zDSt 1105:2009 standard. Because, this task requires 273 bytes for the second round. For this reason, it is advisable to evaluate the parameters of the system of algebraic equations, representing the O'zDSt 1105:2009 standard, theoretically.

Something you know based authentication method is the most classical authentication technique on the computer system, and is performed more easily and successfully than other methods even it is a vulnerable method against attacks such as eavesdropping or replay attack. To solve this problem, OTP (Onetime Password) technique is used. OTP is delivered from one side to the other in two approaches. In the first approach, OTP is generated on server side and sent to clients, for example, by SMS. In the second approach, OTP is generated on both sides at one time based on shared counter, such as, HOTP. In most cases, one-way hash functions are used in both approaches to generate OTP. As resent researches show the weakness of the hash functions, we need new a new OTP generation algorithms to solve this problem. In this paper, we propose a method of creating one time password based on pseudorandom number generators (PRNG), which they are exist on many systems and programming languages as native.

This paper investigates the algebraic properties of reflections used in the standard encryption algorithm O’zDSt 1105: 2009.

Nowadays, Wireless Sensor Networks are being used in area monitoring, health care monitoring, environmental/earth sensing, industrial monitoring and therefore security of these networks is becoming a central concern. Wireless Sensor Networks consists of low power, low-cost smart devices that have limited computing resources against current devices, like personal computer. This paper discusses overall constraints, security requirements, security threats, typical attacks and their defensive techniques or countermeasures relevant to the sensor networks. Besides that, best practical suggestions are given to improve current security mechanisms on Wireless Sensor Network.

Random numbers are critical in every cryptographic fields. They can be used as cryptographic key, seed, nonce, initialization vector, etc. In this paper, new (pseudo) random number generator (PRNG or RNG) based on computer's source is proposed. The principle of method consist in collecting (nearly) random sources produced from computer and used it as seed for (pseudo) random number generation. Random number generator produces 128, 256-bit keys for symmetric ciphers and various length prime numbers. Random numbers are used as seed or initialization vector for pseudorandom number generator and it generates arbitrary keys. Generated (pseudo) random numbers are tested by NIST Statistical test suite.

Key management, particularly, key generation is one of the important processes in information security. Key generation techniques are variously and selecting one of them or creating new key generation include which types of requirements are also difficult. This paper addresses factors to compare key generation techniques and these factors are used as requirements for key generators.