A programmable 800 Mbit/s CRC check/generator unit for LANs and MANs

Birch, Jesper; Christensen, Lars Gylling; Skov, M.

doi:10.1016/0169-7552(92)90002-8

Cited by 13 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Techniques for implementing reconfigurable LFSRs are well-known. Reconfigurable LFSRs are used, for example, in applications which support multiple CRC standards [42].…”

Section: Hardware Cost Analysismentioning

confidence: 99%

CRC-PUF: A Machine Learning Attack Resistant Lightweight PUF Construction

Dubrova

Naslund

Degen

et al. 2019

2019 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)

View full text Add to dashboard Cite

Adversarial machine learning is an emerging threat to security of Machine Learning (ML)-based systems. However, we can potentially use it as a weapon against ML-based attacks. In this paper, we focus on protecting Physical Unclonable Functions (PUFs) against ML-based modeling attacks. PUFs are an important cryptographic primitive for secret key generation and challenge-response authentication. However, none of the existing PUF constructions are both ML attack resistant and sufficiently lightweight to fit low-end embedded devices. We present a lightweight PUF construction, CRC-PUF, in which input challenges are de-synchronized from output responses to make a PUF model difficult to learn. The de-synchronization is done by an input transformation based on a Cyclic Redundancy Check (CRC). By changing the CRC generator polynomial for each new response, we assure that success probability of recovering the transformed challenge is at most 2 −86 for 128-bit challenges and responses.

show abstract

“…Techniques for implementing reconfigurable LFSRs are well-known. Reconfigurable LFSRs are used, for example, in applications which support multiple CRC standards [42].…”

Section: Hardware Cost Analysismentioning

confidence: 99%

CRC-PUF: A Machine Learning Attack Resistant Lightweight PUF Construction

Dubrova

Naslund

Degen

et al. 2019

2019 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)

View full text Add to dashboard Cite

show abstract

“…Note that some LFSRs used in non-cryptographic applications also may use programmable connections, e.g. LFSRs implementing CRC encoding which need to support different CRC standards based on different generator polynomials [5].…”

Section: Encoding/decodingmentioning

confidence: 99%

Error-Correcting Message Authentication for 5G

Dubrova¹,

Näslund²,

Selander³

et al. 2016

Proceedings of the 9th EAI International Conference on Mobile Multimedia Communications

View full text Add to dashboard Cite

Message Authentication Codes (MACs) used in today's wireless communication standards are not capable of correcting errors which may occur during transmission. If MAC verification fails, the message is typically discarded and a retransmission is requested. Re-transmissions waste energy and increase average packet latency. Excessive re-transmissions may lead to network congestion. In this paper, we introduce a new MAC, MAC-C, which efficiently combines integrity protection with single-bit error correction and provide a detailed quantitative analysis of its security.The efficiency of MAC-C makes it a good candidate for simpler 5G radio types and use cases with constrained resources such as Machine Type Communications (MTC). CCS Concepts •Security and privacy → Hash functions and message authentication codes; Mobile and wireless security;

show abstract

“…a-byte, and a-word) at a time [1,2,3]. Recent innovations include the increase of the computation speed [3,4], reduction of computation complexities [5], parallel computation by a single calculator [6], and unified mathematical expressions to open out the secret behind the parallel computation with multiple calculators or channels [7], and so on. To facilitate the CRC computation implementation to some extent, several new transforms, from the mathematical viewpoint, are presented in this paper, which include the multiplication of two messages, shift or complement of a message, and different (defaulted) initial CRC values of the message.…”

Section: Introductionmentioning

confidence: 99%

“…The traditional computation of CRC encoding and decoding has been studied extremely, which addresses various software and/or hardware implementations calculating a-bit or multi-bit (e.g. a-byte, and a-word) at a time [1,2,3]. Recent innovations include the increase of the computation speed [3,4], reduction of computation complexities [5], parallel computation by a single calculator [6], and unified mathematical expressions to open out the secret behind the parallel computation with multiple calculators or channels [7], and so on.…”

Section: Introductionmentioning

confidence: 99%

Some transforms in cyclic redundancy check (CRC) computation

Wen

Liu

2011

2011 International Conference on Electrical and Control Engineering

View full text Add to dashboard Cite

Some transforms in cyclic redundancy check (CRC) computation, such as the multiplication of two messages' polynomials, shift, complement, and different initial (defaulted) remainder of a message, are studied. The relationships of the CRCs between the transformed message and the original one are also addressed from the mathematical point of view. Some examples are given to validate such transforms. We find that these transforms are useful in CRC computation implementations of both software and hardware.

show abstract

A programmable 800 Mbit/s CRC check/generator unit for LANs and MANs

Cited by 13 publications

References 6 publications

CRC-PUF: A Machine Learning Attack Resistant Lightweight PUF Construction

CRC-PUF: A Machine Learning Attack Resistant Lightweight PUF Construction

Error-Correcting Message Authentication for 5G

Some transforms in cyclic redundancy check (CRC) computation

Contact Info

Product

Resources

About