Concept
Luhn algorithm
Related publications (7)
Towards Usable Checksums: Automating the Integrity Verification ofWeb Downloads for the Masses
Mathias Jacques Jean-Marc Humbert, Kévin Clément Huguenin, Igor Bilogrevic, Mauro Cherubini, Bertil Chapuis, Alexandre Meylan
Internet users can download software for their computers from app stores (e.g., Mac App Store and Windows Store) or from other sources, such as the developers' websites. Most Internet users in the US rely on the latter, according to our representative stud ...
ASSOC COMPUTING MACHINERY2018A Generic Algorithm for Checking Exhaustivity of Pattern Matching
Algebraic data types and pattern matching are key features of functional programming languages. Exhaustivity checking of pattern matching is a safety belt that defends against unmatched exceptions at runtime and boosts type safety. However, the presence of ...
Assoc Computing Machinery2016A generic algorithm for checking exhaustivity of pattern matching
Algebraic data types and pattern matching are key features of functional programming languages. Exhaustivity checking of pattern matching is a safety belt that defends against unmatched exceptions at runtime and boosts type safety. However, the presence of ...
2016Detection and Recovery From Pollution Attacks in Coding Based Distributed Storage Schemes
We address the problem of pollution attacks in coding based distributed storage systems. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decoding of a large part of the original dat ...
Institute of Electrical and Electronics Engineers2011Securing Coding Based Distributed Storage in Wireless Sensor Networks
We address the problem of pollution attacks in coding based distributed storage systems proposed for wireless sensor networks. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decodi ...
2008On the Complexity of Recognizing Iterated Differences of Polyhedra
The iterated difference of polyhedra has been proposed independently in [Zwie-Aart-Wess92] and [Shon93] as a sufficient condition for to be exactly computable by a two-layered neural network. An al ...
Springer-Verlag1997On the Complexity of Recognizing Iterated Differences of Polyhedra
The iterated difference of polyhedra has been proposed independently in [Zwie-Aart-Wess92] and [Shon93] as a sufficient condition for to be exactly computable by a two-layered neural network. An al ...
IDIAP1997