GROUPS COMPLEXITY CRYPTOLOGY MANAGING EDITORS Vladimir Shpilrain, New York Pascal Weil, Bordeaux EDITORIAL BOARD Simon R. Blackburn, London Marston Conder, Auckland Patrick Dehornoy, Caen Bettina Eick, Braunschweig Ben Fine, Fairfield Robert Gilman, Hoboken Dima Grigoriev, Lille Ki Hyoung Ko, Daejeon Martin Kreuzer, Passau Alexander V. Mikhalev, Moscow Alexei Myasnikov, Hoboken Vitalii Romankov, Omsk Gerhard Rosenberger, Hamburg Mark Sapir, Nashville Sven Schäge, Bochum Rick Thomas, Leicester Boaz Tsaban, Ramat Gan Enric Ventura Capell, Barcelona Unauthenticated Download Date | 11/15/16 3:03 PM GROUPS – COMPLEXITY – CRYPTOLOGY is a journal for speedy publication of articles in the areas of combinatorial and computational group theory, complexity theory, and cryptology. Preference is given to papers that touch upon at least two of these areas, but strong papers representing just one of the areas are considered, too. The journal primarily publishes research papers, but comprehensive and timely survey articles on a topic inside the scope of the journal are also welcome. All submitted papers are peerreviewed before publication. All information regarding notes for contributors, subscriptions, Open access and orders is available online at www.degruyter.com/gcc. ABSTRACTED/INDEXED IN Celdes • CNKI Scholar (China National Knowledge Infrastructure) • CNPIEC • DBLP Computer Science Bibliography • EBSCO - TOC Premier • EBSCO Discovery Service • Elsevier - SCOPUS • Google Scholar • J-Gate • Mathematical Reviews (MathSciNet) • Naviga (Softweco) • Primo Central (ExLibris) • SCImago (SJR) • Summon (Serials Solutions/ProQuest) • TDOne (TDNet) • Ulrich's Periodicals Directory/ulrichsweb • WorldCat (OCLC) • Zentralblatt Math ISSN 1867-1144 · e-ISSN 1869-6104 · CODEN GCCRC9 RESPONSIBLE EDITORS Vladimir Shpilrain, Department of Mathematics, The City College of New York, New York, NY 10031, USA. Email: [email protected] Pascal Weil, Laboratoire Bordelais de Recherche en Informatique, Université Bordeaux I, 33405 Talence-Bordeaux, France. Email: [email protected] JOURNAL MANAGER Theresa Haney, De Gruyter, Genthiner Straße 13, 10785 Berlin, Germany. Tel.: +49 (0)30 260 05-375, Fax: +49 (0)30 260 05-250 Email: [email protected] RESPONSIBLE FOR ADVERTISEMENTS Claudia Neumann, De Gruyter, Genthiner Straße 13, 10785 Berlin, Germany. Tel.: +49 (0)30 260 05-226, Fax: +49 (0)30 260 05-264 Email: [email protected] © 2016 Walter de Gruyter GmbH, Berlin/Boston TYPESETTING Dimler & Albroscheit, Müncheberg PRINTING Franz X. Stückle Druck und Verlag e.K., Ettenheim Printed in Germany Offenlegung der Inhaber und Beteiligungsverhältnisse gem. § 7a Abs. 1 Ziff. 1, Abs. 2 Ziff. 3 des Berliner Pressegesetzes: Die Gesellschafter der Walter de Gruyter GmbH sind: Clara Cram Stiftung, Berlin; Cram, Gisela, Rentnerin, Berlin; Cram, Dr. Georg-Martin, Unternehmens-Systemberater, Stadtbergen; Cram, Maike, Berlin; Cram, Jens, Mannheim; Cram-Heydrich, Ingrid, Betriebsleiterin, Tuxpan / Michoacan (Mexiko); Cram-Heydrich, Sabina, Mexico DF (Mexiko); Cram, Silke, Wissenschaftlerin, Mexico DF (Mexiko); Cram, Björn, Aachen; Cram, Ella Anita, Rentnerin, Berlin; Cram, Berit, Greifswald; Cram-Gomez, Susanne, Mexico DF (Mexiko); Cram-Heydrich, Walter, Mexico DF (Mexico); Cram-Heydrich, Kurt, Angestellter, Mexico DF (Mexico); Duvenbeck, Brigitta, Oberstudienrätin i.R., Bad Homburg; Gädeke, Gudula, M.A., Atemtherapeutin/Lehrerin, Tübingen; Gädeke, Martin, Einzelunternehmer, Würzburg; Lubasch, Dr. Annette, Ärztin, Berlin; Schütz, Dr. Christa, Ärztin, Mannheim; Schütz, Sonja, Berlin; Schütz, Juliane, Berlin; Schütz, Antje, Berlin; Schütz, Valentin, Berlin; Seils, Dorothee, Apothekerin, Stuttgart; Seils, Gabriele, Journalistin, Berlin; Seils, Dr. Clara-Eugenie, Oberstudienrätin i.R., Reppenstedt; Seils, Christoph, Journalist, Berlin; Siebert, John-Walter, Pfarrer, Oberstenfeld; Walter de Gruyter Stiftung, Berlin. Unauthenticated Download Date | 11/15/16 3:03 PM Groups Complexity Cryptology | 2016 | Volume 8 | Issue 1 Contents Iris Anshel, Derek Atkins, Dorian Goldfeld, Paul E. Gunnells A class of hash functions based on the algebraic 1 eraser™ Omar Akchiche, Omar Khadir Factoring multi-power RSA moduli with primes sharing 47 least or most significant bits Emmanuel Fouotsa, Abdoul Aziz Ciss Faster Ate pairing computation on Selmer’s model of elliptic curves 55 Gennady A. Noskov, Alexander N. Rybalov Generic case complexity of the Graph Isomorphism Problem 9 Murray Elder, Jennifer Taback Thompson’s group F is 1-counter graph automatic 21 Bettina Eick The automorphism group of a finitely generated virtually abelian group 35 Kenneth R. Blaney, Andrey Nikolaev A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups 69 Sylvain Duquesne, Loubna Ghammam Memory-saving computation of the pairing final exponentiation on BN curves 75 Unauthenticated Download Date | 11/15/16 3:03 PM Unauthenticated Download Date | 11/15/16 3:03 PM
© Copyright 2024 ExpyDoc