THE EXTENSION OF COLLISION AND AVALANCHE EFFECT TO k-ARY SEQUENCES Viktória Tóth Eötvös Loránd University, Budapest Department of Algebra and Number Theory,

Slides:



Advertisements
Similar presentations
Notes 6.6 Fundamental Theorem of Algebra
Advertisements

ONE WAY FUNCTIONS SECURITY PROTOCOLS CLASS PRESENTATION.
Many-to-one Trapdoor Functions and their Relations to Public-key Cryptosystems M. Bellare S. Halevi A. Saha S. Vadhan.
Mathematics of Cryptography Part II: Algebraic Structures
Foundations of Cryptography Lecture 10 Lecturer: Moni Naor.
Generating Random Numbers
Session 2: Secret key cryptography – stream ciphers – part 2.
Stream ciphers 2 Session 2. Contents PN generators with LFSRs Statistical testing of PN generator sequences Cryptanalysis of stream ciphers 2/75.
CIS 5371 Cryptography 3b. Pseudorandomness.
Block Ciphers and the Data Encryption Standard
CS457 – Introduction to Information Systems Security Cryptography 1b Elias Athanasopoulos
Notation Intro. Number Theory Online Cryptography Course Dan Boneh
Vladimir Protasov (Moscow State University) Perron-Frobenius theory for matrix semigroups.
Computability and Complexity 20-1 Computability and Complexity Andrei Bulatov Random Sources.
Information Security Teaching, training, research.
Session 2 Symmetric ciphers 1. Stream cipher definition Recall the Vernam cipher: Plaintext Ciphertext (Running) key
Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.
Linearization of Stream Ciphers in Terms of Cellular Automata Amparo Fúster-Sabater Institute of Applied Physics (CSIC) Madrid (Spain)
HSC: Building Stream Cipher from Secure Hash Functions Juncao Li Nov. 29 th 2007 Department of Computer Science Portland State University.
Analysis of Security Protocols (V) John C. Mitchell Stanford University.
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
1 Constructing Pseudo-Random Permutations with a Prescribed Structure Moni Naor Weizmann Institute Omer Reingold AT&T Research.
Stream Ciphers 1 Stream Ciphers. Stream Ciphers 2 Stream Ciphers  Generalization of one-time pad  Trade provable security for practicality  Stream.
Session 6: Introduction to cryptanalysis part 1. Contents Problem definition Symmetric systems cryptanalysis Particularities of block ciphers cryptanalysis.
Mathematics of Cryptography Part I: Modular Arithmetic, Congruence,
Session 2: Secret key cryptography – stream ciphers – part 1.
Computer Security CS 426 Lecture 3
Public key ciphers 1 Session 5.
The Fundamentals: Algorithms, the Integers & Matrices.
Pseudo-random Number Generation Qiuliang Tang. Random Numbers in Cryptography ► The keystream in the one-time pad ► The secret key in the DES encryption.
Mathematics of Cryptography Part I: Modular Arithmetic, Congruence,
Security and Protection of Information, Brno Using quasigroups for secure encoding of file system Eliška Ochodková, Václav Snášel
Limits of Local Algorithms in Random Graphs
Códigos y Criptografía Francisco Rodríguez Henríquez A Short Introduction to Stream Ciphers.
1 CIS 5371 Cryptography 3. Private-Key Encryption and Pseudorandomness B ased on: Jonathan Katz and Yehuda Lindel Introduction to Modern Cryptography.
One-Time Pad Or Vernam Cipher Sayed Mahdi Mohammad Hasanzadeh Spring 2004.
Selecting Class Polynomials for the Generation of Elliptic Curves Elisavet Konstantinou joint work with Aristides Kontogeorgis Department of Information.
The Complexity of Primality Testing. What is Primality Testing? Testing whether an integer is prime or not. – An integer p is prime if the only integers.
CS555Spring 2012/Topic 51 Cryptography CS 555 Topic 5: Pseudorandomness and Stream Ciphers.
Kentucky Presentation November, 2006 Cryptography from an art to a science Ganesh Sundaram.
Session 1 Stream ciphers 1.
AVALANCHE EFFECT IN THE FAMILY OF BLOCK CIPHERS “SD-(n,k)” University “Ss Cyril and Methodius” – Skopje, RM S. Markovski, PhD A. Mileva, MSc D. Gligoroski,
PRBG Based on Couple Chaotic Systems & its Applications in Stream- Cipher Cryptography Li Shujun, Mou Xuanqin, Cai Yuanlong School of Electronics & Information.
Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.
NEW DIRECTIONS IN CRYPTOGRAPHY Made Harta Dwijaksara, Yi Jae Park.
Bhupendra Singh Bhupendra Singh Scientist ‘B’ Scientist ‘B’ Centre for Artificial.
Fall 2006CS 395: Computer Security1 Confidentiality Using Symmetric Encryption.
On the Notion of Pseudo-Free Groups Ronald L. Rivest MIT Computer Science and Artificial Intelligence Laboratory TCC 2/21/2004.
The Fundamental Theorem of Algebra Intro - Chapter 4.6.
Pseudo-random generators Talk for Amnon ’ s seminar.
Error-Correcting Codes and Pseudorandom Projections Luca Trevisan U.C. Berkeley.
By Jyh-haw Yeh Department of Computer Science Boise State University.
On Property L On Property L School of Mathematics School of Mathematics Fudan University Fudan University Xiaoman Chen & Xianjin Wan.
On Operator Norm Localization Property On Operator Norm Localization Property School of Mathematics School of Mathematics Fudan University Fudan University.
Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography & Pseudo-Random Coding Li ShujunLi Shujun 1, Li Qi 2, Li.
Complexity Theory and Explicit Constructions of Ramsey Graphs Rahul Santhanam University of Edinburgh.
Kolmogorov Complexity
On the Notion of Pseudo-Free Groups
3.8 Complex Zeros; Fundamental Theorem of Algebra
The Curve Merger (Dvir & Widgerson, 2008)
Cryptography and Network Security Chapter 7
Fundamental Theorem of Algebra
Hyperfinite graphs and combinatorial optimization László Lovász
Generating Random and Pseudorandom Numbers
Generating Random and Pseudorandom Numbers
Cryptography Lecture 15.
Stream Cipher Structure
Presentation transcript:

THE EXTENSION OF COLLISION AND AVALANCHE EFFECT TO k-ARY SEQUENCES Viktória Tóth Eötvös Loránd University, Budapest Department of Algebra and Number Theory, Department of Computer Algebra 9-12th June, 2010, Bedlewo

Pseudorandom sequences They have many applications Cryptography: keystream in the Vernam cipher The notion of pseudorandomness can be defined in different ways

3 Motivation The standard approach: – based on computational complexity – limitations and difficulties New, constructive approach: Mauduit, Sárközy about 50 papers in the last years

The standard approach Notions: PRBG seed, PR sequence next bit test unpredictable cryptographically secure PRBG

Problems „probability significantly greater than ½” The non-existence of a polynomial time algorithm has not been shown unconditionally yet –There is no PRBG whose cryptographycal sequrity has been proved unconditionally. These definitions measure only the quality of PRBG’s, not the output sequences

6 Goals More constructive We do not want to use unproved hypothesis We describe the single sequences Apriori testing Characterizing with real-valued function »comparable

Historical background Infinity sequences: normality (Borel) Finite sequences: –Golomb –Knuth –Kolmogorov –Linear complexity

Advantages Normality Well-distribution Low correlation of low order characterizing with real-valued function comperable

9 Measures mmm

10 Measures

11 Previous results „good” sequence: If both and (at least for small k) are „small” in terms of N This terminology is justified: Theorem: for truly random sequences

12 Further properties ● collision free: two different choice of the parameters should not lead to the same sequence; ● avalanche effect: changing only one bit on the input leads to the change about half of the bits on the output.

13 In the applications one usually needs LARGE FAMILIES of sequences with strong pseudorandom properties. I have tested two of the most important constructions:

14 1.construction: Generalized Legendre symbol

2. construction:

16 My results These constructions are ideal of this point of view as well: – both possess the strong avalanche effect AND –they are collision free

17 Extension to k symbol Mauduit and Sárközy studied k-ary sequences instead of binary ones They extended the notion of well-distribution measure and correlation measure

18 The construction They generated the sequences with a character of order k: Mauduit and Sárközy proved that both the correlation measure and the well-distribution measure are „small” So we can say that this is a good construction of pseudorandom k-ary sequences

A good family of pseudorandom sequences of k symbols Ahlswede, Mauduit and Sárközy extended: They proved that both measures are small

New results I extended the notion of collisions and avalanche effect to k symbol I studied the previous family of k-ary sequences with strong pseudorandom properties.

Let H d be the set of polynomials of degree d which do not have multiple zeroes Theorem: If f is an element of H d, then the family of k-ary sequences constructed above is collision free and it also possesses the avalanche effect.

22 Conclusion If we have a large family of sequences with strong pseudorandom properties, then it worth studying it from other point of view  In this way we can get further beneficial properties, which can be profitable, especially in applications

23 Thank you for your attention!