Secure Pseudo-random Number Generator Research Articles

Anti-continuous collisions user-based unpredictable iterative password salted hash encryption

Recently, providing services remotely over a network to enhance functionality and usability has become a trend. Applications regularly contain sensitive and personal information that should be managed and controlled by authorised persons. Thus, keeping the password security is important to prevent unauthorised users from impersonating other legal users. Hashing the password is one of the safety methods and means of preventing attacks. In this study, we proposed an iterative salted hash encryption mechanism named anti-continuous collision salted hash encryption (ACCSHE) that uses cryptographically secure pseudo random number generator (CSPRNG) and hashed with password data by secured hashing algorithm (SHA-256). The outcome manifests a flexibility of changing the results by controlling several key features, such as salt used, the range of the hashing process iterations or the minimum number of iterations without affecting the system's usability. The system efficiently prevented continues collision issue and effective processing time cost for an attacker.

Hybrid Approach for PRNGs using BBS and Dithering Technique

Objectives: The cryptographically secure pseudo-random number generator Blum Blum-Shub (BBS) is a simple algorithm with a strong security proof, all of number generators that produced by BBS will be converted to (0, 1) using simplest form called Parity (even parity bit and odd parity bit).This approach proposed new method for extending bit space acquired from BBS based on dither matrix instead of (Parity) feature with saving of strength and security of crypto-key. Methods/Statistical Analysis: We used dithering techniques (2*2, 4*44) that provide continuous image of higher colors on a display of less color depth, for improving numbers that generated by BBS. And used some of statistical tests for measuring crypto-key strength such (run, poker, serial and frequency tests).The proposal algorithm has been programmed using c#.net 2013 Findings: This approach provides high extended on number space that generated from BBS by using Dithering techniques (2*2, 4*4), with saving of crypto-key randomness and guarantee passing of statistical tests, dithering techniques (8*8) is unsuitable for this purpose. Although, it provides height extension but decrease the randomness of key numbers. Application/Improvements: This approach proposed to replace (Parity) property with dithering techniques. It’s replaces max of gray level in dithering such (256) in 8 bit image with value of n , (p*q) in BBS , this may convert the domain of any number sets to dithering domain to be suitable for purpose. Keywords: Blum-Blum-Shub, Cryptography, Cryptography Key, Dithering, Pseudo Random Number generation (PRNGs)

A Nonvolatile Flip-Flop-Enabled Cryptographic Wireless Authentication Tag With Per-Query Key Update and Power-Glitch Attack Countermeasures

Counterfeiting is a major issue plaguing global supply chains. In order to mitigate this problem, a wireless authentication tag is presented that implements a cryptographically secure pseudorandom number generator and authenticated encryption modes. The tag uses Keccak, the cryptographic core of SHA3, to update keys before each protocol invocation, limiting side-channel leakage. Power-glitch attacks are mitigated through state backup on ferroelectric capacitor-based nonvolatile flip-flops with a fully integrated energy backup storage, which needs a 2.2 $\times $ smaller area compared with conventional approaches. The 130 nm CMOS tag harvests wireless power through a 433 MHz inductive link and communicates with a reader by a pulse-based modulation that minimizes the wireless power dead time. The proposed regulating voltage multiplier simultaneously rectifies, boosts, and regulates a >0.55 V ac input to a 1.5 V supply voltage with <1.1% line and load regulation while requiring only one on-chip decoupling capacitor. The bidirectional data telemetry operates at 125 kb/s, while requiring 4% (downlink) and 6.25% (uplink) duty cycles. Full system operation including the tag, reader, and server protocol is demonstrated in the presence of worst-case power interruption events.

Design and Implementation of Warbler Family of Lightweight Pseudorandom Number Generators for Smart Devices

With the advent of ubiquitous computing and the Internet of Things (IoT), the security and privacy issues for various smart devices such as radio-frequency identification (RFID) tags and wireless sensor nodes are receiving increased attention from academia and industry. A number of lightweight cryptographic primitives have been proposed to provide security services for resource-constrained smart devices. As one of the core primitives, a cryptographically secure pseudorandom number generator (PRNG) plays an important role for lightweight embedded applications. The most existing PRNGs proposed for smart devices employ true random number generators as a component, which generally incur significant power consumption and gate count in hardware. In this article, we present Warbler family, a new pseudorandom number generator family based on nonlinear feedback shift registers (NLFSRs) with desirable randomness properties. The design of the Warbler family is based on the combination of modified de Bruijn blocks together with a nonlinear feedback Welch-Gong (WG) sequence generator, which enables us to precisely characterize the randomness properties and to flexibly adjust the security level of the resulting PRNG. Some criteria for selecting parameters of the Warbler family are proposed to offer the maximum level of security. Two instances of the Warbler family are also described, which feature two different security levels and are dedicated to EPC C1 Gen2 RFID tags and wireless sensor nodes, respectively. The security analysis shows that the proposed instances not only can pass the cryptographic statistical tests recommended by the EPC C1 Gen2 standard and NIST but also are resistant to the cryptanalytic attacks such as algebraic attacks, cube attacks, time-memory-data tradeoff attacks, Mihaljević et al.’s attacks, and weak internal state and fault injection attacks. Our ASIC implementations using a 65nm CMOS process demonstrate that the proposed two lightweight instances of the Warbler family can achieve good performance in terms of speed and area and provide ideal solutions for securing low-cost smart devices.

난수생성기를 이용한 멀티채널 보안카드 설계

난수생성기를 이용한 멀티채널 보안카드 설계

A Practical, Secure, and Verifiable Cloud Computing for Mobile Systems

Cloud computing systems, in which clients rent and share computing resources of third party platforms, have gained widespread use in recent years. Furthermore, cloud computing for mobile systems (i.e., systems in which the clients are mobile devices) have too been receiving considerable attention in technical literature. We propose a new method of delegating computations of resource-constrained mobile clients, in which multiple servers interact to construct an encrypted program known as garbled circuit. Next, using garbled inputs from a mobile client, another server executes this garbled circuit and returns the resulting garbled outputs. Our system assures privacy of the mobile client's data, even if the executing server chooses to collude with all but one of the other servers. We adapt the garbled circuit design of Beaver et al. and the secure multiparty computation protocol of Goldreich et al. for the purpose of building a secure cloud computing for mobile systems. Our method incorporates the novel use of the cryptographically secure pseudo random number generator of Blum et al. that enables the mobile client to efficiently retrieve the result of the computation, as well as to verify that the evaluator actually performed the computation. We analyze the server-side and client-side complexity of our system. Using real-world data, we evaluate our system for a privacy preserving search application that locates the nearest bank/ATM from the mobile client. We also measure the time taken to construct and evaluate the garbled circuit for varying number of servers, demonstrating the feasibility of our secure and verifiable cloud computing for mobile systems.

Analysis for Memory Reduction of the UOV Scheme with the Application of PRNG

 Abstract—In case we use a quantum computer, we have to construct the countermeasure. Due to the high efficiency and fast computation time, the multivariate quadratic public key systems are considered as an alternative to RSA or ECC based systems. However, the large key size is a fatal disadvantage of the multivariate quadratic public key systems. For this reason, the multivariate quadratic public key systems are not widely used. In this paper, we measure how much the private key memory size can be reduced by using a secure pseudo-random number generator in the UOV scheme. Almost 93% of the private key memory size is reduced.

A Novel Pseudo Random Number Generator Based on Two Plasmonic Maps

In plasmonic systems, the response of nanoobjects under light illumination can produce complex optical maps. Such plasmonic or resonant systems have interesting characteristics such as sensitivity on parameters and initial conditions. In this paper, we show how these complex maps can be cryptographically improved and associated in order to design a secure pseudo random number generator.

Randomness extraction in elliptic curves and secret key derivation at the end of Diffie-Hellman protocol

A deterministic extractor for an elliptic curve, that converts a uniformly random point on the curve to a random bit-string with a uniform distribution, is an important tool in cryptography. Such extractors can be used for example in key derivation functions, in key exchange protocols and to design cryptographically secure pseudorandom number generator. In this paper, we present a simple and efficient deterministic extractor for an elliptic curve E defined over a non prime finite field. Our extractor, for a given random point P on the curve, outputs the k-first coefficients of the abscissa of the point P. This extractor confirms the two conjectures stated by Farashahi and Pellikaan (2007) and Farashahi et al. (2008), related to the extraction of bits from coordinates of a point of an elliptic curve. As applications of our extractor, we show under the decisional Diffie-Hellman problem on an elliptic curve defined over a finite field of characteristic two, that the k-first or the k-last bits of the abscissa of a random point on the curve are indistinguishable from a random bit-string of the same length.

Cryptographic Boolean Functions with R

Abstract A new package called boolfun is avail-able for R users. The package provides tools tohandle Boolean functions, in particular for cryp-tographic purposes. This document guides theuser through some (code) examples and gives afeel of what can be done with the package.A Boolean function is a mapping f0,1g n !f0,1g.Those mappings are of much interest in the design ofcryptographic algorithms such as secure pseudoran-dom number generators (for the design of stream ci-phers among other applications), hash functions andblock ciphers. The lack of open source software toassess cryptographic properties of Boolean functionsand the increasing interest for statistical testing ofproperties related to random Boolean functions (Fil-iol,2002;Saarinen,2006;Englund et al.,2007;Au-masson et al.,2009) are the main motivations for thedevelopment of this package.The number of Boolean functions with n vari-ables is 2 2 n , i.e. 2 possible output values for each ofthe 2 n input assignments. In this search space ofsize 2

RFID 스마트카드내 DNA STR Information과 일회용 의사난수를 사용한 다중 사용자 인증시스템

본 논문에서는 DNA 생체정보와 소유자 기반의 hardware RFID(Radio Frequency Identification) 스마트카드, 그리고 Software 인증 분야인 PKI 전자서명을 도입한 다중 사용자 인증시스템을 제시한다. 이는 현 시스템의 인가딘 자의 접근 방법인 ID or password 가 안전한 방법이 아니므로 논문[1] 에서 제안한 사항을 다음과 같이 개선하였다. 즉, 사용자 인증 카드인 two card(the biometric registered seal card and the DNA persional ID card) 대신 하나의 RFID 스마트카드로 사용자 인증을 할 수 있고, 카드 분실시 사용자 정보 노출의 위험을 저가의 RFID로 해결한다. 또한 DNA personal ID 민으로 일난성 쌍둥이, 수혈한 환다, 암세포에서 돌연변이가 발생한 경우의 사용자 인증이 어려운 경우까지 사용자 ID 에 대응하는 일회용 의사난수와 DNA 정보로 사용자 인증을 해결하였다. 그러므로 현 생체 정보 사용자 인증시스템의 단점인 패턴 매칭과 패턴 비교의 에러르 정확한 digital DNA 생체정보로 안전하게 스마트카드에 저장하여 터미널에 로그온하는 local applications에 적용할 수 있다. 스미트카드내 RFID는 사용자를 판독, 추적, 관리할 수 있으므로 카드 분실시 카드 위치를 추적하고 개인 정보를 관리할 수 있으며, 어떠한 개인 DNA 정보도 노출되지 않는다. 현 PKI 전자서명의 비밀키 안전성을 해결한다. 뿐만 아니라 이러한 시스템은 생체정보의 RFID 스마트카드 사용 확대 계기로, 신용카드, 신분증, 그리고 여권 등에서도 이용할 수 있다. 제시한 시스템의 안전성을 통계학적 분석으로 보여진다. Thia paper suggests a milti user-authentication system comprises that DNA biometric informatiom, owner's RFID(Radio Frequency Identification) smartcard of hardware token, and PKI digital signqture of software. This system improved items proposed in [1] as follows : this mechanism provides one RFID smartcard instead of two user-authentication smartcard(the biometric registered seal card and the DNA personal ID card), and solbers user information exposure as RFID of low proce when the card is lost. In addition, this can be perfect multi user-autentication system to enable identification even in cases such as identical twins, the DNA collected from the blood of patient who has undergone a medical procedure involving blood replacement and the DNA of the blood donor, mutation in the DNA base of cancer cells and other cells. Therefore, the proposed system is applied to terminal log-on with RFID smart card that stores accurate digital DNA biometric information instead of present biometric user-authentication system with the card is lost, which doesn't expose any personal DNA information. The security of PKI digital signature private key can be improved because secure pseudo random number generator can generate infinite one-time pseudo randon number corresponding to a user ID to keep private key of PKI digital signature securely whenever authenticated users access a system. Un addition, this user-authentication system can be used in credit card, resident card, passport, etc. acceletating the use of biometric RFID smart' card. The security of proposed system is shown by statistical anaysis.