M. Jessa

Poznan University of Technology, Posen, Greater Poland Voivodeship, Poland

Are you M. Jessa?

Claim your profile

Publications (18)2.24 Total impact

  • M. Jessa, M. Jaworski
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose a novel method for producing secure pseudorandom sequences with combined multiplicative congruential generators that have been defined recently. The specific properties of field programmable gate arrays (FPGA) and the combined multiplicative congruential generators enable the generation of secure sequences in only three cycles of the system clock. The output bit rate of the described design, which is composed of eight generators, achieves 1.227 Gbit/s, and this rate can be significantly increased with more generators. In practice the output throughput is limited only by the available resources of the FPGA used in the design.
    Systems, Signals and Image Processing (IWSSIP), 2012 19th International Conference on; 01/2012
  • M. Jessa, L. Matuszewski
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a novel approach for the design of ring oscillators in a combined true random number generator (TRNG). We propose using delay elements made on carry4 primitives instead of series of inverters or latches in ring oscillators, which enables the construction of many high frequency ring oscillators with different nominal frequencies in the same field programmable gate array (FPGA). The output sequences produced by this type of TRNG pass all NIST 800-22 statistical tests for smaller numbers of ring oscillators than the constructions described in the literature. To assess the unpredictability of the output bits, the restarts mechanism, proposed in earlier papers, was used. Due to the number of ROs with different nominal frequencies and the method of construction of carry4 primitives, it is expected that the proposed TRNG is less sensitive to frequency injection attacks.
    Signals and Electronic Systems (ICSES), 2012 International Conference on; 01/2012
  • M. Jessa, M. Jaworski
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose the use of a field programmable gate array (FPGA) to construct high-speed pseudorandom generators with extremely long periods of generated number sequences. The output streams pass all statistical tests from the NIST 800-22 statistical test suite. The numbers are encoded using only 31 bits. We show that by implementing many generators in a single FPGA, a new source of pseudorandom sequences with extremely long periods can be obtained. This source produces sequences that pass the NIST 800-22 statistical tests and the bit rate of the output stream is k times greater, where k is the number of 31-bit generators used. The upper limit of the bit rate depends on the number of 31-bit generators that produce streams passing all NIST 800-22 statistical tests. Although the new generator is not secure, it can be used in cryptography if an auxiliary source of pseudorandom numbers is implemented in the same FPGA.
    Reconfigurable Computing and FPGAs (ReConFig), 2010 International Conference on; 01/2011
  • Mieczyslaw Jessa, Lukasz Matuszewski
    [Show abstract] [Hide abstract]
    ABSTRACT: An efficient method for generating number sequences that pass all statistical tests is combining numbers produced by many independent generators. Excellent statistical properties are very important in many applications but they are not sufficient in cryptography. We need the unpredictability of numbers that ensures the irreproducibility of sequences by an attacker. This paper proposes a new method for enhancing the randomness of a combined true random number generator (TRNG) using jitter observed in ring oscillators (ROs). To enhance the quality of output streams, we use an auxiliary source of randomness (ASR) that perturbs signals produced by ROs. The increase of entropy is obtained by combining XOR bits produced by many biased RO-based TRNGs. It increases the degree of unpredictability but requires a measure of the quality of this process, which is different from statistical testing of time sequences. To assess the unpredictability of output bits, we used the restarts mechanism proposed in earlier papers.
    2011 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2011, Cancun, Mexico, November 30 - December 2, 2011; 01/2011
  • Mieczyslaw Jessa, Michal Jaworski
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose a new secure pseudorandom number generator that can be integrated with an arbitrary cryptographic system in the same field programmable gate array (FPGA). The described design uses the Improved Multiplicative Congruential Generators (IMCGs) defined recently. The specific properties of FPGAs and the IMCGs enable the generation of random numbers in only three cycles of the system clock. The output bit rate for eight IMCGs is 2.604 Gbit/s. It can be significantly increased using more IMCGs. The proposed generator can also produce secure bits as a specialized chip, which further increases the output bit rate.
    01/2011;
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper deals with the problem of generation of 1-pps timing signal at the output of computer interface controlled by Network Time Protocol. The methods of synchronization of internal computer clock and transmission of the timing signal to the serial interface are described. The results of the measurement of obtained signals are presented. I. INTRODUCTION In the world facing the technological development, the demand for sources of time signals has been still increasing. Currently, numerous systems which to a high extent meet the needs of the consumers of time signals in every respect are offered. The basic sources of time signal are radio systems, for example DCF-77, information systems, i.e. NTP, and satellite systems like GPS. The offered quality of time signal sources falls into the range of tens of milliseconds for radio sources through hundreds of microseconds for NTP to tens of nanoseconds for satellite systems. It seems that the time signal from the Internet has the broadest application because it is easy to acquire and includes a considerable potential for improving its parameters (5, 6, 8). The research presented hereby is, therefore, aimed at the application of NTP protocol to generate the timing signal, with a possibility of utilizing the signal outside the Internet network. It was also assumed that the source of signal would be an ordinary computer with an internal quartz clock. This is an important assumption because the utilization of rubidium clock in the NTP receiver would remove a majority of quality problems affecting the acquired time signal, at the expense, however, of a considerable increase in the device price. Generation of timing signal controlled by NTP could be useful in order to provide some systems with timing signal when we haven't access to good quality timing signal source like atomic clock or GPS controlled oscillator. The authors of this paper have proposed a method of generation of physical timing signal controlled by the NTP (1, 2). In this paper the method enabling generation of physical timing signal (in the form of 1-pps pulses), controlled by the NTP and brought out using serial port of the computer, is described. The algorithm of control of timing signal using NTP protocol is presented and described. The timing signals obtained were compared with the reference signal controlled by GPS receiver.
    01/2011;
  • M. Jessa, M. Jaworski
    [Show abstract] [Hide abstract]
    ABSTRACT: Combining random numbers produced by many independent generators can significantly improve the statistical properties of the output sequence. This statement is true for deterministic and non-deterministic sources of random numbers. In cryptography, a user often needs sequences with very good statistical properties but originating from a non-deterministic system. In this paper, we present the results of statistical tests and a new method for distinguishing pseudo and true randomness for sequences produced by a combined true random number generator (TRNG). The generator uses ring oscillators with outputs sampled by a signal of another clock. The combined TRNG was realized in a field programmable gate array (FPGA) produced by Xilinx.
    Signals and Electronic Systems (ICSES), 2010 International Conference on; 10/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the measuring system SP-4000, which allows for the analysis of timing signals in telecommunication networks, has been described briefly. The solutions that make possible the cooperation between time error meters of this system and the real-time assessment of the parameters have been described. Because of the limitations of computer technology, the user can choose real-time computation for only a single channel. The current version does not allow simultaneous traditional computations and real-time computations. We expect that in the future such computations will be possible for channels that are not chosen for real-time assessment of ADEV, TDEV, and MTIE. We also plan to increase the number of channels capable of real-time computations.
    01/2010;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Summarizing all the series of 24-hours and weekly tests, the authors observed some common tendencies. Neither the server stability nor the speed of generating responses were significantly affected by the fact whether a given test day was a working day or not. It was not confirmed that the server with the shortest time for generating responses is at the same time the most stable one. The influence of the stratum level of the server cannot be noticed, and sometimes a server with better stratum shows worse results. Statistically, the response times of servers are within the range of 100μs.
    EFTF-2010 24th European Frequency and Time Forum; 01/2010
  • M. Jessa
    [Show abstract] [Hide abstract]
    ABSTRACT: A new method to improve the statistical properties of number sequences generated by maximum-period nonlinear congruential generators derived from the Renyi chaotic map is proposed. The characteristic feature of the method is the simultaneous usage of numbers generated by the Renyi map implemented in a finite-state machine, and symbols generated by the same map. The period of sequences generated can be significantly longer than the period of sequences produced by previously defined generators using the same map. It is shown that output sequences obtained with the proposed method can pass all, or almost all, statistical tests from the standard NIST 800-22 statistical test suite for many integer or non-integer values of the parameter.
    Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on; 06/2009
  • M. Jessa
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a new method for improving the statistical properties of sequences generated by the sawtooth chaotic map realized in a finite-state machine in the modular arithmetic. It is shown that sequences obtained with the use of the proposed method pass all tests from the standard NIST 800-22 statistical test suite v.1.8.
    Signals and Electronic Systems, 2008. ICSES '08. International Conference on; 10/2008
  • M. Jessa
    [Show abstract] [Hide abstract]
    ABSTRACT: In the paper, we describe how to design the security of number sequences generated by a generator, exploiting the concept of partition of the state space of the sawtooth chaotic map into disjoint subspaces. We prove that the generator can generate nonperiodic and periodic sequences with arbitrary order of elements when the map is implemented in an uncountable set, and periodic sequences with arbitrary order of elements when the map is implemented in a countable set. The numerical security of the generated sequences is shown to be comparable when we limit our observations to finite time intervals. A method of designing the security of sequences produced by the generator was proposed. It was also demonstrated that the existence of methods for reconstructing the linear congruential generator does not imply automatic reconstruction of the generator, exploiting the concept of partition of the state space of the sawtooth map implemented in a finite-state machine.
    Circuits and Systems I: Regular Papers, IEEE Transactions on 06/2006; · 2.24 Impact Factor
  • M. Jessa, M. Walentynowicz
    [Show abstract] [Hide abstract]
    ABSTRACT: In the paper we consider the usage of the discrete-time phase-locked loop (DT-PLL) as a source of random sequences with different distributions. The proposed approach enables relatively simple and very fast generation of random sequences with different distributions by chaotic maps topologically conjugate to the sawtooth map. The sequences can be obtained directly or indirectly, i.e. from uniformly distributed sequences, also generated in the real circuit of DT-PLL.
    Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on; 02/2002
  • M. Jessa
    [Show abstract] [Hide abstract]
    ABSTRACT: In brief, we describe how to use knowledge about the sequence period generated by the linear multiplicative congruential generator of pseudorandom number sequences to determine the sequence period generated by continuous piecewise-linear chaotic maps of the unit interval or by maps topologically conjugate to these maps. The method exploits a relation between a continuous piecewise-linear map and a piecewise-linear but noncontinuous map of the unit interval with uniformly distributed extrema points, as well as the fact that the latter map can be considered as the generalization of the map describing the linear multiplicative congruential generator
    IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications 02/2002;
  • M. Jessa
    [Show abstract] [Hide abstract]
    ABSTRACT: In the paper we propose a new algorithm of data encryption, exploiting maps, also chaotic, of the unit interval. We consider the finite-state implementation of the systems, e.g. in computers. The characteristic feature of the algorithm is the possibility of adjusting security of data to be transmitted by means of the security index and the usage of chaos-based pseudorandom number generators as the source of running encryption keys. The algorithm enables fast encryption of those parts of data, which do not require high security. The change in encryption speed is achieved without any change of the length of encryption key, which can be fixed and constant during transmission. It is a distinguishing feature of the proposed system as compared to existing schemes.
    Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on; 02/2002
  • M. Jessa, M. Walentynowicz
    [Show abstract] [Hide abstract]
    ABSTRACT: The basic statistical properties of sequences generated by sawtooth maps and tent-like maps as a function of parameter determining the Kolmogorov-Sinai entropy are considered. The statistical properties of sequences generated by both maps for the same value of parameter and the same initial point are also compared. It has been also shown that tent-like maps may have a serious drawback from the perspective of their application as a source of pseudorandom sequences: they cannot generate the maximal-length sequences
    Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on; 02/2001
  • M. Jessa
    [Show abstract] [Hide abstract]
    ABSTRACT: In the paper we consider the possibility of using one dimensional chaotic maps (1D maps) in traditional secret-key cryptography. We propose encryption and decryption algorithms which use the properties of 1D chaotic maps defined for initial points being rational numbers
    Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on; 02/2000
  • M. Jessa
    [Show abstract] [Hide abstract]
    ABSTRACT: In the paper we consider the maximal cycle length of pseudochaotic sequences generated by piecewise linear maps of the unit interval. We define two families of piecewise linear maps: piecewise linear noncontinuous maps (sawtooth maps) and piecewise linear continuous maps (tent-like maps). We formulate and prove an equation relating both families of maps. We show also that there may exist a dependence between the cycle length of sequences generated by sawtooth maps and the cycle length of sequences obtained for tent-like maps for the same value of a parameter and the same initial point
    Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on; 02/1999