Results 31 to 40 of about 2,970,762 (373)
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex [PDF]
, 2019 Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate.
Cramer, Ronald +2 more
core +3 more sources
A new DNA-based model for finite field arithmetic
Heliyon, 2019 A Galois field GF(pn) with p≥2 a prime number and n≥1 is a mathematical structure widely used in Cryptography and Error Correcting Codes Theory. In this paper, we propose a novel DNA-based model for arithmetic over GF(pn).
Iván Jirón +4 more
doaj +1 more source
A Side-Channel Attack on a Masked IND-CCA Secure Saber KEM Implementation
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this paper, we present a side-channel attack on a first-order masked implementation of IND-CCA secure Saber KEM. We show how to recover both the session key and the long-term secret key from 24 traces using a deep neural network created at the ...
Kalle Ngo +3 more
doaj +1 more source
Soft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes
EURASIP Journal on Advances in Signal Processing, 2004 The issue of robust and joint source-channel decoding of quasi-arithmetic codes is addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This amounts to approximating the distribution of the source.
Guionnet Thomas, Guillemot Christine
doaj +1 more source
Frontiers in Psychology, 2022 Research suggests that children’s exposure to pollutants may impact their neurocognitive development. While researchers have found associations between air pollutants and cognitive development, these associations remain underspecified.
Josh Medrano +3 more
doaj +1 more source
EURASIP Journal on Advances in Signal Processing, 2009 Joint source-channel turbo techniques have recently been explored a lot in literature as one promising possibility to lower the end-to-end distortion, with fixed length codes, variable length codes, and (quasi) arithmetic codes. Still, many issues remain
Luc Vandendorpe, Xavier Jaspar
doaj +1 more source
Hardware acceleration of number theoretic transform for zk‐SNARK
Engineering Reports, EarlyView., 2023 An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
Polar Codes for Module-LWE Public Key Encryption: The Case of Kyber
Cryptography, 2023 In modern society, the Internet is one of the most used means of communication. Thus, secure information transfer is inevitably of major importance.
Iason Papadopoulos, Jiabo Wang
doaj +1 more source
Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization [PDF]
, 2012 Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the performance ...
Hassani, S. Hamed, Urbanke, Rudiger
core +2 more sources
Компьютерная оптикаThe trend toward increasing the efficiency of computing systems and devices is directly related with the transition to parallel computing. We propose that parallel calculations should be conducted at the level of arithmetic operations using arithmetic ...
I.A. Kalmykov +4 more
doaj +1 more source