http://robert.rolland.acrypta.com

On y décrit le code détecteur d'erreurs (très indigent) utilisé dans cette numérotation. Dommage que le très beau code détecteur, basé sur le groupe diédral d'ordre 10 et qui était sur les Deutche Marks n'ait pas été utilisé.

"We are very pleased to announce a new record for the computation of discrete logarithms in finite fields. In particular, we were able to compute discrete logarithms in the field GF(2^6120) in only 749.5 core-hours. As far as we are aware, the previous record for discrete logarithms in binary fields was in GF(2^4080) (ndldr : celui d'Antoine Joux dont on a parlé précédemment).

This computation was performed using a hybrid index calculus algorithm, combining our polynomial time relation generation method for degree 1 elements of the extension GF(2^6120) / GF(2^24), an enhanced variant of our polynomial time degree 2 elimination method from the same paper, an analogue of Joux's elimination method for other small degrees, and a variant of classical descent for all higher degrees."

On peut voir l'annonce ici.

Ces auteurs avaient établi précédemment un record de 1971 bits (voir l'article ici).

"We are pleased to announce a new record for the computation of
discrete logarithms in finite fields. We were able to compute discrete
logarithms in GF(2^4080) using about 14100 CPU.hours. This
computation was performed using the same index calculus algorithm as
in our recent computation [Jo13]. A draft describing the algorithm is
available as [Jo13a]."

[Jo13a]  A new index calculus algorithm with complexity L(1/4+o(1)) in very small characteristic. Eprint Archive. http://eprint.iacr.org/2013/095

27 au 31 Mai 2013 au village IGESA sur l'île de Porquerolles.

Le but est de rapprocher la recherche académique en cryptographie et systèmes communicants sécurisés et l'industrie de la carte à puce et des applications utilisatrices de la cryptographie, afin de mieux connaître les avancées actuelles du domaine et l'évolution des applications et systèmes critiques.

Le site du colloque est ici.

"The National Institute of Standards and Technology (NIST) is pleased to announce the selection of Keccak as the winner of the SHA-3 Cryptographic Hash Algorithm Competition and the new SHA-3 hash algorithm.  Keccak was designed by a team of cryptographers from Belgium and Italy, they are:

• Guido Bertoni (Italy) of STMicroelectronics,
• Joan Daemen (Belgium) of STMicroelectronics,
• Michaël Peeters (Belgium) of NXP Semiconductors, and
• Gilles Van Assche (Belgium) of STMicroelectronics."

"NIST chose Keccak over the four other excellent finalists for its elegant design, large security margin, good general performance, excellent efficiency in hardware implementations, and for its flexibility.  Keccak uses a new “sponge construction” chaining mode, based on a fixed permutation, that can readily be adjusted to trade generic security strength for throughput, and can generate larger or smaller hash outputs as required.  The Keccak designers have also defined a modified chaining mode for Keccak that provides authenticated encryption."

L'introduction de la notion de "sponge function" est un apport important.

Voici le premier appel à Communication :

************ WE APOLOGIZE FOR MULTIPLE COPIES ******************

Preliminary Call for Papers

5rd International Conference on Algebraic Informatics (CAI 2013)
http://iml.univ-mrs.fr/ati/conferences/CAI2013
September 3 - 6, 2013
Porquerolles Island
Aix-Marseille University, France


CAI 2013 will include a highly selective single-track program for papers
describing original and unpublished research advancing the state of the art in the field.

Authors  are invited to submit papers (in PDF format) presenting
original research work, electronically to

cai2013@acrypta.fr

All submissions should be formatted according to the usual LNCS article style
(http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0)
and should not exceed 12 pages.  Simultaneous submissions to other
conferences with published proceedings is not allowed.

IMPORTANT DATES:
Submission Due:                            1 March 2013
Notification:                                   25 April 2013
Proceedings Version Due:              14 May 2013

PROCEEDINGS:
The Proceedings of CAI 2013 will be published in the
Lecture Notes in Computer Science Series (LNCS) by Springer.

Authors of accepted papers will be invited to provide a final version of their paper
formatted with the llncs.cls class file
(http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).

TOPICS:
(including but not limited to the following topics of interest):
algebraic specifications and algorithms,
algebraic coding theory,
algebraic aspects of cryptography,
Computational Number Theory,
formal power series, 
algebraic semantics,
finite and infinite computations, 
algebraic characterization of logical theories,
process algebra,
program construction and refinements,
acceptors and transducers for discrete structures, 
decision problems,
term rewriting,
abstract machines or systems,
hybrid Automata composition.

Papers describing original R&D solutions in the field  are also welcome.