default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th WAIFI 2022: Chengdu, China
- Sihem Mesnager
, Zhengchun Zhou:
Arithmetic of Finite Fields - 9th International Workshop, WAIFI 2022, Chengdu, China, August 29 - September 2, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13638, Springer 2023, ISBN 978-3-031-22943-5
Structures in Finite Fields
- Andrea Ferraguti, Giacomo Micheli:
On a Conjecture on Irreducible Polynomials over Finite Fields with Restricted Coefficients. 3-13 - Canberk Irimagzi, Ferruh Özbudak:
On Two Applications of Polynomials xk-cx-d over Finite Fields and More. 14-32
Effcient Finite Field Arithmetic
- Stéphane Ballet, Alexis Bonnecaze, Bastien Pacifico:
Polynomial Constructions of Chudnovsky-type Algorithms for Multiplication in Finite Fields with Linear Bilinear Complexity. 35-52 - Samira Carolina Oliva Madrigal, Gökay Saldamli, Chen Li, Yue Geng, Jing Tian, Zhongfeng Wang, Çetin Kaya Koç:
Reduction-Free Multiplication for Finite Fields and Polynomial Rings. 53-78 - Sylvain Duquesne:
Finite Field Arithmetic in Large Characteristic for Classical and Post-quantum Cryptography. 79-106 - Ryo Ohashi, Momonari Kudo, Shushi Harashita:
Fast Enumeration of Superspecial Hyperelliptic Curves of Genus 4 with Automorphism Group V4. 107-124
Coding Theory
- Cunsheng Ding, Zhonghua Sun, Xiaoqiang Wang:
Two Classes of Constacyclic Codes with Variable Parameters. 127-141 - Ziling Heng, Xiaoru Li:
Near MDS Codes with Dimension 4 and Their Application in Locally Recoverable Codes. 142-158 - Henk D. L. Hollmann, Urmas Luhaäär:
Optimal Possibly Nonlinear 3-PIR Codes of Small Size. 159-168 - Massimo Giulietti, Arianna Sabatini, Marco Timpanella:
PIR Codes from Combinatorial Structures. 169-182 - Yue Zhao, Chunming Tang, Yanfeng Qi:
The Projective General Linear Group PGL(2, 5m) and Linear Codes of Length 5m+1. 183-193 - Seyma Bodur, Edgar Martínez-Moro, Diego Ruano:
Private Information Retrieval Schemes Using Cyclic Codes. 194-207 - Zhao Hu, Bing Chen, Nian Li, Xiangyong Zeng:
Two Classes of Optimal Few-Weight Codes Over 픽q+u픽q. 208-220 - Shohei Satake, Yujie Gu, Kouichi Sakurai:
Explicit Non-malleable Codes from Bipartite Graphs. 221-236
Cryptography
- Hao Guo, Jintai Ding:
Algebraic Relation of Three MinRank Algebraic Modelings. 239-249 - José Luis Imaña, Lilya Budaghyan, Nikolay S. Kaleyski:
Decomposition of Dillon's APN Permutation with Efficient Hardware Implementation. 250-268 - Nadia El Mrabet, Loubna Ghammam, Nicolas Méloni, Emmanuel Fouotsa:
New Versions of Miller-loop Secured Against Side-Channel Attacks. 269-287 - Haode Yan, Ziying Zhang, Zhengchun Zhou:
A Class of Power Mappings with Low Boomerang Uniformity. 288-297 - Xi Xie, Bing Chen, Nian Li, Xiangyong Zeng:
New Classes of Bent Functions via the Switching Method. 298-309
Sequences
- Ana-Isabel Gómez, Domingo Gómez-Pérez, Andrew Z. Tirkel:
Correlation Measure of Binary Sequence Families With Trace Representation. 313-319 - Vladimir Edemskiy, Chenhuang Wu:
Linear Complexity of Generalized Cyclotomic Sequences with Period pnqm. 320-333 - Fuqing Sun, Qin Yue, Xia Li:
On the 2-Adic Complexity of Cyclotomic Binary Sequences with Period p2 and 2p2. 334-347
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-26 23:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
