CGC Bulletin 17
CONTENTS
- SCC 2008: First International Conference on Symbolic Computation and Cryptography (Call for Papers)
- Unprovability results involving braids
- The uneasy relationship between mathematics and cryptography
- Interpretation of the Arithmetic in certain groups of piece-wise affine permutations of an interval
Message from the editor:
Dear Friends, on behalf of the Program Committee, I am glad to invite you to submit papers and participate in the coming SCC2008 conference. Details in Item 1 below.
Have a good 2008,
Boaz Tsaban
Bulletin's webpage: http://www.cs.biu.ac.il/~tsaban/CGC/cgc.html
1. SCC 2008: First International Conference on Symbolic Computation and Cryptography (Call for Papers)
Beijing, China, April 28-30, 2008.
SCC 2008 is the first of a new series of conferences where research and development in symbolic computation and cryptography may be presented and discussed. It is organized in response to the growing interest in applying and developing methods, techniques, and software tools of symbolic computation for cryptography. The use of lattice reduction algorithms in cryptology and the application of Groebner bases in the context of algebraic attacks are typical examples of explored applications.
SCC 2008 aims at providing an interactive forum for interested researchers to exchange ideas and views, to present research results and progress, and to learn and discuss recent developments and emerging problems on
- the design, modeling, and analysis of cryptographic systems and protocols for which symbolic computation may be used or needed, and
- the design, implementation, and analysis of algorithms and software tools of symbolic computation that may have potential applications in cryptography.
TOPICS
Specific topics for SCC 2008 include, but are not limited to:
- Multivariate cryptography, braid group cryptography, noncommutative cryptography, and quantum cryptography
- Code-based, factorization-based, and lattice-based cryptography
- Algebraic attacks for block ciphers, stream ciphers, and hash functions
- Design and analysis of algebraic, elliptic, and embedded cryptographic systems and protocols
- Groebner basis techniques in cryptology, algebraic number theory, and coding theory
- Triangular sets and new techniques for solving algebraic systems over finite fields
- Algorithms and software for symbolic computation in cryptography
INVITED SPEAKERS
- Bruno Buchberger (Johannes Kepler Universitaet Linz, Austria)
- Arjen K. Lenstra (Ecole Polytechnique Federale de Lausanne, Switzerland) (to be confirmed)
- Adi Shamir (Weizmann Institute of Science, Israel)
- Xiaoyun Wang (Tsinghua University and Shandong University, China)
SUBMISSION
Potential participants of SCC 2008 are invited to submit extended abstracts of 3-5 pages or full papers describing their work to be presented at the conference. The submitted extended abstracts and full papers will be reviewed by members of the program committee (PC) for soundness and relevance to the conference. Submission of original research papers is encouraged, while published material and work in progress will also be considered for presentation at the conference. Extended abstracts and full papers should be prepared using LaTeX with the style file available on the SCC 2008 webpage and according to the instructions given therein. Submissions must be done electronically via EasyChair at http://www.easychair.org/conferences/?conf=scc2008 or sent in PDF or PS format as e-mail attachments to scc2008 @ cc4cm.org.
Accepted extended abstracts and full papers will be printed in the proceedings of SCC 2008 for distribution at the conference.
PUBLICATION
Authors of the extended abstracts and full papers accepted for presentation at the conference will be invited to submit their full and/or revised papers for publication in special issues of Mathematics in Computer Science (MCS - http://www.cc4cm.org/mcs) by Birkhauser/Springer after the meeting. The submitted papers will be formally reviewed by PC members and external referees according to the standard refereeing procedure of MCS.
IMPORTANT DATES
Deadline for extended abstract submission: February 17, 2008
Notification of acceptance or rejection: March 16, 2008
Conference taking place: April 28-30, 2008
Deadline for full paper submission: June 30, 2008
GENERAL CHAIR
- Zhiming Zheng (China)
PROGRAM COMMITTEE
- Anne Canteaut (France)
- Jintai Ding (USA)
- Jean-Charles Faugere, Co-chair (France)
- Joachim von zur Gathen (Germany)
- Pierrick Gaudry (France)
- Jaime Gutierrez (Spain)
- Hoon Hong (USA)
- Antoine Joux (France)
- Martin Kreuzer (Germany)
- Dongdai Lin (China)
- Zhuojun Liu (China)
- Alexander May (Germany)
- Ludovic Perret (France)
- Igor Shparlinski (Australia)
- Rainer Steinwandt (USA)
- Boaz Tsaban (Israel)
- Dongming Wang, Co-chair (China/France)
LOCAL ARRANGEMENTS
- Shangzhi Li, Chair (China)
- Jinxi Ma (China)
- Chenqi Mou (China)
2. Unprovability results involving braids
Lorenzo Carlucci, Patrick Dehornoy, Andreas Weiermann
We construct long sequences of braids that are descending with respect to the standard order of braids (``Dehornoy order''), and we deduce that, contrary to all usual algebraic properties of braids, certain simple combinatorial statements involving the braid order are true, but not provable in the subsystems ISigma1 or ISigma2 of the standard Peano system.
http://arxiv.org/abs/0711.3785
3. The uneasy relationship between mathematics and cryptography
Neal Koblitz
See
http://www.ams.org/notices/200708/tx070800972p.pdf
and then
http://www.ams.org/notices/200711/tx071101454p.pdf
4. Interpretation of the Arithmetic in certain groups of piece-wise affine permutations of an interval
Tuna Altinel and Alexey Muranov
The Arithmetic is interpreted in all the groups of Richard Thompson and Graham Higman, as well as in other groups of piecewise affine permutations of an interval which generalize the groups of Thompson and Higman. In particular, the elementary theories of all these groups are undecidable. Moreover, the group F of Thompson and some of its generalizations interpret the Arithmetic without parameters.
http://arxiv.org/abs/0711.3832
(Unfortunately, this article is inaccessible to most of the mathematical community: It is written in French.)
---
END OF ISSUE
