Last update: Fri Apr 19 09:23:36 MDT 2024
Volume 1, Number 1, 2007Tanja Lange and Igor E. Shparlinski Distribution of some sequences of points on elliptic curves . . . . . . . . . . . 1--11 Keith Martin and Siaw-Lynn Ng The combinatorics of generalised cumulative arrays . . . . . . . . . . . 13--32 D. R. Stinson and R. Wei Some results on query processes and reconstruction functions for unconditionally secure $2$-server $1$-round binary private information retrieval protocols . . . . . . . . . . 33--46 Alfred Menezes Another look at HMQV . . . . . . . . . . 47--64 Yuan Li and T. W. Cusick Strict avalanche criterion over finite fields . . . . . . . . . . . . . . . . . 65--78 Tomohiro Harayama and Donald K. Friesen Weil sum for birthday attack in multivariate quadratic cryptosystem . . 79--104
Robert D. Silverman Optimal parameterization of SNFS . . . . 105--124 Robert A. Walker II and Charles J. Colbourn Perfect Hash families: constructions and existence . . . . . . . . . . . . . . . 125--150 D. Engelbert and R. Overbeck and A. Schmidt A summary of McEliece-type cryptosystems and their security . . . . . . . . . . . 151--199
D. R. Stinson and J. Wu An efficient and secure two-flow zero-knowledge identification protocol 201--220 Joan Daemen and Vincent Rijmen Probability distributions of correlation and differentials in block ciphers . . . 221--242 P. Gaudry Fast genus $2$ arithmetic based on theta functions . . . . . . . . . . . . . . . 243--265 Steven D. Galbraith and Colm Ó hÉigeartaigh and Caroline Sheedy Simplified pairing computation and security implications . . . . . . . . . 267--281 Hassan Aly and Wilfried Meidl and Arne Winterhof On the $k$-error linear complexity of cyclotomic sequences . . . . . . . . . . 283--296
Clemens Heuberger and James A. Muir Minimal weight and colexicographically minimal integer representations . . . . 297--328 Ian F. Blake and Igor E. Shparlinski Statistical distribution and collisions of VSH . . . . . . . . . . . . . . . . . 329--349 Su-Jeong Choi and Simon R. Blackburn and Peter R. Wild Cryptanalysis of a homomorphic public-key cryptosystem over a finite group . . . . . . . . . . . . . . . . . 351--358 Dima Ruinskiy and Adi Shamir and Boaz Tsaban Length-based cryptanalysis: the case of Thompson's group . . . . . . . . . . . . 359--372 Sarang Aravamuthan and Sachin Lodha The average transmission overhead for broadcast encryption . . . . . . . . . . 373--384 Neal Koblitz Another look at automated theorem-proving . . . . . . . . . . . . 385--403
David J. Mireles Morales An attack on disguised elliptic curves 1--8 Ryoh Fuji-Hara and Xiyang Li and Ying Miao and Dianhua Wu A TWOOA construction for multi-receiver multi-message authentication codes . . . 9--28 Alexei G. Myasnikov and Alexander Ushakov Random subgroups and analysis of the length-based and quotient attacks . . . 29--61 S. Murphy and M. B. Paterson A geometric view of cryptographic equation solving . . . . . . . . . . . . 63--107
Jonathan Longrigg and Alexander Ushakov Cryptanalysis of the shifted conjugacy authentication protocol . . . . . . . . 109--116 M. Jason Hinek On the security of multi-prime RSA . . . 117--147 Mridul Nandi and Avradip Mandal Improved security analysis of PMAC . . . 149--162 Cevahir Demirkiran and Enric Nart Counting hyperelliptic curves that admit a Koblitz model . . . . . . . . . . . . 163--179 Phong Q. Nguyen and Thomas Vidick Sieve algorithms for the shortest vector problem are practical . . . . . . . . . 181--207
Sz. L. Fancsali and P. Ligeti Some applications of finite geometry for secure network coding . . . . . . . . . 209--225 R. Avanzi and N. Thériault and Z. Wang Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ . . . . . . . . . . . . 227--255 Riddhipratim Basu and Shirshendu Ganguly and Subhamoy Maitra and Goutam Paul A complete characterization of the evolution of RC4 pseudo random generation algorithm . . . . . . . . . . 257--289 Werner Schindler Advanced stochastic methods in side channel analysis on block ciphers in the presence of masking . . . . . . . . . . 291--310
Neal Koblitz and Alfred Menezes Another look at non-standard discrete log and Diffie--Hellman problems . . . . 311--326 Rupert J. Hartung and Claus-Peter Schnorr Identification and signatures based on NP-hard problems of indefinite quadratic forms . . . . . . . . . . . . . . . . . 327--341 Thilo Mie Polylogarithmic two-round argument systems . . . . . . . . . . . . . . . . 343--363 Christiane Frougny and Wolfgang Steiner Minimal weight expansions in Pisot bases 365--392 M. B. Paterson and D. R. Stinson Two attacks on a sensor network key distribution scheme of Cheng and Agrawal 393--403
Steven D. Galbraith and Jordi Pujol\`as and Christophe Ritzenthaler and Benjamin Smith Distortion maps for supersingular genus two curves . . . . . . . . . . . . . . . 1--18 Laura Hitt Families of genus $2$ curves with small embedding degree . . . . . . . . . . . . 19--36 Ian F. Blake and Vladimir Kolesnikov One-round secure comparison of integers 37--68 Gregory Neven and Nigel P. Smart and Bogdan Warinschi Hash function requirements for Schnorr signatures . . . . . . . . . . . . . . . 69--87
Amitabh Saxena and Ben Soh A cryptographic primitive based on hidden-order groups . . . . . . . . . . 89--132 Mridul Nandi Improved security analysis for OMAC as a pseudorandom function . . . . . . . . . 133--148 Joachim von zur Gathen and Igor E. Shparlinski Subset sum pseudorandom numbers: fast generation and distribution . . . . . . 149--163 M. Jason Hinek and Charles C. Y. Lam Another look at some fast modular arithmetic methods . . . . . . . . . . . 165--174
Jaime Gutierrez Foreword: Second Workshop on Mathematical Cryptology . . . . . . . . 175--176 Luk Bettale and Jean-Charles Faug\`ere and Ludovic Perret Hybrid approach for solving multivariate systems over finite fields . . . . . . . 177--197 Simon R. Blackburn Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem . . . . . . . . . . . 199--203 Gérald Bourgeois and Jean-Charles Faug\`ere Algebraic attack on NTRU using Witt vectors and Gröbner bases . . . . . . . . 205--214 Nina Brandstätter and Arne Winterhof $k$-error linear complexity over $ \mathbb {F_p}$ of subsequences of Sidelnikov sequences of period $ (p^r - 1) / 3$ . . . . . . . . . . . . . . . . 215--225 Simon Fischer and Willi Meier and Dirk Stegemann Some remarks on FCSRs and implications for stream ciphers . . . . . . . . . . . 227--236 István Gaál and Michael E. Pohst On solving norm equations in global function fields . . . . . . . . . . . . 237--248 Mario Lamberger and Tomislav Nad and Vincent Rijmen Numerical solvers and cryptanalysis . . 249--263 John B. Friedlander and Igor E. Shparlinski On the density of some special primes 265--271
Thomas W. Cusick and Yuan Li and Pantelimon St\uanic\ua On a conjecture for balanced symmetric Boolean functions . . . . . . . . . . . 273--290 Charles J. Colbourn and Alan C. H. Ling A recursive construction for perfect hash families . . . . . . . . . . . . . 291--306 Gebhard Böckle The Miller--Rabin test with randomized exponents . . . . . . . . . . . . . . . 307--319 Simon R. Blackburn and Carlos Cid and Ciaran Mullan Cryptanalysis of the $ {\rm MST}_3 $ public key cryptosystem . . . . . . . . 321--338 J. Wu and D. R. Stinson An efficient identification protocol secure against concurrent-reset attacks 339--352 Reza R. Farashahi and Igor E. Shparlinski and José Felipe Voloch On hashing into elliptic curves . . . . 353--360
Koray Karabina Factor-$4$ and $6$ compression of cyclotomic subgroups of $ \mathbb {F^*_{2^{4m}}} $ and $ \mathbb {F^*_{3^{6m}}} $ . . . . . . . . . . . . 1--42 Farbod Shokrieh The monodromy pairing and discrete logarithm on the Jacobian of finite graphs . . . . . . . . . . . . . . . . . 43--56 M. Jason Hinek and Charles C. Y. Lam Common modulus attacks on small private exponent RSA and some fast variants (in practice) . . . . . . . . . . . . . . . 57--93
Jaume Mart\'ì-Farré and Carles Padró On secret sharing schemes, matroids and polymatroids . . . . . . . . . . . . . . 95--120 Basel Alomair and Andrew Clark and Radha Poovendran The power of primes: security of authentication based on a universal hash-function family . . . . . . . . . . 121--148 Natalia Mosina and Alexander Ushakov Mean-set attack: cryptanalysis of Sibert et al. authentication protocol . . . . . 149--174 Koray Karabina and Alfred Menezes and Carl Pomerance and Igor E. Shparlinski On the asymptotic effectiveness of Weil descent attacks . . . . . . . . . . . . 175--191 Simon R. Blackburn The discrete logarithm problem modulo one: cryptanalysing the Ariffin--Abu cryptosystem . . . . . . . . . . . . . . 193--198
Keisuke Hakuta and Hisayoshi Sato and Tsuyoshi Takagi Efficient arithmetic on subfield elliptic curves over small finite fields of odd characteristic . . . . . . . . . 199--238 Juha Kortelainen and Kimmo Halunen and Tuomas Kortelainen Multicollision attacks and generalized iterated hash functions . . . . . . . . 239--270 Pavol Svaba and Tran van Trung Public key cryptosystem $ \rm M S T_3 $: cryptanalysis and realization . . . . . 271--315
Elmar Tischhauser Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY 317--348 Rajesh P. Singh and A. Saikia and B. K. Sarma Poly-dragon: an efficient multivariate public key cryptosystem . . . . . . . . 349--364 Ciaran Mullan Cryptanalysing variants of Stickel's key agreement scheme . . . . . . . . . . . . 365--373 Christopher Wolf and Bart Preneel Equivalent keys in $ \mathscr {M} $ultivariate $ \mathscr {Q} $uadratic public key systems . . . . . . . . . . . 375--415
Huseyin Hisil and Kenneth Koon-Ho Wong and Gary Carter and Ed Dawson An exploration of affine group laws for elliptic curves . . . . . . . . . . . . 1--50 Sylvain Duquesne RNS arithmetic in $ \mathbb {F_{p^k}} $ and application to fast pairing computation . . . . . . . . . . . . . . 51--88 Mathieu Ciet and Jean-Jacques Quisquater and Francesco Sica Compact elliptic curve representations 89--100
Gaetan Bisson Computing endomorphism rings of elliptic curves under the GRH . . . . . . . . . . 101--113 Nuttapong Attrapadung and Beno\^ìt Libert Functional encryption for public-attribute inner products: achieving constant-size ciphertexts with adaptive security or support for negation . . . . . . . . . . . . . . . . 115--158 Simon R. Blackburn and Carlos Cid and Ciaran Mullan Cryptanalysis of three matrix-based key establishment protocols . . . . . . . . 159--168 Marc Fischlin and Dominique Schröder Security of blind signatures under aborts and applications to adaptive oblivious transfer . . . . . . . . . . . 169--203
Neal Koblitz Another look at automated theorem-proving II . . . . . . . . . . . 205--224 Dustin Moody and Hongfeng Wu Families of elliptic curves with rational $3$-torsion . . . . . . . . . . 225--246 Charles Bouillaguet and Pierre-Alain Fouque and Antoine Joux and Joana Treger A family of weak keys in HFE and the corresponding practical key-recovery . . 247--275 Yeow Meng Chee and Huaxiong Wang and Liang Feng Zhang On the Bringer--Chabanne EPIR protocol for polynomial evaluation . . . . . . . 277--301
Robert P. Gallant Finding discrete logarithms with a set orbit distinguisher . . . . . . . . . . 1--20 Barbara Baumeister and Jan-Hendrik de Wiljes Aperiodic logarithmic signatures . . . . 21--37 Tzer-jen Wei and Lih-Chung Wang A fast mental poker protocol . . . . . . 39--68 Gérard Maze Analysis of a key distribution scheme in secure multicasting . . . . . . . . . . 69--80
John Boxall Heuristics on pairing-friendly elliptic curves . . . . . . . . . . . . . . . . . 81--104 Alyssa Brown and Thomas W. Cusick Recursive weights for some Boolean functions . . . . . . . . . . . . . . . 105--135 Sean Murphy The effectiveness of the linear hull effect . . . . . . . . . . . . . . . . . 137--147 Edoardo Persichetti Compact McEliece keys based on quasi-dyadic Srivastava codes . . . . . 149--169 Matan Banin and Boaz Tsaban The discrete logarithm problem in Bergman's non-representable ring . . . . 171--182
Reza Sepahi and Josef Pieprzyk and Siamak F. Shahandashti and Berry Schoenmakers New security notions and relations for public-key encryption . . . . . . . . . 183--227 Nicky Mouha and Gautham Sekar and Bart Preneel Challenging the increased resistance of regular hash functions against birthday attacks . . . . . . . . . . . . . . . . 229--248 Keiji Okano On the $ \rho $-values of complete families of pairing-friendly elliptic curves . . . . . . . . . . . . . . . . . 249--268
Tamir Tassa and Ayman Jarrous and Yonatan Ben-Ya'akov Oblivious evaluation of multivariate polynomials . . . . . . . . . . . . . . 1--29 Steven D. Galbraith and Chang-An Zhao Self-pairings on hyperelliptic curves 31--42 Jean-Pierre Flori and Sihem Mesnager An efficient characterization of a family of hyper-bent functions with multiple trace terms . . . . . . . . . . 43--68 Tianze Wang and Dongdai Lin A method for counting the number of polynomial equivalence classes . . . . . 69--95
Rebecca E. Field and Brant C. Jones Using carry-truncated addition to analyze add-rotate-xor hash algorithms 97--110 Yanling Chen and Danilo Gligoroski and Svein J. Knapskog On a special class of multivariate quadratic quasigroups (MQQs) . . . . . . 111--141 Motahhareh Gharahi and Massoud Hadian Dehkordi Perfect secret sharing schemes for graph access structures on six participants 143--146 Reiner Staszewski and Tran van Trung Strongly aperiodic logarithmic signatures . . . . . . . . . . . . . . . 147--179
Anonymous Masthead . . . . . . . . . . . . . . . . i--i Spyros S. Magliveras Foreword . . . . . . . . . . . . . . . . 181--182 Maura B. Paterson and Douglas R. Stinson and Jalaj Upadhyay A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage . . . . . . . . . . . 183--216 Otokar Gro\vsek and \vStefan Porubský Coprime solutions to $ a x \equiv b \pmod n $ . . . . . . . . . . . . . . . 217--224 Neal Koblitz and Alfred Menezes Another look at HMAC . . . . . . . . . . 225--251 Mufeed Al Mashrafi and Harry Bartlett and Ed Dawson and Leonie Simpson and Kenneth Koon-Ho Wong Indirect message injection for MAC generation . . . . . . . . . . . . . . . 253--277
Mahabir P. Jhanwar and Reihaneh Safavi-Naini Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure . . . . . . 279--296 Kaoru Kurosawa and Ryo Nojima and Le Trieu Phong New leakage-resilient CCA-secure public key encryption . . . . . . . . . . . . . 297--312 Mohammad Ali Orumiehchiha and Josef Pieprzyk and Ron Steinfeld and Harry Bartlett Security analysis of linearly filtered NLFSRs . . . . . . . . . . . . . . . . . 313--332 Joachim von zur Gathen and Igor E. Shparlinski Generating safe primes . . . . . . . . . 333--365 Pavol Zajac A new method to solve MRHS equation systems and its connection to group factorization . . . . . . . . . . . . . 367--381
Andrew Childs and David Jao and Vladimir Soukharev Constructing elliptic curve isogenies in quantum subexponential time . . . . . . 1--29 Shaoquan Jiang Persistent asymmetric password-based key exchange . . . . . . . . . . . . . . . . 31--70 Joppe W. Bos and Alina Dudeanu and Dimitar Jetchev Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms . . . . . . . . . . 71--92 Steven D. Galbraith and Chang-An Zhao Erratum: Self-pairings on hyperelliptic curves [J. Math.\ Cryptol.\ \bf 7 (2013), 31--42] [MR3101014] . . . . . . 93--93
Alex D. Myasnikov and Alexander Ushakov Cryptanalysis of matrix conjugation schemes . . . . . . . . . . . . . . . . 95--114 Benjamin Justus The distribution of quadratic residues and non-residues in the Goldwasser--Micali type of cryptosystem 115--140 Alexander Dibert and László Csirmaz Infinite secret sharing --- examples . . 141--168 Sami Omar and Houssem Sabri Fast hash functions and convolution product . . . . . . . . . . . . . . . . 169--187 Douglas R. Stinson and Jalaj Upadhyay Is extracting data the same as possessing data? . . . . . . . . . . . . 189--207
Luca De Feo and David Jao and Jérôme Plût Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies . . . . . . . . . . . . . . . 209--247 Claude Carlet and Jean-Luc Danger and Sylvain Guilley and Houssem Maghrebi Leakage squeezing: optimal implementation and security evaluation 249--295 Deepthi Haridas and Sarma Venkataraman and Geeta Varadan Security analysis of modified Rivest scheme . . . . . . . . . . . . . . . . . 297--303 Masaya Yasuda and Kazuhiro Yokoyama and Takeshi Shimoyama and Jun Kogure and Takeshi Koshiba On the exact decryption range for Gentry--Halevi's implementation of fully homomorphic encryption . . . . . . . . . 305--329
Sylvain Duquesne and Nadia El Mrabet and Emmanuel Fouotsa Efficient computation of pairings on Jacobi quartic elliptic curves . . . . . 331--362 Hassan Jameel Asghar and Yvo Desmedt and Josef Pieprzyk and Ron Steinfeld A subexponential construction of graph coloring for multiparty computation . . 363--403 Andrew M. Childs and Gábor Ivanyos Quantum computation of discrete logarithms in semigroups . . . . . . . . 405--416 Min Sha On the non-idealness of cyclotomic families of pairing-friendly elliptic curves . . . . . . . . . . . . . . . . . 417--440
Kisoon Yoon A new method of choosing primitive elements for Brezing--Weng families of pairing-friendly elliptic curves . . . . 1--9 Bilal Alam and Ferruh Özbudak and O\uguz Yayla Classes of weak Dembowski--Ostrom polynomials for multivariate quadratic cryptosystems . . . . . . . . . . . . . 11--22 Rüdiger Sparr and Ralph Wernsdorf The round functions of KASUMI generate the alternating group . . . . . . . . . 23--32 David Garber and Delaram Kahrobaei and Ha T. Lam Length-based attacks in polycyclic groups . . . . . . . . . . . . . . . . . 33--43 Thomas W. Cusick and Younhwan Cheon Theory of $3$-rotation symmetric cubic Boolean functions . . . . . . . . . . . 45--62
Jiageng Chen and Keita Emura and Atsuko Miyaji SKENO: Secret key encryption with non-interactive opening . . . . . . . . 63--74 Boaz Tsaban and Noam Lifshitz Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme . . 75--78 Shlomi Dolev and Juan Garay and Niv Gilboa and Vladimir Kolesnikov and Yelena Yuditsky Towards efficient private distributed computation on unbounded input streams 79--94 Kim Laine and Kristin Lauter Time-memory trade-offs for index calculus in genus $3$ . . . . . . . . . 95--114 Benjamin Justus The distribution of quadratic residues and non-residues in the Goldwasser--Micali type of cryptosystem. II . . . . . . . . . . . . . . . . . . . 115--137
Atul Luykx and Bart Mennink and Bart Preneel and Laura Winnen Two-permutation-based hashing with binary mixing . . . . . . . . . . . . . 139--150 Luigi Accardi and Massimo Regoli On a class of strongly asymmetric PKA algorithms . . . . . . . . . . . . . . . 151--159 Matvei Kotov and Alexander Ushakov Analysis of a certain polycyclic-group-based cryptosystem . . 161--167 Martin R. Albrecht and Rachel Player and Sam Scott On the concrete hardness of learning with errors . . . . . . . . . . . . . . 169--203
Chris Dowden Secure message transmission in the presence of a fully generalised adversary . . . . . . . . . . . . . . . 205--214 Maura B. Paterson and Douglas R. Stinson Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs . . . . . . . . . . 215--225 Ali Hameed and Arkadii Slinko A characterisation of ideal weighted secret sharing schemes . . . . . . . . . 227--244 Kevin J. Henry and Douglas R. Stinson Linear approaches to resilient aggregation in sensor networks . . . . . 245--272
Claude Carlet and David Joyner and Pantelimon St\uanic\ua and Deng Tang Cryptographic properties of monotone Boolean functions . . . . . . . . . . . 1--14 Giulia Bianco and Elisa Gorla Compression for trace zero points on twisted Edwards curves . . . . . . . . . 15--34 Colleen M. Swanson and Douglas R. Stinson Unconditionally secure signature schemes revisited . . . . . . . . . . . . . . . 35--67
Subhabrata Samajder and Palash Sarkar Another look at normal approximations in cryptanalysis . . . . . . . . . . . . . 69--99 Dustin Moody and Souradyuti Paul and Daniel Smith-Tone Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier . . . . . . . . . . . . . . . . 101--133 Dimitrios Poulakis New lattice attacks on DSA schemes . . . 135--144
Thomas W. Cusick and K. V. Lakshmy and M. Sethumadhavan Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach . . . . . . . . . . . . 145--156 Ashwin Jha and Mridul Nandi Revisiting structure graphs: applications to CBC--MAC and EMAC . . . 157--180 Mridul Nandi and Tapas Pandit On the security of joint signature and encryption revisited . . . . . . . . . . 181--221
Masaya Yasuda and Kazuhiro Yokoyama and Takeshi Shimoyama and Jun Kogure and Takeshi Koshiba Analysis of decreasing squared-sum of Gram--Schmidt lengths for short lattice vectors . . . . . . . . . . . . . . . . 1--24 Massoud Hadian Dehkordi and Ali Safi The complexity of the connected graph access structure on seven participants 25--35 Serguei Popov On a decentralized trustless pseudo-random number generation algorithm . . . . . . . . . . . . . . . 37--43 Eugen Antal and Otokar Gro\vsek and Peter Horak On a mnemonic construction of permutations . . . . . . . . . . . . . . 45--53
Anonymous Frontmatter . . . . . . . . . . . . . . i--iv Massoud Hadian Dehkordi and Roghayeh Taghizadeh Multiple differential-zero correlation linear cryptanalysis of reduced-round CAST-256 . . . . . . . . . . . . . . . . 55--62 Vishal Saraswat and Rajeev Anand Sahu and Amit K. Awasthi A secure anonymous proxy signcryption scheme . . . . . . . . . . . . . . . . . 63--84 Kishan Chand Gupta and Sumit Kumar Pandey and Indranil Ghosh Ray Applications of design theory for the constructions of MDS matrices for lightweight cryptography . . . . . . . . 85--116 Yao Lu and Liqiang Peng and Santanu Sarkar Cryptanalysis of an RSA variant with moduli $ N = p^r q^l $ . . . . . . . . . 117--130
Travis Scholl Isolated elliptic curves and the MOV attack . . . . . . . . . . . . . . . . . 131--146 Subhabrata Samajder and Palash Sarkar Rigorous upper bounds on data complexities of block cipher cryptanalysis . . . . . . . . . . . . . 147--175 Hassan Jameel Asghar and Mohamed Ali Kaafar When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack . . . . . . . . 177--194
Ahmed Mohammed and Abdulrahman Alkhelaifi RSA: A number of formulas to improve the search for $ p + q $ . . . . . . . . . . 195--203 Dominik Reichl Tame logarithmic signatures of abelian groups . . . . . . . . . . . . . . . . . 205--214 Janaka Alawatugoda On the leakage-resilient key exchange 215--269
Anonymous Frontmatter . . . . . . . . . . . . . . i Juha Partala Algebraic generalization of Diffie--Hellman key exchange . . . . . . 1 Tran van Trung Construction of strongly aperiodic logarithmic signatures . . . . . . . . . 23 Hassan Qahur Al Mahri and Leonie Simpson and Harry Bartlett and Ed Dawson and Kenneth Koon-Ho Wong A fundamental flaw in the ++AE authenticated encryption mode . . . . . 37 Sabyasachi Dey and Santanu Sarkar Generalization of Roos bias in RC4 and some results on key--keystream relations 43 Thalia M. Laing and Douglas R. Stinson A survey and refinement of repairable threshold schemes . . . . . . . . . . . 57
Anonymous Frontmatter . . . . . . . . . . . . . . i--iv Georgios Fotiadis and Elisavet Konstantinou Generating pairing-friendly elliptic curve parameters using sparse families 83--99 Prabhat Kushwaha Improved lower bound for Diffie--Hellman problem using multiplicative group of a finite field as auxiliary group . . . . 101--118
Anonymous Frontmatter . . . . . . . . . . . . . . i Wachirapong Jirakitpuwapat and Parin Chaipunya and Poom Kumam and Sompong Dhompongsa and Phatiphat Thounthong New methods of construction of Cartesian authentication codes from geometries over finite commutative rings . . . . . 119 Matvei Kotov and Alexander Ushakov Analysis of a key exchange protocol based on tropical matrix algebra . . . . 137 Håvard Raddum and Pavol Zajac MRHS solver based on linear algebra and exhaustive search . . . . . . . . . . . 143 Sanjit Chatterjee and M. Prem Laxman Das and R. Kabaleeshwaran Converting pairing-based cryptosystems from composite to prime order setting --- a comparative analysis . . . . . . . 159
Anonymous Frontmatter . . . . . . . . . . . . . . i Eduardo Carvalho Pinto and Christophe Petit Better path-finding algorithms in LPS Ramanujan graphs . . . . . . . . . . . . 191 Maura B. Paterson and Douglas R. Stinson and Jalaj Upadhyay Multi-prover proof of retrievability . . 203 Gustavo Banegas and Paulo S. L. M. Barreto and Brice Odilon Boidje and Pierre-Louis Cayrel and Gilbert Ndollane Dione and Kris Gaj and Cheikh Thiécoumba Gueye and Richard Haeussler and Jean Belo Klamti and Ousmane N'diaye and Duc Tri Nguyen and Edoardo Persichetti and Jefferson E. Ricardini DAGS: Key encapsulation using dyadic GS codes . . . . . . . . . . . . . . . . . 221 Avik Chakraborti and Nilanjan Datta and Mridul Nandi On the optimality of non-linear computations for symmetric key primitives . . . . . . . . . . . . . . . 241
Anonymous Frontmatter . . . . . . . . . . . . . . i Thomas Wunderer A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack . . . . . . . . . . . . . . . . . 1 Abdelmalek Azizi and Idriss Jerrari and Abdelkader Zekhnini and Mohammed Talbi Capitulation of the $2$-ideal classes of type $ (2, 2, 2)$ of some quartic cyclic number fields . . . . . . . . . . . . . 27 Nina Bindel and Johannes Buchmann and Florian Göpfert and Markus Schmidt Estimation of the hardness of the learning with errors problem with a restricted number of samples . . . . . . 47
Anonymous Frontmatter . . . . . . . . . . . . . . i Shizuo Kaji and Toshiaki Maeno and Koji Nuida and Yasuhide Numata Polynomial expressions of $p$-ary auction functions . . . . . . . . . . . 69 Julien Lavauzelle and Françoise Levy-dit-Vehel Generic constructions of PoRs from codes and instantiations . . . . . . . . . . . 81 Károly Harsányi and Péter Ligeti Exact information ratios for secret sharing on small graphs with girth at least $5$ . . . . . . . . . . . . . . . 107 Tarun Kumar Bansal and Xavier Boyen and Josef Pieprzyk Signcryption schemes with insider security in an ideal permutation model 117--150
Anonymous Frontmatter . . . . . . . . . . . . . . i Jean-François Biasse and Fang Song On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in $ \mathbb {Q}(\zeta 2 s) $ . . . . . . . . . . . . 151 Arnaud Sipasseuth and Thomas Plantard and Willy Susilo Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices . . . . . . . . . . . . . . . . 169 Mridul Nandi and Tapas Pandit Predicate signatures from pair encodings via dual system proof technique . . . . 197 Stavros Kousidis and Andreas Wiemers On the first fall degree of summation polynomials . . . . . . . . . . . . . . 229
Jung Hee Cheon and Kristin Lauter and Donggeon Yhee Preface to the First Annual MathCrypt Proceedings Volume . . . . . . . . . . . 1--4 Dan Boneh and Darren Glass and Daniel Krashen and Kristin Lauter and Shahed Sharif and Alice Silverberg and Mehdi Tibouchi and Mark Zhandry Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves . . . . . . . . . . . . . . . . . 5--14 Houda Ferradi and Rémi Géraud and Sylvain Guilley and David Naccache and Mehdi Tibouchi Recovering Secrets From Prefix-Dependent Leakage . . . . . . . . . . . . . . . . 15--24 Ming-Deh Huang and Michiel Kosters and Christophe Petit and Sze Ling Yeo and Yang Yun Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem . . . . . . . . . . . . . . . . 25--38 Jeffrey Hoffstein and Joseph H. Silverman and William Whyte and Zhenfei Zhang A signature scheme from the finite field isomorphism problem . . . . . . . . . . 39--54 Carl Bootland and Wouter Castryck and Ilia Iliashenko and Frederik Vercauteren Efficiently Processing Complex-Valued Data in Homomorphic Encryption . . . . . 55--65 Yarkin Doröz and Berk Sunar Flattening NTRU for Evaluation Key Free Homomorphic Encryption . . . . . . . . . 66--83 Masaya Yasuda Self-dual DeepBKZ for finding short lattice vectors . . . . . . . . . . . . 84--94 Gustavo Banegas and Paulo S. L. M. Barreto and Edoardo Persichetti and Paolo Santini Designing Efficient Dyadic Operations for Cryptographic Applications . . . . . 95--109 Gabrielle De Micheli and Nadia Heninger and Barak Shani Characterizing overstretched NTRU attacks . . . . . . . . . . . . . . . . 110--119 David Urbanik and David Jao New Techniques for SIDH-based NIKE . . . 120--128 David Jao and Jason LeGrow and Christopher Leonardi and Luis Ruiz-Lopez A subexponential-time, polynomial quantum space algorithm for inverting the CM group action . . . . . . . . . . 129--138 Antoine Joux and Jacek Pomyka\la Preface for the Number-Theoretic Methods in Cryptology conferences . . . . . . . 393--396 Carl Bootland and Wouter Castryck and Alan Szepieniec and Frederik Vercauteren A framework for cryptographic problems from linear algebra . . . . . . . . . . 202--217 Jean-Sébastien Coron and Agnese Gini Improved cryptanalysis of the AJPS Mersenne based cryptosystem . . . . . . 218--223 Éric Brier and Houda Ferradi and Marc Joye and David Naccache New number-theoretic cryptographic primitives . . . . . . . . . . . . . . . 224--235 Hayley Tomkins and Monica Nevins and Hadi Salmasian New Zémor--Tillich Type Hash Functions Over $ {\rm GL}_2 (\mathbb {F}_{p^n}) $ 236--253 Marc Joye Protecting ECC Against Fault Attacks: The Ring Extension Method Revisited . . 254--267 Wouter Castryck and Thomas Decru and Benjamin Smith Hash functions from superspecial genus-2 curves using Richelot isogenies . . . . 268--292 Claire Delaplace and Alexander May Can we Beat the Square Root Bound for ECDLP over $ \mathbb {F}_{p^2} $ via Representation? . . . . . . . . . . . . 293--306 Maciej Grze\'skowiak A variant of the large sieve inequality with explicit constants . . . . . . . . 307--315 Christina Boura and Nicolas Gama and Mariya Georgieva and Dimitar Jetchev CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes . . . . . 316--338 Taechan Kim and Mehdi Tibouchi Equidistribution Among Cosets of Elliptic Curve Points in Intervals . . . 339--345 Jacek Pomyka\la and Maciej Radziejewski Integer factoring and compositeness witnesses . . . . . . . . . . . . . . . 346--358 Andrea Lesavourey and Thomas Plantard and Willy Susilo Short Principal Ideal Problem in multicubic fields . . . . . . . . . . . 359--392 Jung Hee Cheon and Wonhee Cho and Minki Hhan and Jiseung Kim and Changmin Lee Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem . . . . . . . . . . . . . . . . 397--413 Leonardo Col\`o and David Kohel Orienting supersingular isogeny graphs 414--437 Giovanni Di Crescenzo and Matluba Khodjaeva and Delaram Kahrobaei and Vladimir Shpilrain Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC) . . . . . . . 438--459 Kazuhiro Yokoyama and Masaya Yasuda and Yasushi Takahashi and Jun Kogure Complexity bounds on Semaev's naive index calculus method for ECDLP . . . . 460--485 Sudhangshu B. Karmakar An elementary proof of Fermat's Last Theorem for all even exponents . . . . . 139--142 Sudhangshu B. Karmakar Retraction of: An elementary proof of Fermat's Last Theorem for all even exponents . . . . . . . . . . . . . . . 143--143 Neha Goel and Indivar Gupta and B. K. Dass Survey on SAP and its application in public-key cryptography . . . . . . . . 144--152 Liang Feng Zhang and Reihaneh Safavi-Naini Privacy-preserving verifiable delegation of polynomial and matrix functions . . . 153--171 Suvradip Chakraborty and Janaka Alawatugoda and Chandrasekaran Pandu Rangan New approach to practical leakage-resilient public-key cryptography . . . . . . . . . . . . . . 172--201
Jung Hee Cheon and Kristin Lauter and Yongsoo Song Editor's Preface for the Second Annual MathCrypt Proceedings Volume . . . . . . 1--3 Jean-François Biasse and Xavier Bonnetain and Benjamin Pring and André Schrottenloher and William Youmans A trade-off between classical and quantum circuit size for an attack against CSIDH . . . . . . . . . . . . . 4--17 Oleg Taraskin and Vladimir Soukharev and David Jao and Jason T. LeGrow Towards Isogeny-Based Password-Authenticated Key Establishment 18--30 Yasushi Takahashi and Momonari Kudo and Ryoya Fukasaku and Yasuhiko Ikematsu and Masaya Yasuda and Kazuhiro Yokoyama Algebraic approaches for solving isogeny problems of prime power degrees . . . . 31--44 Sean Murphy and Rachel Player Discretisation and Product Distributions in Ring-LWE . . . . . . . . . . . . . . 45--59 Thijs Laarhoven Approximate Voronoi cells for lattices, revisited . . . . . . . . . . . . . . . 60--71 Dana Dachman-Soled and Huijing Gong and Mukul Kulkarni and Aria Shahverdi (In)Security of Ring-LWE Under Partial Key Exposure . . . . . . . . . . . . . . 72--86 Dana Dachman-Soled and Huijing Gong and Mukul Kulkarni and Aria Shahverdi Towards a Ring Analogue of the Leftover Hash Lemma . . . . . . . . . . . . . . . 87--110 Marc Joye and Oleksandra Lapiha and Ky Nguyen and David Naccache The Eleventh Power Residue Symbol . . . 111--122 Francesco Sica Factoring with Hints . . . . . . . . . . 123--130 Mehdi Tibouchi and Alexandre Wallet One Bit is All It Takes: A Devastating Timing Attack on BLISS's Non-Constant Time Sign Flips . . . . . . . . . . . . 131--142 Jean-François Biasse and Benjamin Pring A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE . . . . . . . . . 143--156 Laszlo Csirmaz Secret sharing and duality . . . . . . . 157--173 Antonio J. Di Scala and Carlo Sanna and Edoardo Signorini On the condition number of the Vandermonde matrix of the $n$ th cyclotomic polynomial . . . . . . . . . 174--178 Maura B. Paterson and Douglas R. Stinson On the equivalence of authentication codes and robust $ (2, 2)$-threshold schemes . . . . . . . . . . . . . . . . 179--196 Mikhail Anokhin Pseudo-free families of computational universal algebras . . . . . . . . . . . 197--222 Gary McGuire and Oisín Robinson Lattice Sieving in Three Dimensions for Discrete Log in Medium Characteristic 223--236 Matvei Kotov and Anton Menshov and Alexander Ushakov Attack on Kayawood protocol: uncloaking private keys . . . . . . . . . . . . . . 237--249 Filipe Araujo and Samuel Neves The circulant hash revisited . . . . . . 250--257 Yu Zhou and Daoguang Mu and Xinfeng Dong On cryptographic properties of $ (n + 1)$-bit $S$-boxes constructed by known $n$-bit $S$-boxes . . . . . . . . . . . 258--265 Atul Pandey and Indivar Gupta and Dhiraj Kumar Singh Improved cryptanalysis of a ElGamal Cryptosystem Based on Matrices Over Group Rings . . . . . . . . . . . . . . 266--279 Dylan Rudy and Chris Monico Remarks on a Tropical Key Exchange System . . . . . . . . . . . . . . . . . 280--283 Ignacio Cascudo and Reto Schnyder A note on secure multiparty computation via higher residue symbols . . . . . . . 284--297 Elizabeth M. Reid Using Inclusion/Exclusion to find Bent and Balanced Monomial Rotation Symmetric Functions . . . . . . . . . . . . . . . 298--304 Arghya Bhattacharjee and Cuauhtemoc Mancillas López and Eik List and Mridul Nandi The Oribatida v1.3 Family of Lightweight Authenticated Encryption Schemes . . . . 305--344 Fouazou Lontouo Perez Broon and Thinh Dang and Emmanuel Fouotsa and Dustin Moody Isogenies on twisted Hessian curves . . 345--358 Martin Ekerå Quantum algorithms for computing general discrete logarithms and orders with tradeoffs . . . . . . . . . . . . . . . 359--407 Margaux Dugardin and Werner Schindler and Sylvain Guilley Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods . . . . . . . . . . . . 408--433 Jing Zhang and Yuan Li and John O. Adeyeye Sensitivities and block sensitivities of elementary symmetric Boolean functions 434--453
Yu Zhou and Jianyong Hu and Xudong Miao and Yu Han and Fuzhong Zhang On the confusion coefficient of Boolean functions . . . . . . . . . . . . . . . 1--13 Andrea Basso and Fabien Pazuki On the supersingular GPST attack . . . . 14--19 Paolo Santini and Edoardo Persichetti and Marco Baldi Reproducible families of codes and cryptographic applications . . . . . . . 20--48 Matthew J. Craven and John R. Woodward Evolution of group-theoretic cryptology attacks using hyper-heuristics . . . . . 49--63 Nael Rahman and Vladimir Shpilrain MAKE: a matrix action key exchange . . . 64--72 Bishwajit Chakraborty and Mridul Nandi The mF mode of authenticated encryption with associated data . . . . . . . . . . 73--97 Daniel R. L. Brown and Neal Koblitz and Jason T. LeGrow Cryptanalysis of ``MAKE'' . . . . . . . 98--102
Daniel R. L. Brown Plactic key agreement (insecure?) . . . ?? Vitaly Roman'kov and Alexander Ushakov and Vladimir Shpilrain Algebraic and quantum attacks on two digital signature schemes . . . . . . . ?? Shuji Isobe and Eisuke Koizumi A construction of encryption protocols over some semidirect products . . . . . ?? Jean Belo Klamti and M. Anwarul Hasan A code-based hybrid signcryption scheme ?? Alexander Moch Provable security against generic attacks on stream ciphers . . . . . . . ?? Renata Kawa and Mieczys\law Kula Access structures determined by uniform polymatroids . . . . . . . . . . . . . . ?? Zhenyu Liu and Zepeng Zhuo Further research results on confusion coefficient of Boolean functions . . . . ??
Imin Chen and David Sun The dihedral hidden subgroup problem . . ?? Márton Erdélyi and Pál Hegedüs and Sándor Z. Kiss and Gábor P. Nagy On linear codes with random multiplier vectors and the maximum trace dimension property . . . . . . . . . . . . . . . . ?? Massimiliano Sala and Daniele Taufer Group structure of elliptic curves over $ \mathbb {Z} / \mathbb {NZ} $ . . . . . ?? Marco Cianfriglia and Elia Onofri and Marco Pedicini mR$_{\rm LWE}$-CP-ABE: A revocable CP-ABE for post-quantum cryptography . . ?? Kyosuke Yamashita and Keisuke Hara On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes . . ?? Marco Calderini and Riccardo Longo and Massimiliano Sala and Irene Villa Searchable encryption with randomized ciphertext and randomized keyword search ?? Marco Calderini and Roberto Civino and Riccardo Invernizzi Differential experiments using parallel alternative operations . . . . . . . . . ?? Marco Timpanella On a generalization of the Deligne--Lusztig curve of Suzuki type and application to AG codes . . . . . . ?? Lo\"\ic Rouquette and Marine Minier and Christine Solnon Automatic boomerang attacks search on Rijndael . . . . . . . . . . . . . . . . ?? Wissam Ghantous and Federico Pintore and Mattia Veroni Efficiency of SIDH-based signatures (yes, SIDH) . . . . . . . . . . . . . . ?? Sigurd Eskeland Cryptanalysis of a privacy-preserving authentication scheme based on private set intersection . . . . . . . . . . . . ??