Results 1 
8 of
8
Ergodic Transformations in the Space of pAdic Integers
 In book: padic Mathematical Physics, AIP Conference Proceedings
, 2006
"... Abstract. Let L1 be the set of all mappings f: Zp → Zp of the space of all padic integers Zp into itself that satisfy Lipschitz condition with a constant 1. We prove that the mapping f ∈ L1 is ergodic with respect to the normalized Haar measure on Zp if and only if f induces a single cycle permutat ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. Let L1 be the set of all mappings f: Zp → Zp of the space of all padic integers Zp into itself that satisfy Lipschitz condition with a constant 1. We prove that the mapping f ∈ L1 is ergodic with respect to the normalized Haar measure on Zp if and only if f induces a single cycle permutation on each residue ring Z/p k Z modulo p k, for all k = 1,2,3,.... The multivariate case, as well as measurepreserving mappings, are considered also. Results of the paper in a combination with earlier results of the author give explicit description of ergodic mappings from L1. This characterization is complete for p = 2. As an application we obtain a characterization of polynomials (and certain locally analytic functions) that induce ergodic transformations of padic spheres. The latter result implies a solution of a problem (posed by A. Khrennikov) about the ergodicity of a perturbed monomial mapping on a sphere. 1.
Increasing the ABC Stream Cipher Period
"... ABC is a synchronous stream cipher submitted to ECRYPT Stream Cipher Project [2]. The changes proposed in this paper increase ABC keystream period to 2 1) words and the size of ABC internal state to 1287 bits while keeping all the guaranteed properties of the keystream without a considerabl ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ABC is a synchronous stream cipher submitted to ECRYPT Stream Cipher Project [2]. The changes proposed in this paper increase ABC keystream period to 2 1) words and the size of ABC internal state to 1287 bits while keeping all the guaranteed properties of the keystream without a considerable overhead.
ABC – a New Fast Flexible Stream Cipher Specification, Version 3
"... ABC is a synchronous stream cipher optimized for software applications. Its key length is 128 bits. It accommodates a 128bit initial vector. Here a version of ABC with a 128bit key and 32bit internal variables is presented. A new approach to the design of stream ciphers has been used which result ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ABC is a synchronous stream cipher optimized for software applications. Its key length is 128 bits. It accommodates a 128bit initial vector. Here a version of ABC with a 128bit key and 32bit internal variables is presented. A new approach to the design of stream ciphers has been used which results
Security and Implementation Properties of ABC v.2
"... Abstract. ABC is a synchronous stream cipher submitted to eSTREAM. Here we describe ABC v.2 – a tweaked version of ABC. The tweaks made ABC v.2 resistant to certain attacks, including the ones presented by Berbain and Gilbert and by Khazaei. We give a design rationale and a brief security analysis o ..."
Abstract
 Add to MetaCart
Abstract. ABC is a synchronous stream cipher submitted to eSTREAM. Here we describe ABC v.2 – a tweaked version of ABC. The tweaks made ABC v.2 resistant to certain attacks, including the ones presented by Berbain and Gilbert and by Khazaei. We give a design rationale and a brief security analysis of ABC v.2. Also it is shown that the distinguishing attacks against ABC v.2 like the one suggested by Khazaei and Kiaei are totally impractical. ABC v.2 is extremely fast in software often heading the eSTREAM benchmark list. Further we define informal requirements for an industrial software stream cipher and show that ABC v.2 meets them. Moreover, we demonstrate that ABC v.2 is also suitable for embedded security applications demanding high performance. Keywords: cryptography, stream cipher, ABC, eSTREAM, ECRYPT, distinguishing attack, stream cipher performance
Add. Input
"... Abstract — In this paper we present the design of a new encryption scheme. The scheme we propose is a very flexible encryption and authentication primitive. We build this scheme on two relatively new design principles: tfunctions and fast pseudo hadamard transforms. We recapitulate the theory behin ..."
Abstract
 Add to MetaCart
Abstract — In this paper we present the design of a new encryption scheme. The scheme we propose is a very flexible encryption and authentication primitive. We build this scheme on two relatively new design principles: tfunctions and fast pseudo hadamard transforms. We recapitulate the theory behind these principles and analyze their security properties and efficiency. In more detail we propose a stream cipher which outputs a message authentication tag along with the encrypted data stream with only little overhead. Moreover we propose securityspeed tradeoffs. Our scheme is faster than other comparable tfunction based designs while offering the same security level.
NONARCHIMEDEAN ERGODIC THEORY AND PSEUDORANDOM GENERATORS
, 710
"... Abstract. The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions (arithmetic and bitwise logical ones) as continuous functio ..."
Abstract
 Add to MetaCart
Abstract. The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions (arithmetic and bitwise logical ones) as continuous functions on the space of 2adic integers. Within this approach, a PRNG is considered as a dynamical system and is studied by means of the nonArchimedean ergodic theory. 1.
WREATH PRODUCTS IN STREAM CIPHER DESIGN
, 2006
"... Abstract. The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of arithmetic and bitwise logical operations, which are standard instructions of modern microprocessors. Moreove ..."
Abstract
 Add to MetaCart
Abstract. The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of arithmetic and bitwise logical operations, which are standard instructions of modern microprocessors. Moreover, both the state update function and the output function are being modified dynamically during the encryption. Also, these compositions could be keyed, so the only information available to an attacker is that these functions belong to some exponentially large class. The paper shows that under rather loose conditions the output sequence is uniformly distributed, achieves maximum period length and has high linear complexity and ℓerror linear complexity. Ciphers of this kind are flexible: One could choose a suitable combination of instructions to obtain due performance without affecting the quality of the output sequence. Finally, some evidence is given that a key recovery problem for (reasonably designed) stream ciphers of this kind is intractable up to plausible conjectures. 1.
The Single Cycle Tfunctions
"... Abstract In this paper the single cycle Tfunctions are studied. Making use of the explicit formulas of sum and product of 2adic integers, we present the necessary and sufficient conditions on the generalized polynomial ˜ p(x) = a0 + ⊕a1x + ⊕·· · + ⊕adx d (mod2 n) being a single cycle Tfunction. F ..."
Abstract
 Add to MetaCart
Abstract In this paper the single cycle Tfunctions are studied. Making use of the explicit formulas of sum and product of 2adic integers, we present the necessary and sufficient conditions on the generalized polynomial ˜ p(x) = a0 + ⊕a1x + ⊕·· · + ⊕adx d (mod2 n) being a single cycle Tfunction. Furthermore, for any given generalized polynomial, we can deduce some expressions about its coefficients by which we can determine whether it is single cycle or not. Key words Tfunction, single cycle, generalized polynomial 1