Cellular automata computations and secret key cryptography

Seredyński, Franciszek; Bouvry, Pascal; Zomaya, Albert Y.

doi:10.1016/j.parco.2003.12.014

Cited by 125 publications

(96 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Membership to class K2 is characterized by the passing of five specific statistical tests. Such tests, whose validity is well known [13,37,47,7,28,22,7] We have generated a 20,000-bit wide sequence of numbers by means of our scheme and we have performed successfully the five tests above. In detail, the sequence passed the monobit test since the measured result 10,206 lies in the allowed interval (that is, from 9,654 to 10,346).…”

Section: Randomness Of the Generation Schemementioning

confidence: 88%

Implementing disposable credit card numbers by mobile phones

Buccafurri

Lax

2011

Electron Commer Res

View full text Add to dashboard Cite

Disposable credit card numbers are a recent approach to tackling the severe problem of credit card fraud, nowadays constantly growing, especially in the context of e-commerce payments. Whenever we cannot rely on a secure communication channel between cardholder and issuer, a possibility is to generate new numbers on the basis of some common scheme, starting from a shared secret information. However, in order to make the approach meaningful from a practical point of view, the solution should guarantee backward compatibility with the current system, absence of new investments in dedicated hardware, wide-spectrum usability, and adequate security level. In this paper, we propose a solution based on the use of standard mobile phones, fully meeting the above desiderata. Importantly, our solution does not require any cryptographic support and, as a consequence, the use of PADs or smart phones, opening then its usability to a wider potential market.Key words Credit card payments -credit card fraud -disposable credit card numbers -secure payments.

show abstract

Section: Randomness Of the Generation Schemementioning

confidence: 88%

Implementing disposable credit card numbers by mobile phones

Buccafurri

Lax

2011

Electron Commer Res

View full text Add to dashboard Cite

show abstract

“…the chaotic class) to evolve into Group I or II (i.e. point attractors or limit cycles with extremely small periods), according to Wolfram's ECA classification [4][5]. Therefore, such boundary conditions preclude these ECAs from achieving strong random number generators.…”

Section: Discussionmentioning

confidence: 99%

“…Both LFSRs and CAs have been used extensively in a wide area of applications, particularly random number generation for Mont Carlo simulation, communications, cryptography and network security [1][2][3][4][5][6][7][8]. LFSRs, albeit simple in structure and design were proven to have comparatively weak statistical featured when utilized in the production of pseudo random numbers [2].…”

Section: Introductionmentioning

confidence: 99%

Feedback Shift Registers as Cellular Automata Boundary Conditions

K¹

2013

Computer Science &Amp; Information Technology ( CS &Amp; IT )

View full text Add to dashboard Cite

We present a new design for random number generation. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA). The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design is good candidate for parallel random number generation, has strong correlation immunity and it is inherently amenable for VLSI implementation.

show abstract

“…Two types of keys are involved in this process: the long sequence of the C k Cipher Keys generated by ISM and the secret key S k (Seredynski et al, 2004).…”

Section: Ism-based Image Encryption/decryption Systemmentioning

confidence: 99%