Schedule

Wednesday, July 02, 2008

09:00–09:15	Opening
	Chair: Spyros Magliveras
09:15–09:35	Joan Daemen, Mario Lamberger, Norbert Pramstaller, Vincent Rijmen, Frederik Vercauteren: Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers Abstract
09:40–10:00	Gregory V. Bard: Extending SAT-Solvers to Low Degree Extension Fields of GF(2) Abstract
10:05–10:25	S. Gangopadhyay, D. Sharma, S. Sarkar and S. Maitra: On Affine (Non) Equivalence of Bent Functions Abstract
10:30–11:00	Coffee Break
	Chair: Tanja Lange
11:00–11:50	Igor Shparlinski: Pairing Friendly Elliptic Curves and Finite Fields Abstract
12:00–14:00	Lunch Break
	Chair: Vincent Rijmen
14:00–14:20	Miodrag Mihaljevic and Hideki Imai: A Stream Ciphering Approach Based on the Wire-Tap Channel Coding Abstract
14:25–14:45	Somitra Kumar Sanadhya and Palash Sarkar: Searching for Low Weight Codewords in Linear Binary Codes Abstract
14:50–15:40	Johannes Buchmann: Lattice Signatures Abstract
15:50–16:20	Coffee Break
	Chair: Karol Nemoga
16:20–16:40	Otokar Grošek, Milan Vojvoda, Robert Krchňavý: A new matrix test for randomness Abstract
16:45–17:05	Jan Bouda, Jan Krhovjak, Vashek Matyas: Towards true random number generation in mobile environments
17:10–17:30	János Folláth: Construction of Pseudorandom Binary Sequences using Additive Characters over GF($2^k$) Abstract

Thursday, July 03, 2008

	Chair: Johannes Buchmann
09:00–09:50	Alexander May: Solving RSA problems with Lattice Reduction Abstract Slides
10:00–10:30	Coffee Break
	Chair: Gerhard Frey
10:30–10:50	Andrej Dujella: A variant of Wiener's attack on RSA Abstract
10:55–11:15	Bernadin Ibrahimpasic: Cryptanalysis of LUC cryptosystem with short secret exponent Abstract
11:20–11:40	Murat Cenk and Ferruh Ozbudak: On Multiplication in Finite Fields Abstract
11:45–12:05	Marek Klonowski, Miroslaw Kutylowski, Lukasz Krzywiecki, Anna Lauks: Step-out Group Signature Scheme
12:10–14:00	Lunch Break
	Chair: Otokar Grošek
14:00–14:20	Jerzy Jaworski, Michal Ren, Katarzyna Rybarczyk: Random Key Predistribution for Wireless Sensor Networks Using Deployment Knowledge Abstract
14:25–15:15	Spyros Magliveras: Non-abelian cryptography Abstract
15:25–15:45	Tran van Trung and Pavol Svaba: On public-key cryptosystem MST3 and its realization Abstract
15:50–16:20	Coffee Break
	Chair: Attila Pethő
16:20–16:40	Laszlo Csirmaz: Secret sharing schemes --- solved and unsolved problems Abstract Slides
16:45–17:05	Peter Ligeti, Laszlo Csirmaz: On infinite families of graphs with information rate 2-1/k Abstract
18:30–20:00	Reception by the Governor of Styria

Friday, July 04, 2008

	Chair: Daniel J. Bernstein
09:00–09:50	Paul Zimmermann: Modular Arithmetic Abstract Slides
10:00–10:30	Coffee Break
	Chair: Tran van Trung
10:30–10:50	Dimitrios Poulakis: An Electronic Voting Protocol for General Elections over the Internet Abstract
10:55–11:15	Andrea Huszti, Attila Pethő: A Secure Electronic Exam System
11:20–11:40	Daniel Socek and Vladimir Bozovic: A Scheme for Securely Measuring Set Intersection for Biometric Applications
11:45–12:05	Zoltán Csajbók: On the Secure Distribution of Information in Health Care Context Abstract
12:10–14:00	Lunch Break
	Chair: Igor Shparlinski
14:00–14:50	Gerhard Frey: Galois Theory and Discrete Logarithms Abstract
15:00–15:20	Martin Schaffer, Stefan Rass, Patrick Horster: Fusion Discrete Logarithm Problems Abstract
15:25–15:45	Maciej Grzeskowiak: Polynomial time algorithm generating a large prime factor of p^2± p+1
15:45–16:00	Closing

Last Modification: 2008-06-09 — Impressum