Seminars

Title: An Edge-Weighted Centroidal Voronoi Tessellation Model For Image Segmentation

Date: 17 Dec 2008, Wednesday, 4.30 – 5.30pm

Venue: SPMS-MAS-03-06, EC1

Speaker: Prof. Ju Lili,
Associate Professor, Department of Mathematics, University of South Carolina,
USA

Abstract:
Centroidal Voronoi Tesssellations (CVTs) are special Voronoi tessellations whose generators are also the centers of mass (centroids) of the Voronoi regions with respect to a given density function and CVT-based methodologies have been proven to be very useful in many diverse applications in science and engineering. In the context of image processing and its simplest form, CVT-based algorithms reduce to the well-known k-means clustering and are easy to implement. In this talk, we discuss an edge-weighted centroidal Voronoi Tessellation (EWCVT) model for image segmentation and some efficient algorithms for its construction. Our EWCVT model can overcome some deficiencies possessed by the basic CVT model; in particular, the new model combines the image intensity information together with the length of cluster boundaries, and can handle very sophisticated situations. We demonstrate through extensive examples the efficiency, effectiveness, robustness, and flexibility of the proposed method.

Title: Modeling and Simulation of Multiphase Complex Fluids Using An Energetic Variational Phase Field Model
Two-fluid Flows

Time: 10 Dec 2008, Wednesday, 10 - 11am

Venue: MAS-03-06 (Executive Classroom 1)

Speaker:Professor Jie Shen

Abstract:
I shall present an energetic variational phase field model for multiphase incompressible flows which leads to a set of coupled nonlinear system consisting of a phase equation and the Navier-Stokes equations. I shall present efficient and accurate numerical schemes for solving this coupled nonlinear system, and show ample numerical results (drop formation and pitching-off, bubble rising in a polymeric fluid, defect motion in a liquid crystal flow etc.) which not only demonstrate the effectiveness of the numerical schemes, but also validate the flexibility and robustness of the phase-field model.

Title: An Immersed Interface Method for Solving Viscous Incompressible
Two-fluid Flows

Time: 03 Dec 2008, Wednesday, 4.30 - 5.30pm

Venue: MAS-03-06 (Executive Classroom 1)

Speaker: Dr Tan Zhijun

Abstract:
In this talk, we present an immersed interface method for solving viscous incompressible two-fluid flows. The method combines the augmented immersed interface method with front tracking representation of the interface on a uniform Cartesian grid. The immersed interface is represented by a number of Lagrangian control points, and the augmented strategy is to decouple the jump conditions of the fluid variables through two augmented variables. In the proposed method, the augmented interface variables are determined by solving a small system of equations by the LU method or GMRES iterative method. The forces, the augmented variables and their derivatives along the interface, which are related to the jumps in pressure and the jumps in the derivatives of both pressure and velocity, are interpolated using cubic splines. The fluid equations are discretized on a staggered Cartesian grid by a second order finite difference method. The numerical results show that the overall scheme is second order accurate

Title: Ideal Hierarchical Secret Sharing Schemes

Time: 14 Nov 2008, Friday, 4 - 5pm

Venue: MAS-03-06 (Executive Classroom 1)

Speaker: Dr Carles Padro

Abstract:
We consider secret sharing schemes in which the participants are totally ordered in a hierarchy. If a participant in a qualified set is substituted by a higher participant, the resulting subset must be qualified as well. We investigate ideal hierarchical secret sharing schemes and we completely characterize their access structures. This is done by using the connection between ideal multipartite secret sharing schemes and discrete polymatroids that was introduced in our paper in Eurocrypt 2007.

Title: A Computational Study on the Non-Newtonian Impact Problem

Time: 13 November 2008, Thursday, 3 – 4 pm

Venue: MAS-03-06 (Executive Classroom 1)

Speaker: Professor Lei Hou, Professor, Department of Mathematics,
Shanghai University, China

Abstract:
Many materials perform the non-Newtonian property in the micron-scale rheometry test. In this paper, an application of non-Newtonian rate type property, such as impact hardening and share thinning behaviour, is discussed and I hope to shied further light on the mathematical and virtual test methods in the auto-crash safety analysis. Life is always too weak to protect from the non-recover solid metal (phase1) impact, we are deepening our knowledge of soft material recover protection (phase2), known as the passive safety concept. The accurate mathematical prediction would supply ultimate research tool for the passive safety analysis in such scale.

Speaker Biography
1989 – 1998 : M.Sc, PhD and Post-Doc in Computational Physics and Applied Math., United Kingdom;
1998 – 2005 : Research Fellow and PhD Supervisor in finite element modeling and nonlinear analysis on the engineering and industrial mathematical problems (EPSRC, ARUP projects), United Kingdom;
2005 – Present : Professor, Mathematics Department, Shanghai University NNSF, Shanghai Pu-Jiang & ARUP projects), China.

Title: A review of hidden Markov models and Markov random fields with recent applications in vision problems

Time: 5 November 2008, 1630-1730

Venue: SPMS-MAS-03-06, Executive Classroom 1

Speaker: Prof. Lian Heng

Seminar Abstract:
In this talk, I will introduce the hidden Markov models (HMM) originally applied to natural language processing (NLP) and review the extension of HMM to the two dimensional case, the hidden Markov random fields, which has direct applications in image denoising, image segmention, etc. Along the way, connections to anisotropic diffusion and PDE methods will be explained. I will give a selected review of some recent applications of these models, including human identification using gait, dimensionality reduction, field of experts and man-made structure detection. These applications demonstrate the wide applicability of the random fields framework.

For the latest information of the seminar, you can check it in our website
http://www1.spms.ntu.edu.sg/~image

Time: 31 Oct 2008, Friday 4 - 5pm

Venue: MAS-03-06 (Executive Classroom 1)

Speaker: Prof. Andreas Winter

Abstract:
Every sufficiently rich set of measurements on a fixed quantum system defines a statistical norm on the states of that system via the optimal bias that can be achieved in distinguishing the states using measurements from that set (assuming equal priors). The Holevo-Helstrom theorem says that for the set of all measurements this norm is the trace norm. For finite dimension any norm is lower and upper bounded by constant (though dimension dependent) multiples of the trace norm, so we set ourselves the task of computing or bounding the best possible "constants of domination" for the norms corresponding to various restricted sets of measurements, thereby determining the worst case and best case performance of these sets relative to the set of all measurements.
Apart from some specific examples, our most important contribution is the analysis of the multipartite setting with any measurement allowed that can be implemented by local operations and classical communication (LOCC). This is an important case because of the phenomenon of "data hiding": even two orthogonal states can be almost indistinguishable under LOCC. In the case of two parties, we show that the lower domination constant is of the same order as that of a tensor product of local uniformly random POVMs. This answers in the affirmative an open question about the (near-)optimality of bipartite data hiding: The bias that can be achieved by LOCC in discriminating two orthogonal states of a d x d bipartite system is Omega(1/d), which is known to be tight.
[Based on joint work with S Wehner and W Matthews, arXiv:0810.2327]

About the Speaker:
Andreas Winter received his PhD from the Department of Mathematics, University of Bielefeld (Germany) in 1999. He has been with the University of Bristol since 2001, first as a postdoc in the Department of Computer Science, since 2003 as Lecturer with the Department of Mathematics, and finally as Professor for the Physics of Information since 2006. Since 2007 he is a visiting research professor at the National University of Singapore. His research interests include quantum information, complexity theory and discrete mathematics.

Title: Mixed multiscale finite element methods using limited global

Time: 29 October 2008, 1630-1730

Venue: SPMS-MAS-03-06, Executive Classroom 1

Speaker: Prof. Yalchin Efendiev, Texas A&M University
information and applications 

Seminar Abstract :
In this talk, I will describe mixed multiscale finite element methods for solving elliptic equations with oscillatory coefficients and applications to flows in heterogeneous porous media. The use of limited global information is needed to capture non-local features of the solutions. These features cannot typically be captured via local multiscale basis functions. We will talk about the generalization of mixed MsFEMs to stochastic equations. Finally, the applications to multi-phase flow/transport and nonuniform coarsening mechanisms will be discussed.  
For the latest information of the seminar, you can check it in our website
http://www1.spms.ntu.edu.sg/~image

Title: Testing the hypothesis that a large-dimensional variance-covariance matrix is equal to a given matrix by Prof. Bai Zhidong

Date: 28 Oct 08 (Tues) 2-3pm

Venue: SPMS-MAS-03-06, EC1

Abstract: See attached

Title: Galois Rings and Pseudo Random sequences

Date: 24 Oct 2008 Friday 4 - 5pm

Venue: MAS-03-06 (Executive Classroom 1)

Speaker: Dr. Patrick Solé

Abstract:
We survey our joint work with Dimitrii Zinoviev on Pseudo random sequences generation by use of weighted degree trace codes over Galois rings. Applications range from cryptography (ML sequences over rings) to signal processing (PAPR reduction in OFDM communication systems).

Speaker:
Patrick Solé  received the Ingénieur and Docteur-Ingénieur degrees both from Ecole Nationale Supérieure des Télécommunications, Paris, France, in
1984 and 1987, respectively, and the habilitation à diriger des recherches from Université de Nice-Sophia Antipolis, Sophia Antipolis, France, in 1993.

He has held visiting positions in Syracuse University, Syracuse, NY, from
1987 to 1989, Macquarie University, Sydney, Australia, from 1994 to 1996, and Lille University, Lille, France, from 1999 to 2000.

Since 1989, he has been a permanent member of the CNRS Laboratory I3S, Sophia Antipolis, France, and became Directeur de Recherche in 1996.

His research interests include coding theory ( codes over rings, quasi-cyclic codes), interconnection networks (graph spectra, expanders), vector quantization (lattices), and cryptography (boolean functions, pseudo random sequances).

Dr. Solé is the recipient (jointly with Hammons, Kumar, Calderbank, and
Sloane) of the IEEE Information Theory Society Best Paper Award in 1994.

Title: How to buy a Subgraph: Topics in Algorithmic Game Theory

Date: 21 Oct 08, Tues, 2-3pm

Speaker: Dr. Edith Elkind

Venue: SPMS-MAS-03-06, Eecutive Classroom 1

More information: See attached  

Title: Cryptographic Hashing at Crossroads

Time: 17 Oct 2008 Friday 4 - 5 pm

Venue: MAS-03-06 (Executive Class Room 1)

Speaker: Josef Pieprzyk

ABSTRACT: This is a review of the state of the art in cryptographic hashing. In particular, we first introduce basic definitions, properties and structures of cryptographic hashing. Next, we examine basic solutions of cryptographic hashing using block ciphers. Overview of custom-designed hashing follows. We next discuss solutions derived from intractable problems. Finally, we describe the requirements and expectations of the NIST call for SHA-3.

Title: The curve of centers of a finite points set

Time: 17 Oct 2008 Friday 1030 - 1130 am

VENUE: MAS-03-06 (Executive Class Room 1)

SPEAKER: Wang Xinli

ABSTRACT: The talk is about a curve of centers of a finite points set.
A curve \mu_r of a certain points set embodies many symmetric properties of the points set. From this curve of \mu_r, we could speculate the original points set. What's more, it's possible to speculate the whole curve \mu from finitely many points located on this curve, and then to know the original set. The curve is related to the detection of symmetry of a points set as well as symmetrization.

About the SPEAKER:
Wang xinli had her Bachelor of Science in NCUT (North China University of Technology)(2002-2006), she is currently pursuing her PhD in NTU since August 2008 under the supervision of Prof. Chee Yeow Meng and Prof. Sinai Robins

Title : Variational Image Segmentation Using Multilayer Implicit Curve

Time : 15 October 2008, 1630-1730

Venue : SPMS-MAS-03-06, Executive Classroom 1

Speaker : Ginmo J. CHUNG, Hokkaido University, Japan.
Evolution Approach

Seminar Abstract :
Recently variational image processing has become popular thanks to its strong mathematical theory and existence of state-of-the-art numerical methods for solving PDEs. In this talk, we present a piecewise constant image segmentation model based on a new implicit curve evolution technique in variational framework. In our approach, we use multiple level sets of the evolving level set function to represent the boundaries among objects. Our proposed model can be viewed as an extension of the piecewise constant Chan-Vese segmentation model by combining their model with multilayer level set approach. This new approach can be applied for images with known topology and nested structure. e.g. MR brain images. By construction our approach is more efficient way of partitioning images. We show how we can apply the multilayer segmentation model to 3D MR brain data sets. We also discuss different choices of regularization in order to keep the level set function more regular.

For the latest information of the seminar, you can check it in our website
http://www1.spms.ntu.edu.sg/~image

Title: Some properties of Quasi-Twisted Codes

Date: 10 Oct 2008, Wed, 4-5 pm  

Speaker: Jia Yan

Venue: SPMS-MAS-03-08

Abstract:
The class of quasi-twisted codes are known to contain lots of good codes. By employing Discrete Fourier Transform(DFT) and Generalized Discrete Fourier Transform(GDFT), the algebraic structure of quasi-cyclic(QC) codes have been carefully studied. Unfortunately, very little known on the algebraic structure of quasi-twisted(QT) codes or explicit constructions, especially the repeated root case. In this paper, the spectral technique has been generalized to study the algebraic structure of QT codes. With the growing interest in generator construction of QT codes, explicit construction formula is derived in this paper, which is another direction to study the construction of QT codes. It has been shown that some best-known linear codes can also be obtained by the formula.

References:
[1]S. Ling and P. Sol´e, "On the algebraic structure of quasi-cyclic codes I: Finite Fields," IEEE Trans. Inform. Theory, vol.47, pp.2751-2760, 2001.
[2]S. Ling and P. Sol´e, "On the algebraic structure of quasi-cyclic codes II: chain rings," Designs, Codes and Cryptography 30. pp.113-130, 2003.
[3]S. Ling and P. Sol´e, "On the algebraic structure of quasi-cyclic codes III: generator theory," IEEE Trans. Inform. Theory, vol.51, pp. 2692-2700, 2005.
[4]S. Ling, H. Niederreiter, and P. Sol´e,"On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots," Designs, Codes and Cryptography 38, no. 3, pp.337-361, 2006.

About the Speaker:
Jia Yan obtained a Bachelor Degree in Mathematics from Shanghai Jiao Tong University, China. She is currently pursuing PhD studies on "Algebraic Methods of Coding Theory" at Division of Mathematical Science, Nanyang Technology University, Singapore.

08 Oct 08

Title : Variational Methods on Image Processing

Date: 8 Oct 2008, Wed, 9 am to 10 am

Speaker: Dr. Lin He

Venue : SPMS-MAS-03-06, Executive Classroom 1

Seminar Abstract :
Image processing is a very broad are which can be roughly divided into three major categories: image compression, image enhancement and restoration, and measurement extraction. Variational method, a method arisen from Physics, Statistics and so on, is to find the extremum of an integral involving a function and its derivatives. For more than a decade, applying variational methods on image processing has been quite popular. And the literature over there covers more or less part of or all of the following: developing new models, theoretical analysis on mathematical models, developing fast computational algorithms and applying mathematical algorithms on different applications.
My talk will review existing models emerged from different applications I have worked on (such as noise removal, deblurring, segmentation, image inpainting, MR image reconstruction), to generalize a mathematical framework and to develop new models and fast numerical algorithms combining ideas from other fields.

About the Speaker :
Lin He received her B.A., Ph.D. from the department of Mathematics at the Peking University, China and University of California in Los Angeles, U.S.A in 2001 and 2006 respectively. After a one and a half year post-doctoral research at Radon Institute for Computational and Applied Mathematics (RICAM) in Linz, Austria, she currently works as a research and development engineer for Luminescent Technologies, Inc. in Palo Alto, California. She works on inverse problems with variational PDEs, particularly applications on image processing problems. She also works on level set methods and its applications.

Title: Grassmannian spaces & Codes and Division Algebras

Date: 3rd Oct 2008 Fri, 4-5pm  

Speaker: Jean Creignou

Venue: SPMS-MAS-03-08

Abstract: This talk is divided in two distinct parts.
The first part deals with codes in Grassmannian spaces.
After a short introduction on codes in Grassmannian spaces, we will present a method to construct infinite families of optimal (regarding the so-called chordal distance) codes in Grassmannian spaces.

The second part of the talk concerns codes and division algebras.
We will explain briefly how division algebras are related to wireless communication. Then we will discuss about the construction of division algebras which fulfills constrains related wireless communications.

About the Speaker:
Jean Creignou is pursuing PhD studies on "Codes for wireless multi-antennas communication" at the mathematical institute of Bordeaux
(France) and will defend his thesis in November 2008.
His scientific interests include cryptography, information security, error correcting codes and discrete mathematics. He obtained a Master Degree in Mathematics from the university of Rennes and a Master Degree in Cryptography and Information Security from the university of Bordeaux.

Title: An Analogue of the Gallai-Edmonds Structure Theorem for Nonzero Roots of the Matching Polynomial

Date: 3rd Oct 2008 Fri, 10am 

Speaker: Ku Cheng Yeaw (NUS)

Venue: SPMS-MAS-03-6, Executive Classroom 1

Abstract
Classical Matching Theory is mostly concerned with zero roots of the matching polynomial of graphs. We prove an analogue of the celebrated Gallai-Edmonds Structure Theorem for nonzero roots. Consequently, we show that the matching polynomial of a vertex transitive graph has simple roots, thus disproving a conjecture of Mohar. This is a joint work with William Chen.

Attachment: See attached

Title: Linear Programming Bounds

Date: 30 Sept 08, Tues, 1030 to 1130

Venue: SPMS-MAS-03-06, Executive Classroom 1

Speaker: Jean Creignou, Mathematical Institute of Bordeaux (France)

Seminar Abstract:
This talk presents a method to obtain bounds for codes in Coding Theory. We first give a rough idea of the linear programming method. Then we show how to use this method to get analytical and numerical bounds using our recent results on unitary matrices as an example.

Title: An Invitation to Algebraic Design Theory

Date: 26th Sept 08, Fri, 4:00pm - 5:00pm

Venue: MAS-03-08

Speaker: Dr. Feng Tao

Abstract:  In this talk, I will give a brief introduction to algebraic design theory. I will explain the basic concepts and definitions, and the tools that are used to study them: chracter theory, algebraic number theory as well as group rings. I will laso mention some conjectures we are now interested in, e.g., the Multiplier conjecture and Lander's conjecture.

Bio: Tao Feng obtained his B. Sc.from Beijing Institute of Technology in 2003, and his Ph.D. from Peking University in 2008. He is currently a research fellow at NTU

19 Sep 08

Title:  Fermat Quotients

Date: 19 Sep 08 Friday, 4:00pm - 5:00pm

Venue: MAS-03-08

Speaker: Igor Shparlinski

Abstract: See attached

Title: Non-Degrading Erasure-Tolerant Information Authentication With An Application to Multicast Stream Authentication Over Lossy Channels

Date: 19 Sep 2008 Fri, 2:00pm - 3:00pm

Speaker: Prof. Yvo Desmedt

Venue: MAS-03-08

Abstract:
The concept of erasure-tolerant information authentication was recently introduced to study an unconditionally secure setting where it is allowed to loose a limited number of message letters during transmission. Even if a part of the message is lost, the verifier will still be able to check the authenticity of some or all of the received message letters.  In general, there might be some letters whose authenticity cannot be verified although they have arrived at the recipient's side. These letters will be discarded.

We consider a special case when the verifier can always check the authenticity of all received message letters.  This property is desirable since no data will be lost due to the verifier's inability to verify its authenticity (i.e., the scheme does not introduce additional degradation of the quality of the received information). We provide necessary and sufficient conditions for a set system based erasure-tolerant authentication scheme to be non-degrading. We also discuss efficient implementations and propose a provably secure stream authentication scheme that makes use of erasure-tolerant authentication codes.

This is based on joint work with Goce Jakimoski and was presented at CT-RSA 2007.

SHORT BIO: Yvo Desmedt received his Ph.D. (Summa cum Laude) from the University of Leuven, Belgium (1984).  He is presently the BT Chair of Information Security at University College London, UK. He is also a courtesy professor at Florida State University. His interests include cryptography, network security and computer security. He was program chair of ICITS 2007, co-program chair of CANS 2005, program chair of PKC 2003, the 2002 ACM Workshop on Scientific Aspects of Cyber Terrorism and Crypto '94. He is editor-in-chief of the IET Information Security, editor of the Journal of Computer Security, of Information Processing Letters and of Advances in Mathematics of Communications.
He has given invited lectures at several conferences and workshop in 5 different continents. He has authored over 150 refereed papers. He has
135 entries on DBLP.

Seminar Title : Integrals

Date: 19 Sept 08, Thurs, 11am to 12pm

Venue: SPMS-MAS-03-06, Executive Classroom 1

Seminar Abstract :
We will study some basic properties of definite integrals and mean value theorem. We will prove fundamental theorem of calculus which links indefinite integrals to definite integrals. Methods of integration will be discussed together with examples.

About the Speaker :
Dr Zhang Yongmin is a lead research analyst in Capital Market Research Group of Washington Mutual. His area is in fixed income and mortgage analysis. Before he joined this group, he was an assistant professor at State University of New York where he did research in turbulent flow and American options with more than twenty publications. He has also taught numerous courses in Applied Mathematics and Statistics. Prior to this appointment, he was a research scientist at SUNY Research Foundation. He was a co-principle investigator for various grants from US Department of Energy. He holds his Ph.D. in Applied Mathematics from University of Chicago.

Title: American Option Pricing Models and Obstacle Problems

Date: 19 Sept 08, Fri, 9.30am to 10.30 am

Venue: SPMS-MAS-03-06, Executive Classroom 1

Seminar Abstract :
We first give a brief overview of American option pricing models and numerical methods. We treat American option models as a special class of obstacle problems. Finite element formulation is introduced together with error analysis of numerical solutions. Some interesting properties about sensitivity of the option price to the payoff function are proved. We also give a criterion for the convergence of numerical free boundaries (optimal exercise boundaries) under mesh refinement. Some future research plans will be discussed.

About the Speaker :
Dr Zhang Yongmin is a lead research analyst in Capital Market Research Group of Washington Mutual. His area is in fixed income and mortgage analysis. Before he joined this group, he was an assistant professor at State University of New York where he did research in turbulent flow and American options with more than twenty publications. He has also taught numerous courses in Applied Mathematics and Statistics. Prior to this appointment, he was a research scientist at SUNY Research Foundation. He was a co-principle investigator for various grants from US Department of Energy. He holds his Ph.D. in Applied Mathematics from University of Chicago.

Title: American Option Pricing Models and Obstacle Problems

Date: 19 Sept 08, Fri, 9.30am to 10.30 am

Venue: SPMS-MAS-03-06, Executive Classroom 1

Seminar Abstract :
We first give a brief overview of American option pricing models and numerical methods. We treat American option models as a special class of obstacle problems. Finite element formulation is introduced together with error analysis of numerical solutions. Some interesting properties about sensitivity of the option price to the payoff function are proved. We also give a criterion for the convergence of numerical free boundaries (optimal exercise boundaries) under mesh refinement. Some future research plans will be discussed.

About the Speaker :
Dr Zhang Yongmin is a lead research analyst in Capital Market Research Group of Washington Mutual. His area is in fixed income and mortgage analysis. Before he joined this group, he was an assistant professor at State University of New York where he did research in turbulent flow and American options with more than twenty publications. He has also taught numerous courses in Applied Mathematics and Statistics. Prior to this appointment, he was a research scientist at SUNY Research Foundation. He was a co-principle investigator for various grants from US Department of Energy. He holds his Ph.D. in Applied Mathematics from University of Chicago.

Title: A combinatorial problem arising from short Weil numbers

Venue: NUS, S16 Level 3, CRB

Date: 12 Sept 08, (Fri), 10am 

Speaker: Ka Hin Leung

Abstract:
A Weil number is called short if it can be represented as the sum of a small number of roots of unity. Kedlaya has shown that short, nontrivial Weil numbers in Q(\zeta_p) cannot exist under some condition. It is conjectured that short Weil numbers in Q(\zeta_p) still cannot exist under much weaker conditions. A proof of this conjecture would be very useful for the theory of multipliers of difference sets. In this talk, we study short Weil numbers of a specific form which give rise to an intriguing combinatorial problem. It turns out that a celebrated addition theorem of Kneser's yields useful insights.

Date: 22nd,29th Aug and 12th Sep 2008, 4:00pm-5:30pm  

Venue: SPMS-MAS-03-08

Speaker: Dr. Mike Kaminski

BIOGRAPHY: Dr. Mike Kaminski is currently visiting our division. Website: http://www.cs.technion.ac.il/people/kaminski/

ABSTRACT: This is a series of three lectures, each between one and one and a half hour,
intended to show a very tight relationship between algorithms for multiplication of polynomials
over finite fields and error-correcting codes.

Tutorial 1: Algorithms for polynomial multiplication.

This is a general introduction to polynomial multiplication that does not require any
background (neither in Computability, nor in Mathematics). I have already taught this
material in my first MAS720 lecture.

Tutorial 2: From algorithms for polynomial multiplication to error-correcting codes – a lower bound.

In this tutorial I will show how algorithms for polynomial multiplication can be transformed
into error-correcting codes. I will teach all necessary Math background (that is not deep,
but acquaintance with regular matrix representation of field extensions would help).

Tutorial 3: From Goppa codes to algorithms for polynomial multiplication – an upper bound.

In this tutorial I will show how Goppa codes transform into algorithms for polynomial
multiplication (the D.V. & G.V. Chudnovsky algorithm). Math background required is basics
of Algebraic Function Fields (up to the Riemann-Roch theorem) needed for understanding
Goppa codes.

Title: Revisiting the Karnin, Greene and Hellman Bounds for Secrets Sharing

Date: 5th Sept 08, Fri, 4:00pm - 5:00pm

Venue: SPMS-MAS-03-08

Speaker: Prof. Yvo Desmedt

Abstract:
Secret sharing plays an important role in modern cryptography. In a t- out-of-n threshold scheme, n parties receive shares of a secret such that any t
+1 can
reconstruct the secret, but t cannot. When the probability distribution corresponding to these t shares is independent of the secret, the threshold scheme is called perfect. To satisfy this requirement the size of each share must be at least the size of the secret. If we have equality, we call the scheme "ideal".

Karnin, Greene and Hellman (1983) gave several bounds concerning the maximal number of participants (i.e., the maximal n) in ideal threshold sharing schemes.  We revisit and update the Karnin, Greene, and Hellman bounds, providing optimal bounds on the number of participants in ideal linear threshold secret sharing schemes for various finite fields. We construct these bounds using the same tools that Karnin, Greene, and Hellman introduced in their seminal paper.  We provide optimal bounds for the maximal number of players for a t-out-of-n ideal linear threshold scheme when t=3, for all possible finite fields.  These bounds are very similar to the Bush bounds on MDS codes.  We then generalize this observation.

Title: Hydrodynamic Instability Theory : from small disturbances to turbulence.

Date: 5 Sept 08, Fri, 3:00 pm to 4:00 pm

Venue: SPMS-MAS-03-06, Executive Classroom 1

Speaker: Prof Philip Hall, Director of the Mathematical Sciences Res Inst at Imperial College, UK

Seminar Abstract :
A review of hydrodynamic stability theory for fluid flows of practical importance is given. Particular attention is given to the stability of shear flows relevant to aerodynamics. Strongly nonlinear theories are used to determine the stream-wise vortex component of the flow. The latter component plays the crucial role in the preparation of the flow to admit small-scale disturbances which ultimately lead to the onset of turbulence. A new criterion for the onset of transition is derived.

Title: On Hecke Eigenvalues at Piatetski-Shapiro Primes

Date: 3rd Sept 08, Wed, 4:00pm – 5:00pm

Venue: SPMS-MAS-03-06, Executive Classroom 1

Speaker: Liangyi Zhao, NTU

Abstract: This is joint work with Stephan Baier.  Mean-values of arithmetic functions are very often well-understood unless the averaging is taken over a sparse set of natural numbers.  The arithmetic function of interest in this talk is λ(n), the normalized n-th Fourier coefficient of a holomorphic cusp form for the full modular group, and the sparse set consists of Piatetski-Shapiro primes (defined below).  We show that there exists some constant C>0 depending on the cusp form and for every fixed c with 1 < c < 8/7, the mean value of λ(p) is << exp(-C (\log N)1/2 ) as p runs over all (Piatetski-Shapiro) primes of the form [nc] with for some natural number n ≤ N.  I will discuss the history and motivation of the relevant topics, give a rough idea of the proof and some possible future directions of this problem.

Title: Nonexistence of Hadamard difference sets in 8x8x9

Date: 29th Aug 08, Friday, 10am

Venue: NTU, SPMS-MAS-Executive Classroom 1, SPMS-MAS-03-6

Speakers: Bernhard Schmidt and Tao Feng

Abstract: The search for Hadamard difference sets in 8x8x9 has attracted a lot of attention as it was considered the most promising place to look for counterexamples to Lander’s conjecture. We will show that, unfortunately, no such difference set exists. We have improved upon a previous method, and now our proof in computer free.

Seminar Title : An introduction to algebraic number theory

Date: 19th Aug 08, Tues, 9.30 -10.30 am

Venue : SPMS-MAS-03-06, Executive Classroom 1

Seminar Abstract : Via studying the Diophantine equation Y^2-5=X^3, we introduce some important concepts in algebraic number theory, such as ideals, fractional ideals, ideal class groups, and unit group.

About the Speaker : Prof Tian Ye is a Professor at the Academy of Mathematics and Systems Science, Chinese Academy of Sciences. He obtained his PhD at Columbia University in 2003.  

Title: Some constructions of optimal constant-weight codes

Date: 15th Aug 08, Fri, 3 - 5pm

Venue: SPMS-MAS-03-08

Abstract: In this presentation, I will introduce a couple of new constructions for optimal nonbinary constant-weight codes. These constructions show that 1) A_q(q, 4, 3) = q(q - 1)(q - 2)/6 for all q > 2, and 2) with q and w are given, A_q(n, 2w - 1, w) = (q - 1)n/w, for all sufficiently large n satisfying w|(q - 1)n. Here the notation A_q(n, d, w) refers to the maximal size of a q-ary code of length n, distance d, and constant-weight w.

Speaker: Dau Son Hoang

Biography: Dau Son Hoang got his Bachelor's degree in Applied Mathematics and Informatics in 2006, from the College of Science, Vietnam National University, Hanoi, and his Master's degree in Coding Theory in 2008, from the School of Physical and Mathematical Sciences, NTU. His research interests include coding theory, discrete mathematics and their applications.

Title: Hadamard difference sets and Lander's conjecture

Date: 14th Aug 08, Thurs, 4pm 

Venue: SPMS-MAS-Executive Classroom 1 (Level 3)

Speaker: Assoc Professor Bernhard Schmidt

Abstract: An interesting case to look for counterexamples to Lander's conjecture is Hadamard difference sets in abelian groups of order 576 whose Sylow 3-subgroup is cyclic. We present a method to settle this case, and go through the details for one example. Unfortunately, no counterexample seems to arise.   

Title:  n-level density of the low-lying zeros of quadratic Dirichlet L-functions

Date: 13 Aug 08, Wed, 2pm – 3pm

Venue: Executive Classroom 1, MAS-03-06  

Speaker: Dr. Gao Peng, NTU

Abstract: See Attached

Title: Intelligent information processing systems

Date: 8 Aug 08, Friday, 10.30am– 11.30am 

Venue: SPMS-MAS-03-06, Executive Classroom 1

Seminar Abstract: An important issue that we encounter today is how to make effective use of the enormous amount of data. These data we can get via internet are from various ways such as various database, electronic articles, academia literatures, technical experimental results, etc. How to automatically and effectively extract, integrate and make use of information embedded in such heterogeneous unstructured data is a challenging task. Two systems, ONBIRES and QUANTA, will be introduced in the talk.

ONBIRES (ONtology-based BIological Relation Extraction System) is designed to perform the tasks: automatic relation extraction from literature, knowledge management such as biological interaction network visualization and query answer, providing hypothesis prediction information for new biological concepts discovery, and even information for knowledge inference.

QUANTA (QUestion Answering Tavern) is a prototype system of question answering, which is designed for natural language search. Currently, search engines, such as Google, all push the task of data mining back to users. The process of a web search is an interactive process repeating what’s illustrated below: the user has to analyze pages to find the information needed and, often, requires better keywords to repeat the search. We think the next generation search engine should be able to provide direct answers. Such a system is possible as demonstrated in our QUANTA system.


About the Speaker : ZHU Xiaoyan, Professor, Deputy Head of state key lab of intelligent technology and systems, Tsinghua University. She got her bachelor degree at University of Science and Technology Beijing in 1982, master degree at Kobe University in 1987 and Ph. D. degree at Nagoya Institute of Technology, Japan in 1990. She is teaching at Tsinghua University since 1993. Her research interests include pattern recognition, neural network, machine learning, natural language processing and bioinformatics.

Title: Computational Math/Physics on Desktops can now resolve hard open problems in Planetary Atmospheres

Date: 7 Aug 08, (Thur), 2pm to 3 pm

Venue: SPMS-MAS-03-06, Executive Classroom 1

Abstract : Several open problems regarding super-rotation of Venus atmosphere and the structure and persistence of Jupiter’s Great Red Spot (14000 km across) – in particular the high velocity of 100 m/s in its circumferential band of 3000 km width as observed by Voyagers 1 and 2 – were partially resolved using advanced Monte-Carlo simulations on Desktops of the author’s recent unified statistical theory of shallow water flows on a rotating sphere.

This talk will emphasize some open mathematical problems connected with the existence of constrained minimizers for the Lagrangian of the flow and their relation to the minimizers of the free energy of the statistical theory. Collaborations include T. Andersen, S.M. Assad, Xueru Ding, J. Nebus, R.S. Mavi, and Junping Shi and research over the past 4 years funded by US ARO and DOE.

About the Speaker : Prof Chjan Lim has been a Full Professor at Rensselaer Polytechnic University since 2002. He was appointed as a Visiting Professor at National University of Singapore during parts of 2000 to 2001. He has been invited to give talks on several occasions at ICIAM Zurich, GAMM Berlin, IUTAM  Moscow, Como, Italy. He won the Silver Medal at the Malaysian Math Olympiad 1977.  He graduated with a B.S.E from Princeton University in 1982 and holds a M.Sc and PhD in Applied Math from Brown University. He obtained his Postdoc from University of Michigan Ann Arbor and IMA, University of Minnesota.

Venue: Executive Classroom 1, MAS-03-06

Title:  Eigenvalues of Large Dimensional Random Matrices

Speaker: Prof Jack W. Silverstein, North Carolina State University, USA

Abstract: See Attached

Title :  Computability, Definability, and Metamathematics

Date: 28 July 08 (Mon), 4pm – 5pm

Venue: Executive Classroom 1, MAS-03-06

Seminar Abstract :
There is a natural hierarchy of mathematical objects going from finite, to infinite, to analytic, and finally to the horizon of the very large. Within each context there is also a hierarchy of properties of the objects there and methodologies used to study them.  Part of the role of Mathematical Logic is to make sense of this structure, classify, and calibrate it.  Then one can ask and answer interesting questions, such as  measuring to what extent phenomena in the large are reflected within the small, both theoretically and practically.  One can also ask whether the explanation given is inevitable.

We will give a survey of results in the subject, with more focus on concrete examples than on generalities.

About the Speaker :
Professor Theodore Slaman, University of California Berkeley,  is best known for his work in Recursion Theory and recently for applying recursion and set theoretic methods to the study of randomness.

Slaman received his PhD in 1981 from Harvard University under the supervision of Gerald Sacks.  He spent his early career at the University of Chicago and then moved to the University of California, Berkeley in 1996, where he is now a Distinguished Professor of Mathematics.  He is the recipient of a National Science Foundation Presidential Young Investigator Award, a Japan Society for the Promotion of Science Fellowship, and a Alexander von Humboldt Research Award. 

Slaman is a frequent visitor to Singapore and currently holds a three-year Distinguished Visiting Professorship at NUS.

Title: Secret Sharing: a Taxonomy of Data Distribution Protocols

Date: 25 July 2008, 3:30 – 4:30pm 

Venue: SPMS-MAS-03-06

Abstract: With the expansion of communication networks, it became obvious to ask for the existence of protocols to distribute information amongst several participants in order to overcome the requirement of having a member storing all secret parameters of a construction. However, to achieve this goal, security has to be provided. Secret sharing was designed to facilitate the distributed storage of a secret in an unreliable environment. Since its introduction by Blakley and Shamir in 1979, this primitive has been playing important roles in group-oriented cryptography. In this talk, we will present a taxonomy of the main constructions and properties for secret sharing techniques. This presentation is mainly dedicated to research students.

About the speaker: Christophe Tartary obtained a PhD in Computer Science from Macquarie University, Australia (2007). He is currently a research fellow in the Division of Mathematical Sciences at Nanyang Technological University (Singapore) and in the Institute for Theoretical Computer Science at Tsinghua University (Beijing, P. R. China). His research interests include multicast security, multiparty computation, secret sharing and coding theory. web: http://www1.spms.ntu.edu.sg/~ctartary

Title : Bayesian Language Models with Pitman-Yor Processes

Date: 25 Jul 08, 2pm to 3pm 

Venue : MAS-03-06, Executive Classroom 1

Abstract : We study Bayesian models of natural languages achieving state-of-the-art performance. The models are based upon two ideas.
First, languages have power law statistical behaviour with a few very common events and very many rare events; we model this with a class of nonparametric Bayesian models called Pitman-Yor processes. Second, language models are very large and language data sparse, thus smoothing (or sharing of information) across the models is essential to the success of the models; we use the concept of hierarchical Bayesian modelling to achieve smoothing. Put together, our hierarchical Pitman-Yor language model succeeds in achieving state-of-the-art performance. We show that interpolated Kneser-Ney (one of the best and most well-known smoothing techniques) can be interpreted as an approximation to the hierarchical Pitman-Yor language model. We also show that an extension of our model can address the issue of domain adaptation in a principled Bayesian fashion.

About the Speaker :
Teh Yee Whye became a lecturer (equivalent to assistant professor) at Gatsby Computational Neuroscience Unit, UCL, United Kingdom in 2007. He received his PhD from the University of Toronto in 2003 under the tutelage of Geoffrey Hinton. He was a postdoc at the University of California, Berkeley working with Michael Jordan, and at the National University of Singapore working with Wee Sun Lee, where he received a Lee Kwan Yew Postdoctoral Fellowship. He is interested in Bayesian and probabilistic approaches to machine learning, and applications in information retrieval, natural language processing, computer vision, and computational biology.

Title: Network FRESCO: A Framework for Experimental Screening, Control, and Optimization

Date: 18 June 08 (Wed), 4pm

Venue: SS2-01-17, TR100

Seminar Abstract: FRESCO is an interdisciplinary project driven by the challenging long-standing problem of optimizing performance of wireless networks under changing operating conditions. A new experimental design called a locating array is introduced to efficiently identify significant factors and low-order interactions of factors when the number of factors is massive.  Profile-driven regression is a new hybrid regression methodology to address the issues in non-linear modelling through the use of profiling. The methodology is applied to derive models from a stochastic simulation of a mobile ad hoc network. Novel self-tuning techniques are developed to decide when and what localized measurements are needed in the network to drive the real-time statistical monitoring, model evolution, and adaptive control to optimize network performance as conditions change.

About the Speaker: Violet R. Syrotiuk earned her Ph.D. in Computer Science from the University of Waterloo (Canada) in 1992. She joined Arizona State University in 2002 and is currently an Associate Professor of Computer Science and Engineering. Dr. Syrotiuk's research has been supported by the U.S. National Science Foundation, Los Alamos National Laboratory,  Defence Science and Technology Organisation (Australia), Architecture Technology Corp., Raytheon Co., and General Dynamics.  She serves on the Editorial Board of Computer Networks and the International Journal of Communication Systems, and on the Technical Program Committee of several major conferences including Mobicom, Mobihoc, and Infocom. Her research interests include medium access control (MAC) and higher layer protocols for multi-hop wireless networks.

Date: 9 June 08, Mon, 10am to 11am 

VENUE : Block N2, Level 4, Section A, Room no. 2

SEMINAR EXTRACT : In recent years, there has been a great deal of interests in research at the boundaries between algorithms, game theory and economics. This is because many important artifacts, such as the Internet and the web, are deeply affected by cooperation and competition among parties with different economic interests, and logarithms and protocols, e.g. for routing, resource allocation and electronic commerce, need to be rethought in light of these economic effects.

We consider one particular effect, externalities (or network effects), that links the value of a good to a consumer to the set of other consumers having that good. We will review recent studies on externalities in different areas (including mechanism design, viral marketing and social networks, online dating systems, and envy-free pricing) in algorithmic game theory, and discuss directions for future study.

ABOUT THE SPEAKER : Ning Chen is a Ph.D. candidate in the department of Computer Science & Engineering at the University of Washington, Seattle. He obtained his B.S and M.S. degree both from Fudan University, Shanghai, 2001 and 2004. His research interests include Algorithmic Game Theory, Computational Economics, and Algorithmic and Economic aspects of the Internet.

Title: Intelligent Transport Systems: Emerging Trends and the IBM Experience

Date: 2 May 2008 (Fri), 3.30 pm

Speaker: Dr Laura Wynter, IBM Watson Research Center, USA.

Venue: NIE Blk 5 Level 1 – TR45

Seminar Abstract:
Traffic congestion is a problem worldwide, resulting from demand exceeding capacity, and will only get worse. Demand can be managed through pricing to a point, but growing cities will still require more capacity. In dense urban areas, traditional construction of new capacity is prohibitively expensive, and often impossible. This has lead to a recent shift in thinking, from hardware-oriented solutions to software integration and technological innovations.

Multimodal, real-time Transport Information Management can deliver more capacity from the existing network, delaying or obviating the need for massive infrastructure investments. Better information can increase customer satisfaction and ridership of public transit systems, effecting modal shift. Technological innovations can make the difference between failing and high-performing transport systems.

We present an overview of the work that IBM is doing in Intelligent Transport Systems and focus on a recent pilot project with the Singapore LTA to use science and innovation to improve traffic management  

Title: A Talk on Set Theory

Date: 25 April 08 (Fri), 1430 - 1730

Speaker: Dr. Noam Greenberg

Venue: NIE Journal room (Block 5, 03-04)

Abstract: Dr. Noam Greenberg is now visiting me, and he will give a 2-3 hours talk on fundamentals of forcing, a powerful tool in modern set theory, which was introduced by Cohen in 1963 to prove that
the Continuum Hypothesis is independent of ZFC, and that the Axiom of Choice is independent of ZF. All of you are welcome to this talk.  

Title: Coset Stabilized Quantum Codes: New quantum codes from Goethals and Preparata codes

Date: 21 April 08 (Mon), 2.00 pm

Lecturer: Markus Grassl (Institute for Quantum Optics and Quantum Information Austrian Academia of Sciences Innsbruck, Austria).

Venue: NIE Blk 5 Level 1 – TR45

Seminar Abstract :
Most of the quantum error-correcting codes (QECCs) are based on the stabilizer formalism which relates quantum codes to certain additive codes over GF(4). However, it is known that non-additive QECCs can have a higher dimension compared to additive QECCs with the same length and minimum distance. The most prominent example is the code
((5,6,2)) of Rains et al. More recently, some improved one-error-correcting codes of length 9 and 10 have been found. All these codes can be described as codeword stabilized (CWS) quantum codes.
The class of CWS QECCs is very rich, it includes e.g. all stabilizer codes. The prize we have to pay for this generality is that with increasing length it is getting more difficult to find good codes.

Based on the classical non-linear binary Goethals and Preparata codes, we obtain a new family of non-additive quantum codes with parameters ((2^m,2^{2^m-5m+1},8)). The dimension of these codes is eight times higher than the dimension of the best known additive quantum codes of equal length and minimum distance.

Title: Sequences with good correlation properties

Date: 2 Apr 08 (Wed), 5.15pm-6.15pm

Speaker: Professor K.T. Arasu Wright State University)

Venue: NIE Journal Room (NIE5-03-04)

Title: Stream ciphers, and the distinguishing attacks

Date: 1 Apr 08 (Tues), 1030 – 1130 am

Speaker: Dr. Lu Yi

Venue: NIE Journal Room

For more information, click here   

Title: Mean Values of Cubic Character Sums

Venue: NIE Blk 5 Level 1 – TR45

Date: 20 Mar 08 (Thurs), 1430 to 1530

Speaker:
Dr. Stephan Baier completed his Ph.D. at the Free University in Berlin, Germany. He has held postdoctoral position in Harish-Chandra Research Institute, the University of Cambridge and Queen’s University in Canada. His research area is in analytic number theory. Currently, he is working as a lecturer in Jacobs University in Bremen.

Seminar:
This is joint work with Matthew Young. Our main result is the following: There exist infinitely many primitive Dirichlet characters $\chi$ of order 3 such that $L(s,\chi)$ does not vanish at the central point, i.e. $L(1/2,\chi)\not=0$. More precisely, the number of such characters with conductor $\le Q$ is $\gg Q^{4/5}$. This result will be deduced from a new asymptotic estimate for the average of $L(1/2,\chi)$ and a new bound for the first moment of $L(1/2,\chi)$ for cubic characters $\chi$. As tools we use the approximate functional equation and certain recursive estimates on cubic character sums.

Title: Amalgams and representations

Date: Date: 18 Mar 08, 1615 

Venue: NIE Journal Room (NIE, blk. 5 lev. 3)

Speaker: Prof. A.A.Ivanov, Imperial College (London)

Title: Non Vanishing of L functions

Date: 14 Mar 08, 1000am-1130am 

Venue: NIE Blk 7 Level 1 – TR53

Speaker:
Jeff Hoffstein does research in number theory, automorphic forms and multiple Dirichlet series. In 1996 he, Jill Pipher, Joe Silverman created the NTRU public key cryptosystem and founded the company NTRU.

Abstract :
It is well known that given an elliptic curve, whose L-series has a positive sign in its functional equation, there must exist a quadratic twist of the L-series that does not vanish at the center of the critical strip. Suppose one is given two such elliptic curves. Must there exist a quadratic twist such that both L-series simultaneously do not vanish at the center of the critical strip? I'll show that the answer to this question is yes.

Title : Public Key Crypto Systems and NTRU

Date: 12 Mar 08, 1000 – 1130am 

Venue: NIE Blk 7 Level 1 – TR53

Speaker:
Jeff Hoffstein does research in number theory, automorphic forms and multiple Dirichlet series. In 1996 he, Jill Pipher, Joe Silverman created the NTRU public key cryptosystem and founded the company NTRU.

Abstract :
I'll describe a public key cryptosystem called NTRU. Depending on how one wants to look at it, NTRU is based on convolution rings of polynomials, or on lattices over the integers. It differs from other public key cryptosystems in that the fundamental hard problem it is based on is the difficulty of finding short vectors in lattices of high dimension. It is not based on integer factorization, as in RSA, or the discrete logarithm problem, as in Diffie-Hellman and elliptic curve based cryptosystems. As a result, it is considerably faster and more efficient, and better suited for low powered devices such as cell phones. I will assume no previous knowledge of cryptography or lattices, and the lecture should be entirely self contained.

Title: 25 years of quantum groups: from definition to classification

Date: 7 Mar 08, 1030 – 1130am 

Venue: NIE Block 5, Level 1 (NIE5-01-TR45)

Speaker: Alexander Stolin from Chalmers Uni., Sweden

Abstract: Quantum groups appeared aproximately 25 years ago as a tool
to solve the so-called Yang-Baxter equation. They appeared in form of basic examples and these examples wererelated to simple complex finite dimensional Lie algebras, polynomial Lie algebras, and loop algebras

In the talk I will explain the notion of quantum group and its classical limit, Lie bialgebra.Surprisingly, it turned out to be possible to classify quantum groups,which have  simple complex finite dimensional Lie algebras and
polynomial Lie algebras as the classical limit. 

Date: Mon, 3 Mar 08, 1800 – 1900pm 

Venue: NIE Journal Room

Speaker: Professor Igor Shparlinski

Abstract: We present some theoretic and heuristic estimates for the number of elliptic curves with low embedding which is essential for their applicability in pairing based cryptography. We also give estimates for the number of fields over which such curves may exist. The main ideas behind the proofs will be explained as well. Finally, we give a heuristic analysis of the so-called MNT algorithm and show that it produces a rather "thin" sequence of curves.

About the Speaker: Professor Igor Shparlinski
from Macquarie University, Australia
Website: http://www.comp.mq.edu.au/~igor/

Title: Feebly trapdoor functions

Date: 01 Feb 2008, Friday, 1600 - 1700 

Venue:  NIE5-01-TR44

Speaker: Edward A. Hirsch; S.I.Nikolenko

Abstract: One-way functions are the basic primitive of private-key cryptography. However, no provably one-way functions (the ones that can be computed more than polynomially faster than inverted) are known. A natural question is to construct a function that would be at least a little bit (provably!) harder to compute than to invert (call it feebly secure one-way function). Alain Hiltgen (1992) answered this question affirmatively by constructing a function that can be computed by n+O(1)-size circuits but can be inverted only by 2n-size circuits. However, similar constructions of other cryptographic primitives remained unknown.

Trapdoor functions are the basic primitive of public-key cryptography. In this work we construct a family of feebly secure trapdoor functions. This is joint work with Sergey Nikolenko.

About the speaker: Dr. Edward Hirsch is a staff member of the Steklov Institute of Mathematics at St. Petersburg, his research concerns computational complexity and proof theory. More information, including recent publications etc, can be found on his homepage: http://logic.pdmi.ras.ru/~hirsch/

Title: Fast family of Stream Ciphers: TPY

Date: 15-Jan-2008 (Tuesday) 11:00 – 12:00

Venue: NIE Journal Room, NIE5-03-04

Speaker: Prof Jennifer Seberry, University of Wollongong, Australia

Abstract: We use software rolling arrays to make a new very fast stream cipher family. This is joint work with Eli Biham

About the speaker: Dr Seberry graduated PhD in Computation Mathematics from La Trobe University in 1971. She has subsequently held positions at the Australian National University, The University of Sydney and University College, The Australian Defence Force Academy, The University of New South Wales. She has published extensively in Discrete Mathematics and is world renown for her new disco