1.

Record Nr.

UNISA996388615503316

Autore

Vokins Joan <d. 1690.>

Titolo

A tender invitation [[electronic resource] ] : unto all those that want peace with God, by reason of the burden of sin that keeps them from acceptance with the Lord Jesus, and from an assurance of salvation, though it be very desirable to them

Pubbl/distr/stampa

London, : [s.n.], Printed in the year MDCLXXXVII. [1687]

Descrizione fisica

1 sheet ([1] p.)

Soggetti

Redemption

Broadsides17th century.England

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Signed: Joan Vokins.

Reproduction of original in the Friends' Library (London, England).

Sommario/riassunto

eebo-0080



2.

Record Nr.

UNINA9910163249903321

Autore

O'Donnell Elliott <1872-1965, >

Titolo

Byways of ghost-land / / Elliott O'Donnell

Pubbl/distr/stampa

[New York, New York] : , : Sheba Blake Publishing, , 2015

©2015

ISBN

1-312-87412-0

Descrizione fisica

1 online resource (500 p.)

Disciplina

398.4

Soggetti

Ghost stories

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Sommario/riassunto

Will update



3.

Record Nr.

UNINA9910644268303321

Titolo

Arithmetic of Finite Fields : 9th International Workshop, WAIFI 2022, Chengdu, China, August 29 – September 2, 2022, Revised Selected Papers / / edited by Sihem Mesnager, Zhengchun Zhou

Pubbl/distr/stampa

Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023

ISBN

3-031-22944-4

Edizione

[1st ed. 2023.]

Descrizione fisica

1 online resource (353 pages)

Collana

Lecture Notes in Computer Science, , 1611-3349 ; ; 13638

Disciplina

910.5

512.3

Soggetti

Computer science - Mathematics

Computer engineering

Computer networks

Data structures (Computer science)

Information theory

Data protection

Algorithms

Symbolic and Algebraic Manipulation

Mathematics of Computing

Computer Engineering and Networks

Data Structures and Information Theory

Data and Information Security

Design and Analysis of Algorithms

Camps finits (Àlgebra)

Congressos

Llibres electrònics

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

Structures in Finite Fields -- On a conjecture on irreducible polynomials over finite fields with restricted coefficients -- On two applications of polynomials xk – cx – d over finite fields and more -- Efficient Finite



Field Arithmetic -- Polynomial Constructions of Chudnovsky-Type Algorithms for Multiplication in Finite Fields with Linear Bilinear Complexity -- Reduction-free Multiplication for Finite Fields and Polynomial Rings -- Finite Field Arithmetic in Large Characteristic for Classical and Post-Quantum Cryptography -- Fast enumeration of superspecial hyperelliptic curves of genus 4 with automorphism group V4 -- Coding theory -- Two Classes of Constacyclic Codes with Variable Parameters -- Near MDS Codes with Dimension 4 and Their Application in Locally Recoverable Codes -- Optimal possibly nonlinear 3-PIR codes of small size -- PIR codes from combinatorial structures -- The Projective General Linear Group PGL(2, 5m) and Linear Codes of Length 5m + 1 -- Private Information Retrieval Schemes Using Cyclic Codes -- Two Classes of Optimal Few-Weight Codes over Fq + uFq -- Explicit Non-Malleable Codes from Bipartite Graphs -- Cryptography -- Algebraic Relation of Three MinRank Algebraic Modelings -- Decomposition of Dillon's APN permutation with efficient hardware implementation -- New Versions of Miller-loop Secured against Side-Channel Attacks -- A Class of Power Mappings with Low Boomerang Uniformity -- New Classes of Bent Functions via the Switching Method -- Sequences -- Correlation measure of binary sequence families with trace representation -- Linear complexity of generalized cyclotomic sequences with period pnqm -- On the 2-adic complexity of cyclotomic binary sequences with period p2 and 2p2.

Sommario/riassunto

This book constitutes the thoroughly refereed post-workshop proceedings of the 8th International Workshop on the Arithmetic of Finite Field, WAIFI 2022, held in Chengdu, China, in August – September 2022. The 19 revised full papers and 3 invited talks presented were carefully reviewed and selected from 25 submissions. The papers are organized in topical sections: structures in finite fields; efficient finite field arithmetic; coding theory; cryptography; sequences.