Pith. sign in

REVIEW 2 major objections 8 minor 58 references

ACRIC: Securing Legacy Communication Networks via Authenticated Cyclic Redundancy Integrity Check

T0 review · 2 major / 8 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that a cryptographically computed CRC field—using a secret initialization vector and one-time-pad encryption—authenticates legacy industrial messages without changing frame formats or adding hardware.

desk verdict A practical retrofit idea with a real security flaw: CRC's affine structure lets an attacker forge tags without knowing the secret. read the letter →

arxiv 2411.14394 v2 pith:6FO5SFPI submitted 2024-11-21 cs.CR

Alessandro Lotto , Alessandro Brighente , Mauro Conti This is my paper · ORCID
classification cs.CR
keywords ACRIClegacyindustrialprotocolsmessageauthenticationintegrityprotectioncryptographicCRCone-timepadbackwardcompatibilityretrofitsecurity
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

ACRIC repurposes the CRC field that already exists in most industrial protocols as an authentication tag. The sender computes the CRC with a secret initialization vector and XOR-encrypts the result with a single-use value from a hash chain, giving $ACRIC_i = F_{CRC}(InitVec, M_i) \oplus h_i$; the receiver accepts a message only if recomputation with the same secrets matches. The paper argues that this provides authentication, integrity, and replay resistance while preserving the original frame format, coexisting with non-secured devices, and adding only about $4 \,\mu s$ per message. The point is practical: legacy industrial systems can be retrofitted with message authentication by a software-only change, with no additional hardware and no data-throughput loss.

What carries the argument

The machinery is the ACRIC tag $ACRIC_i = F_{CRC}(InitVec, M_i) \oplus h_i$, a standard CRC computation modified in two ways: the initialization vector is a secret value derived from the session key, and the resulting CRC is XORed with a single-use hash-chain value $h_i$ (one-time-pad encryption). Two properties carry the security argument: injectivity of $F_{CRC}$ in the initialization vector, which the paper verifies experimentally for 41 CRC variants and uses to claim that a wrong tag is as likely as a random guess; and absence of linearity under a non-zero InitVec, which the paper claims blocks additive forgeries. The hash chain supplies fresh keys so that a replayed message carries the wrong $h_i$ and is rejected with probability 1 within a session.

What would settle it

Observe one valid pair $(M, C)$, compute $F_{CRC}(0, X)$ for any difference $X$ using the public CRC polynomial, and send $M' = M \oplus X$ with tag $C' = C \oplus F_{CRC}(0, X)$; the verifier's recomputation matches $C'$, so the forged message is accepted, settling that the claimed authentication does not hold.

Watch

Extended reading notes

Core claim

The paper's central claim is that a CRC value, computed with a secret initialization vector and encrypted with a hash-chain one-time pad, can serve as a message-authentication tag. In symbols, the tag is $ACRIC_i = F_{CRC}(InitVec, M_i) \oplus h_i$, where $F_{CRC}$ is the standard CRC function, $InitVec$ is a secret value derived from a session key, and $h_i$ is the $i$-th value of a hash chain. The paper asserts that a matching tag confirms both the authenticity and the integrity of the message, that the one-time-pad layer preserves the secrecy of $InitVec$, and that injectivity of the CRC function in the initialization vector makes the successful-forgery probability roughly $2^{-n}$ for an $n$-bit CRC. The claimed advantage over earlier proposals is that all of this happens inside the existing CRC field, so neither the wire format nor the hardware needs to change.

Load-bearing premise

The load-bearing premise is that the affine structure of CRC cannot be exploited without knowing the secret initialization vector; if an attacker can combine one observed message/tag pair with the public CRC formula to forge another valid tag, the authentication guarantee collapses.

Editorial extensions

If this is right

  • If ACRIC works as claimed, a software update can add message authentication to Modbus, CAN, Profibus, and DNP3 devices without changing frame layouts or replacing hardware.
  • Secured and unsecured devices could interoperate on the same network, allowing staged upgrades of legacy installations.
  • The measured overhead of about $4 \,\mu s$ per message is small enough for real-time industrial loops that cannot tolerate the roughly $371 \,\mu s$ of SHA-1 HMAC.
  • Because the tag space is limited to the CRC length of 8 to 64 bits, the scheme's brute-force resistance depends on enforcing failure thresholds and on consuming a fresh hash value per message.
  • Both point-to-point and broadcast traffic can be protected by using pair-based or group-based session keys.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A consequence the paper does not draw: observing one valid pair $(M, C)$ is enough to forge a tag for $M \oplus X$, namely $C \oplus F_{CRC}(0, X)$, without ever learning the secret InitVec or the hash value, because CRC is affine over $GF(2)$.
  • The one-time-pad layer protects the confidentiality of the transmitted CRC but does not prevent this deterministic forgery once a single valid reference pair is available.
  • A testable extension would be to key the CRC polynomial itself or apply a keyed nonlinear transformation to the message before the CRC, since keeping the polynomial and the XOR-out value public leaves the additive relation exploitable.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 8 minor

Summary. The paper proposes ACRIC, a retrofit message authentication mechanism for legacy industrial protocols. ACRIC is defined in Eq. (1) as ACRIC_i = F_CRC(InitVec, M_i) XOR h_i, where InitVec is a secret CRC initialization vector and h_i is a single-use value from a hash chain. The authors claim that this construction provides message authentication, integrity protection, and replay resistance without modifying frame formats or requiring additional hardware, and they report an average computational overhead of about 4 microseconds on commercial Modbus devices. The paper contains a probabilistic security analysis based on InitVec-injectivity and CRC collision probabilities, an experimental evaluation on CAREL hardware, and a discussion of key and hash-chain management.

Significance. If the central security claim were sound, ACRIC would be a practically valuable contribution: it targets a genuine deployment problem, preserves frame formats, requires no hardware changes, supports coexistence with non-secured devices, and ships reproducible experimental code. The interoperability test with mixed secured and unsecured Modbus devices and the low reported overhead are genuine strengths. However, the central security claim is invalid: the proposed tag is an affine function of the message for any fixed initialization vector, so an attacker who observes one valid message/tag pair can forge a valid tag for any bit-flipped message using only public CRC parameters. The reported performance and backward compatibility cannot compensate for the absence of the claimed authentication and integrity guarantees.

major comments (2)
  1. [Section 6.1, Eq. (1)] The 'Beyond collisions' paragraph dismisses the linearity attack by claiming that a nonzero secret InitVec makes CRC lose linearity and that the attacker 'still needs to first learn the InitVec used.' This is incorrect. For any standard CRC, F_CRC(I, M) is an affine function of M for every fixed initialization vector I: F_CRC(I, M XOR X) = F_CRC(I, M) XOR D(X), where D(X) is a public difference term computable from the CRC parameters alone (specifically D(X) = F_CRC(0, X) XOR O, with O the public final-XOR constant) and is independent of I. Given one intercepted tuple (M, ACRIC_i = F_CRC(I, M) XOR h_i), an attacker can choose any bit-flip pattern X, set M' = M XOR X, and compute ACRIC'_i = ACRIC_i XOR D(X). The receiver then verifies F_CRC(I, M') XOR h_i = ACRIC'_i, so the forgery succeeds. The unknown hash value h_i cancels, and neither the InitVec nor the hash chain is needed. This deterministic forgery defeats the claimed authentication and integrity guarantees under the Dolev-Yao threat model stated in Section 4.2. The experimental observation that F(I, M1) XOR F(I, M2) differs from F(I, M1 XOR M2) is irrelevant: the affine offset is still present and usable, and injectivity of F in the InitVec does not prevent the attack.
  2. [Section 5.3 vs Section 6.1] The replay-resistance claim in Section 6.1 assumes that the OTP hash value changes with every message, but Section 5.3 explicitly recommends that reusing the same hash value for retransmissions 'generally poses minimal risk.' Under that recommended configuration, an attacker who captures a valid (M, ACRIC) tuple and replays it during the retransmission window produces exactly what a legitimate retransmission looks like, so the receiver will accept it. The claimed 'zero probability' of replay success is therefore only valid under a stricter per-message hash-consumption policy that the paper itself presents as optional. The paper should either remove the replay-protection claim for the hash-reuse mode or explain how the receiver distinguishes a malicious replay from a legitimate retransmission.
minor comments (8)
  1. [Section 1] The text contains a typo: 'safety-critial' should be 'safety-critical.'
  2. [Section 5.2] The sentence 'A matching CRC thus confirms the authenticity and integrity of the message' should refer to a matching ACRIC value, since the plain CRC is not secret and the authentication relies on the OTP-encrypted value.
  3. [Section 5.3] The phrase 'This allows to effectively balance' is ungrammatical; it should be 'This allows one to effectively balance' or 'This effectively balances.'
  4. [Table 1] The table contains a typo: 'Synchornization' should be 'Synchronization.'
  5. [References] Reference [10] has a typo: 'Cybsersecurity' should be 'Cybersecurity.'
  6. [Figure 2] The figure caption or inline text uses lowercase 'acric' in one place; it should be 'ACRIC' for consistency.
  7. [Section 6.1, Eq. (6)] Equation (6) is introduced as a 'collision probability,' but the paper does not specify the probability space or the adversarial strategy over which P1, P2, and P3 are taken; clarifying that these are probabilities over uniformly random choices of A2 and B2 would make the analysis easier to interpret.
  8. [Section 6.2] The performance evaluation reports an average overhead of about 4 microseconds but does not state the number of trials, the variance, or the statistical significance of the comparison with HMAC; adding this information would improve reproducibility.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: ACRIC's security argument is self-contained; the Section 6.1 linearity dismissal is a correctness flaw, not a circular derivation.

full rationale

I walked the claimed derivation chain. ACRIC's authentication claim is based on Eq. (1) (ACRIC_i = FCRC(InitVec, M_i) XOR h_i), and the security assessment computes collision probabilities from the injectivity of F in InitVec, verified experimentally against 41 CRC functions from crcmod. This is independent evidence, not a fitted parameter or a prediction that reduces to an input. The OTP layer is analyzed via Shannon's perfect-secrecy result, which is external. The only self-citation is [31], used for CAN authentication background and key-management discussion; it is not load-bearing for ACRIC's central security claim. I flag Section 6.1's 'Beyond collisions' paragraph as a correctness concern: the statement that nonzero InitVec makes CRC 'lose linearity, thus ensuring ACRIC's resistance' does not follow, because CRCs with nonzero InitVec are affine and the difference term for bit-flips is independent of InitVec; however, that is an invalid inference, not a circular definition or a fitted-input-as-prediction. The paper does not define 'security' in terms of its own experimental measure, so no step in the derivation is circular by construction. Score 0 reflects the absence of circularity; the linearity gap belongs in a correctness review, not a circularity score.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The protocol introduces no new physical entities or fitted parameters. It relies on standard primitives (CRC, hash chain, XOR/OTP) plus the disputed assumption that a secret InitVec breaks the affine structure of CRC.

assumptions (4)
  • domain assumption The attacker follows the Dolev-Yao model: full network access, no hardware compromise, only the cryptographic keys are secret.
    Section 4.2 defines the threat model; the security proof relies on this.
  • domain assumption CRC functions considered are injective in the initialization vector for every fixed message.
    Definition 1 and the experimental check on 41 crcmod functions; used to simplify Pc to 2^{-n} and to argue InitVec collision is impossible.
  • domain assumption Hash chain values h_i are secret, single-use, and uniform enough to provide OTP perfect secrecy for the CRC.
    Section 5.2 Equation (1); the proof that C does not leak F(A) relies on this.
  • ad hoc to paper A nonzero secret InitVec makes CRC non-linear in a way that prevents an attacker from computing tag differences for related messages.
    Section 6.1 'Beyond collisions' paragraph; this premise is false because CRC becomes affine, not secure, and the difference attack works for any InitVec.

how reviews work

0 comments
Cite this review

Pith. "Pith review of ACRIC: Securing Legacy Communication Networks via Authenticated Cyclic Redundancy Integrity Check." pith.science (2026). https://pith.science/paper/6FO5SFPI

@misc{pith2026241114394,
  author       = {Pith},
  title        = {Pith review of: ACRIC: Securing Legacy Communication Networks via Authenticated Cyclic Redundancy Integrity Check},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6FO5SFPI}},
  note         = {Machine review of arXiv:2411.14394}
}
read the original abstract

The increasing integration of modern IT technologies into OT technologies and industrial systems is expanding the vulnerability surface of legacy infrastructures, which often rely on outdated protocols and resource-constrained devices. Recent security incidents in safety-critical industries exposed how the lack of proper message authentication enables attackers to inject malicious commands or alter system behavior, revealing fundamental security weaknesses in existing architectures. These shortcomings have thus prompted new regulations that emphasize the pressing need to strengthen cybersecurity, particularly in legacy systems. Authentication is widely recognized as a fundamental security measure that enhances system resilience. However, its adoption in legacy industrial environments is limited due to practical challenges like backward compatibility, message format changes, and hardware replacement or upgrades costs. In this paper, we introduce ACRIC, a message authentication solution to secure legacy industrial communications explicitly tailored to overcome those challenges all at once. ACRIC uniquely leverages cryptographic computations applied to the CRC field - already present in most industrial communication protocols - ensuring robust message integrity protection and authentication without requiring additional hardware or modifications to existing message formats. ACRIC's backward compatibility and protocol-agnostic nature enable coexistence with non-secured devices, thus facilitating gradual security upgrades in legacy infrastructures. Formal security assessment and experimental evaluation on an industrial-grade testbed demonstrate that ACRIC provides robust security guarantees with minimal computational overhead (~ 4 us). These results underscore ACRIC's practicality, cost-effectiveness, and suitability for effective adoption in resource-constrained industrial environments.

Figures

Figures reproduced from arXiv: 2411.14394 by the authors.

Figure 1
Figure 1. Relationship between identified design challenges for authentication mech [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. ACRIC computation procedure. The secret InitVec and message M are inputs to the standard CRC algorithm FCRC (·, ·). The resulting CRC is OTP encrypted (XOR-ed) with a hash value to protect the InitVec’s confidentiality. – Km: a secret master key; – Ks: a secret session key; – H (·): a cryptographic hash function; – l: a secret value for hash chain initialization; – H = {h0 = H (l), hi = H (hi−1), i = 1, . . . , N}: … view at source ↗
Figure 3
Figure 3. Testbed with industrial devices for ACRIC validation and evaluation. [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Debug prompt showing ACRIC enabled interoperability between secured [PITH_FULL_IMAGE:figures/full_fig_p016_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

58 extracted references · 42 canonical work pages

  1. [1]

    ACM Comput

    Aliwa, E., Rana, O., Perera, C., Burnap, P.: Cyberattacks and countermeasures for in-vehicle networks. ACM Comput. Surv.54(1) (Mar 2021). https://doi.org/ 10.1145/3431233, https://doi.org/10.1145/3431233

    doi:10.1145/3431233 2021

  2. [2]

    Computer Net- works183, 107583 (2020)

    Bernieri, G., Cecconello, S., Conti, M., Lain, G.: Tambus: A novel authentication method through covert channels for securing industrial networks. Computer Net- works183, 107583 (2020). https://doi.org/https://doi.org/10.1016/j.comnet.2020. 107583, https://www.sciencedirect.com/science/article/pii/S1389128620312214

    work page doi:10.1016/j.comnet.2020 2020

  3. [3]

    Computers & Security89, 101677 (2020)

    Bhamare, D., Zolanvari, M., Erbad, A., Jain, R., Khan, K., Meskin, N.: Cy- bersecurity for industrial control systems: A survey. Computers & Security89, 101677 (2020). https://doi.org/https://doi.org/10.1016/j.cose.2019.101677, https: //www.sciencedirect.com/science/article/pii/S0167404819302172

    arXiv 2020

  4. [4]

    In: Proceedings of the 10th An- nual Cyber and Information Security Research Conference

    Carsten, P., Andel, T.R., Yampolskiy, M., McDonald, J.T.: In-vehicle networks: Attacks, vulnerabilities, and proposed solutions. In: Proceedings of the 10th An- nual Cyber and Information Security Research Conference. CISR ’15, Association for Computing Machinery, New York, NY, USA (2015). https://doi.org/10.1145/ 2746266.2746267, https://doi.org/10.1145/...

    work page arXiv 2015

  5. [5]

    Electricity information sharing and analysis center (E-ISAC)388(1-29), 3 (2016)

    Case, D.U.: Analysis of the cyber attack on the ukrainian power grid. Electricity information sharing and analysis center (E-ISAC)388(1-29), 3 (2016)

    2016

  6. [6]

    In: Gollmann, D., Miyaji, A., Kikuchi, H

    Castellanos, J.H., Antonioli, D., Tippenhauer, N.O., Ochoa, M.: Legacy-compliant data authentication for industrial control system traffic. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) Applied Cryptography and Network Security. pp. 665–685. Springer International Publishing, Cham (2017)

    work page 2017

  7. [7]

    Commission, E.: Cyber resilience act, https://digital-strategy.ec.europa.eu/en/ library/cyber-resilience-act

    work page

  8. [8]

    IEEE Communications Surveys & Tutorials 23(4), 2248–2294 (2021)

    Conti, M., Donadel, D., Turrin, F.: A survey on industrial control system testbeds and datasets for security research. IEEE Communications Surveys & Tutorials 23(4), 2248–2294 (2021). https://doi.org/10.1109/COMST.2021.3094360

    arXiv 2021

Show all 58 references
  1. [9]

    In: EECS

    Cook, J., Freudenberg, J.: Controller area network (can). In: EECS. vol. 461, pp. 1– 5 (2007)

    2007

  2. [10]

    Cybsersecurity, (CISA), I.S.A.: Executive order on improving the nation’s cybersecurity (2021), https://www.cisa.gov/topics/cybersecurity-best-practices/ executive-order-improving-nations-cybersecurity

    2021

  3. [11]

    IEEE Transactions on Information Theory29(2), 198–208 (1983)

    Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory29(2), 198–208 (1983). https://doi.org/10.1109/TIT.1983. 1056650

    1983 doi

  4. [12]

    In: 2015 International Conference on Cyber Security of Smart Cities, Industrial Control System and Communications (SSIC)

    Drias, Z., Serhrouchni, A., Vogel, O.: Analysis of cyber security for industrial control systems. In: 2015 International Conference on Cyber Security of Smart Cities, Industrial Control System and Communications (SSIC). pp. 1–8 (2015). https://doi.org/10.1109/SSIC.2015.7245330

    2015

  5. [13]

    In: Proceedings of the 11th ACM Confer- ence on Security & Privacy in Wireless and Mobile Networks

    Dubrova, E., Näslund, M., Selander, G., Lindqvist, F.: Lightweight message au- thentication for constrained devices. In: Proceedings of the 11th ACM Confer- ence on Security & Privacy in Wireless and Mobile Networks. p. 196–201. WiSec ’18, Association for Computing Machinery, ...

    2018

  6. [14]

    Cryp- tography and communications10, 383–399 (2018) 18 A

    Dubrova, E., Näslund, M., Selander, G., Lindqvist, F.: Message authentication based on cryptographically secure crc without polynomial irreducibility test. Cryp- tography and communications10, 383–399 (2018) 18 A. Lotto et al

    2018

  7. [15]

    In: Palmer, C., Shenoi, S

    East, S., Butts, J., Papa, M., Shenoi, S.: A taxonomy of attacks on the dnp3 protocol. In: Palmer, C., Shenoi, S. (eds.) Critical Infrastructure Protection III. pp. 67–81. Springer Berlin Heidelberg, Berlin, Heidelberg (2009)

    2009

  8. [16]

    IEEE Internet of Things Journal6(1), 288–296 (2019)

    Esfahani, A., Mantas, G., Matischek, R., Saghezchi, F.B., Rodriguez, J., Bicaku, A., Maksuti, S., Tauber, M.G., Schmittner, C., Bastos, J.: A lightweight authen- tication mechanism for m2m communications in industrial iot environment. IEEE Internet of Things Journal6(1), 288–2...

    2019

  9. [17]

    In: 2018 13th IEEE International Conference on Industry Applications (INDUSCON)

    Ferst, M.K., de Figueiredo, H.F.M., Denardin, G., Lopes, J.: Implementation of secure communication with modbus and transport layer security protocols. In: 2018 13th IEEE International Conference on Industry Applications (INDUSCON). pp. 155–162 (2018). https://doi.org/10.1109/...

    2018

  10. [18]

    In: RSA conference

    Formby, D., Durbha, S., Beyah, R.: Out of control: Ransomware for industrial control systems. In: RSA conference. vol. 4, p. 8 (2017)

    2017

  11. [19]

    Fovino, I.N., Carcano, A., Masera, M., Trombetta, A.: Design and implementation ofasecuremodbusprotocol.In:Palmer,C.,Shenoi,S.(eds.)CriticalInfrastructure Protection III. pp. 83–96. Springer Berlin Heidelberg, Berlin, Heidelberg (2009)

    2009

  12. [20]

    Groza, B., Murvay, S., Herrewege, A.V., Verbauwhede, I.: Libra-can: Lightweight broadcast authentication for controller area networks. vol. 16. Association for Com- puting Machinery (apr 2017). https://doi.org/10.1145/3056506

    2017 doi

  13. [21]

    International Journal of Critical Infrastructure Protection1, 37–44 (2008)

    Huitsing, P., Chandia, R., Papa, M., Shenoi, S.: Attack taxonomies for the mod- bus protocols. International Journal of Critical Infrastructure Protection1, 37–44 (2008). https://doi.org/https://doi.org/10.1016/j.ijcip.2008.08.003, https://www. sciencedirect.com/science/articl...

    2008 doi

  14. [22]

    IEEE Access 11, 47007–47023 (2023)

    Katulić, F., Sumina, D., Groš, S., Erceg, I.: Protecting modbus/tcp-based indus- trial automation and control systems using message authentication codes. IEEE Access 11, 47007–47023 (2023). https://doi.org/10.1109/ACCESS.2023.3275443

    2023

  15. [23]

    IEEE Transactions on Industrial Electronics56(10), 4279–4287 (2009)

    Kjellsson, J., Vallestad, A.E., Steigmann, R., Dzung, D.: Integration of a wireless i/o interface for profibus and profinet for factory automation. IEEE Transactions on Industrial Electronics56(10), 4279–4287 (2009). https://doi.org/10.1109/TIE. 2009.2017098

    2009

  16. [24]

    In: International Conference on Dependable Systems and Networks, 2004

    Koopman, P., Chakravarty, T.: Cyclic redundancy code (crc) polynomial selection for embedded networks. In: International Conference on Dependable Systems and Networks, 2004. pp. 145–154 (2004). https://doi.org/10.1109/DSN.2004.1311885

    2004 arXiv

  17. [25]

    IEEE Communications Surveys & Tutorials16(3), 1391–1412 (2014)

    Kumar S., A.A., Ovsthus, K., Kristensen., L.M.: An industrial perspective on wire- less sensor networks — a survey of requirements, protocols, and challenges. IEEE Communications Surveys & Tutorials16(3), 1391–1412 (2014). https://doi.org/ 10.1109/SURV.2014.012114.00058

    2014

  18. [26]

    IEEE Security & Privacy 9(3), 49–51 (2011)

    Langner, R.: Stuxnet: Dissecting a cyberwarfare weapon. IEEE Security & Privacy 9(3), 49–51 (2011). https://doi.org/10.1109/MSP.2011.67

    2011 doi

  19. [27]

    Computers in Industry 103, 97–110 (2018)

    Lezzi, M., Lazoi, M., Corallo, A.: Cybersecurity for industry 4.0 in the cur- rent literature: A reference framework. Computers in Industry 103, 97–110 (2018). https://doi.org/https://doi.org/10.1016/j.compind.2018.09.004, https:// www.sciencedirect.com/science/article/pii/S01...

    2018 doi

  20. [28]

    In: 2012 International Conference on Cyber Security

    Lin, C.W., Sangiovanni-Vincentelli, A.: Cyber-security for the controller area net- work (can) communication protocol. In: 2012 International Conference on Cyber Security. pp. 1–7. IEEE (2012)

    2012

  21. [29]

    Lin, S., Costello, D.J.: Error control coding, vol. 2. Prentice Hall Scarborough (2001) Authenticated Cyclic Redundancy Integrity Check 19

    2001

  22. [30]

    Security and Communication Networks2023(1), 5486566 (2023)

    Liu, Z., Liang, T., Wang, W., Sun, R., Li, S.: Design and implementation of a lightweight security-enhanced scheme for modbus tcp protocol. Security and Communication Networks2023(1), 5486566 (2023). https://doi.org/https:// doi.org/10.1155/2023/5486566, https://onlinelibrary....

    2023 doi

  23. [31]

    IEEE Communications Surveys & Tutorials (2024)

    Lotto, A., Marchiori, F., Brighente, A., Conti, M.: A survey and comparative anal- ysis of security properties of can authentication protocols. IEEE Communications Surveys & Tutorials (2024). https://doi.org/10.1109/COMST.2024.3486367

    2024

  24. [32]

    In: 2020 Fourth World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4)

    Marasco, E.O., Quaglia, F.: Authentican: a protocol for improved security over can. In: 2020 Fourth World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4). pp. 533–538. IEEE (2020)

    2020

  25. [33]

    IEEE Internet of Things Journal6(5), 8182–8201 (2019)

    Meneghello, F., Calore, M., Zucchetto, D., Polese, M., Zanella, A.: Iot: Internet of threats? a survey of practical security vulnerabilities in real iot devices. IEEE Internet of Things Journal6(5), 8182–8201 (2019). https://doi.org/10.1109/JIOT. 2019.2935189

    2019

  26. [34]

    Miller, C., Valasek, C.: Remote exploitation of an unaltered passenger vehicle. vol. 2015 (2015)

    2015

  27. [35]

    Modbus.com:Modbusapplicationprotocolspecificationv1.1b3(April2012),https: //www.modbus.org/specs.php

  28. [36]

    Modbus.com: Modbus/tcp security (July 2021), https://www.modbus.org/specs. php

    2021

  29. [37]

    In: Chakraborty, M., Chakrabarti, S., Balas, V.E., Mandal, J.K

    Naher, N., Asaduzzaman, Haque, M.M.: Authentication of diffie-hellman pro- tocol against man-in-the-middle attack using cryptographically secure crc. In: Chakraborty, M., Chakrabarti, S., Balas, V.E., Mandal, J.K. (eds.) Proceedings of International Ethical Hacking Conference ...

    2019

  30. [38]

    In: 2017 IEEE 86th Vehicular Technol- ogy Conference (VTC-Fall)

    Nowdehi, N., Lautenbach, A., Olovsson, T.: In-vehicle can message authentication: An evaluation based on industrial criteria. In: 2017 IEEE 86th Vehicular Technol- ogy Conference (VTC-Fall). pp. 1–7. IEEE (2017)

    2017

  31. [39]

    In: Gierlichs, B., Poschmann, A.Y

    Nürnberger, S., Rossow, C.: – vatican– vetted, authenticated can bus. In: Gierlichs, B., Poschmann, A.Y. (eds.) Cryptographic Hardware and Embedded Systems – CHES 2016. pp. 106–124. Springer Berlin Heidelberg (2016)

    2016

  32. [40]

    509 certificate

    Pan, W.J., Feng, Z.L., Wang, Y.: Ads-b data authentication based on ecc and x. 509 certificate. Journal of Electronic Science and Technology10(1), 51–55 (2012)

    2012

  33. [41]

    In: Encyclopedia of Cryptography, Security and Privacy, pp

    Petitcolas, F.A.: Kerckhoffs’ principle. In: Encyclopedia of Cryptography, Security and Privacy, pp. 1–2. Springer (2023)

    2023

  34. [42]

    In: 2017 4th International Conference onControl,DecisionandInformationTechnologies(CoDIT).pp.0679–0683(2017)

    Pricop, E., Fattahi, J., Parashiv, N., Zamfir, F., Ghayoula, E.: Method for authen- tication of sensors connected on modbus tcp. In: 2017 4th International Conference onControl,DecisionandInformationTechnologies(CoDIT).pp.0679–0683(2017). https://doi.org/10.1109/CoDIT.2017.8102673

    2017

  35. [43]

    Wireless Personal Communications132(4), 2667–2692 (2023)

    Rajesh, L., Satyanarayana, P.: Design and development of secure data transfer modules in industrial control systems. Wireless Personal Communications132(4), 2667–2692 (2023)

    2023

  36. [44]

    IEEE Micro8(4), 62–75 (1988)

    Ramabadran, T., Gaitonde, S.: A tutorial on crc computations. IEEE Micro8(4), 62–75 (1988). https://doi.org/10.1109/40.7773

    1988 doi

  37. [45]

    Symmetry7(3), 1176–1210 (2015)

    Shahzad, A., Lee, M., Lee, Y.K., Kim, S., Xiong, N., Choi, J.Y., Cho, Y.: Real time modbus transmissions and cryptography security designs and enhancements of protocol sensitive information. Symmetry7(3), 1176–1210 (2015). https://doi. org/10.3390/sym7031176, https://www.mdpi....

    2015 doi

  38. [46]

    The Bell System Tech- nical Journal 28(4), 656–715 (1949)

    Shannon, C.E.: Communication theory of secrecy systems. The Bell System Tech- nical Journal 28(4), 656–715 (1949). https://doi.org/10.1002/j.1538-7305.1949. tb00928.x

    1949

  39. [47]

    In: 2020 19th RoEduNet Con- ference: Networking in Education and Research (RoEduNet)

    Stancu, F.A., Rughiniş, R.V., Trancă, C.D., Popescu, I.L.: Trusted industrial mod- bus firewall for critical infrastructure systems. In: 2020 19th RoEduNet Con- ference: Networking in Education and Research (RoEduNet). pp. 1–5 (2020). https://doi.org/10.1109/RoEduNet51892.2020.9324884

    2020

  40. [48]

    NIST Special Publication 800-82 Revision 3, National Institute of Standards and Technology, Gaithersburg, MD (2023)

    Stouffer, K., Pease, M., Tang, C., Zimmerman, T., Pillitteri, V., Lightman, S., Hahn, A., Saravia, S., Sherule, A., Thompson, M.: Guide to industrial control sys- tems (ics) security. NIST Special Publication 800-82 Revision 3, National Institute of Standards and Technology, G...

    2023 doi

  41. [49]

    Sensors19(19) (2019)

    Tidrea, A., Korodi, A., Silea, I.: Cryptographic considerations for automation and scada systems using trusted platform modules. Sensors19(19) (2019). https://doi. org/10.3390/s19194191, https://www.mdpi.com/1424-8220/19/19/4191

    2019 doi

  42. [50]

    In: Jajodia, S., Samarati, P., Cimato, S

    Tsang, P.P., Smith, S.W.: Yasir: A low-latency, high-integrity security retrofit for legacy scada systems. In: Jajodia, S., Samarati, P., Cimato, S. (eds.) Proceedings of The Ifip Tc 11 23rd International Information Security Conference. pp. 445–459. Springer US, Boston, MA (2008)

    2008

  43. [51]

    In: Proceedings of the 33rd Annual Computer Security Applications Conference

    Van Bulck, J., Mühlberg, J.T., Piessens, F.: Vulcan: Efficient component authen- tication and software isolation for automotive control networks. In: Proceedings of the 33rd Annual Computer Security Applications Conference. p. 225–237. AC- SAC ’17, Association for Computing Ma...

    2017

  44. [52]

    IEEE Communications Surveys & Tutorials 21(1), 619–639 (2019)

    Volkova, A., Niedermeier, M., Basmadjian, R., de Meer, H.: Security challenges in control network protocols: A survey. IEEE Communications Surveys & Tutorials 21(1), 619–639 (2019). https://doi.org/10.1109/COMST.2018.2872114

    2019

  45. [53]

    In: 2023 IEEE 48th Conference on Local Computer Networks (LCN)

    Wagner, E., Rothaug, N., Wolsing, K., Bader, L., Wehrle, K., Henze, M.: Retrofittingintegrityprotectionintounusedheaderfieldsoflegacyindustrialproto- cols. In: 2023 IEEE 48th Conference on Local Computer Networks (LCN). pp. 1–9 (2023). https://doi.org/10.1109/LCN58197.2023.10223384

    2023

  46. [54]

    Wang,S.,Huang,K.,Ma,K.,Xu,X.,Hu,X.:Alightweightencryptionandmessage authenticationframeworkforwirelesscommunication.IETCommunications 17(3), 265–278 (2023)

    2023

  47. [55]

    In: Jakobsson, M., Yung, M., Zhou, J

    Wright, A.K., Kinast, J.A., McCarty, J.: Low-latency cryptographic protection for scada communications. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) Applied Cryp- tography and Network Security. pp. 263–277. Springer Berlin Heidelberg, Berlin, Heidelberg (2004)

    2004

  48. [56]

    Journal of Physics: Conference Series1213(5), 052058 (jun 2019)

    Xuan, L., Yongzhong, L.: Research and implementation of modbus tcp security enhancement protocol. Journal of Physics: Conference Series1213(5), 052058 (jun 2019). https://doi.org/10.1088/1742-6596/1213/5/052058, https://dx.doi.org/10. 1088/1742-6596/1213/5/052058

    2019 doi

  49. [57]

    IEEE Transactions on Services Computing10(2), 165–175 (2017)

    Yang, A., Tan, X., Baek, J., Wong, D.S.: A new ads-b authentication frame- work based on efficient hierarchical identity-based signature with batch verifi- cation. IEEE Transactions on Services Computing10(2), 165–175 (2017). https: //doi.org/10.1109/TSC.2015.2459709

    2017

  50. [58]

    https: //doi.org/10.1145/3302509.3313783, https://doi.org/10.1145/3302509.3313783

    Ying, X., Bernieri, G., Conti, M., Poovendran, R.: Tacan: transmitter authentica- tionthroughcovertchannelsincontrollerareanetworks.In:Proceedingsofthe10th ACM/IEEEInternationalConferenceonCyber-PhysicalSystems.p.23–34.ICCPS ’19, Association for Computing Machinery, New York, ...

    2019

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.