Maxim Integrated / Mbed OS MAXREFDES155#

DeepCover Embedded Security in IoT: Public-key Secured Data Paths

Dependencies:   MaximInterface

The MAXREFDES155# is an internet-of-things (IoT) embedded-security reference design, built to authenticate and control a sensing node using elliptic-curve-based public-key cryptography with control and notification from a web server.

The hardware includes an ARM® mbed™ shield and attached sensor endpoint. The shield contains a DS2476 DeepCover® ECDSA/SHA-2 coprocessor, Wifi communication, LCD push-button controls, and status LEDs. The sensor endpoint is attached to the shield using a 300mm cable and contains a DS28C36 DeepCover ECDSA/SHA-2 authenticator, IR-thermal sensor, and aiming laser for the IR sensor. The MAXREFDES155# is equipped with a standard Arduino® form-factor shield connector for immediate testing using an mbed board such as the MAX32600MBED#. The combination of these two devices represent an IoT device. Communication to the web server is accomplished with the shield Wifi circuitry. Communication from the shield to the attached sensor module is accomplished over I2C . The sensor module represents an IoT endpoint that generates small data with a requirement for message authenticity/integrity and secure on/off operational control.

The design is hierarchical with each mbed platform and shield communicating data from the sensor node to a web server that maintains a centralized log and dispatches notifications as necessary. The simplicity of this design enables rapid integration into any star-topology IoT network to provide security with the low overhead and cost provided by the ECDSA-P256 asymmetric-key and SHA-256 symmetric-key algorithms.

More information about the MAXREFDES155# is available on the Maxim Integrated website.

Bitmap.cpp@15:75404fab3615, 2018-01-19 (annotated)

Committer:
IanBenzMaxim
Date:
Fri Jan 19 10:28:27 2018 -0600
Revision:
15:75404fab3615
Parent:
13:6a6225690c2e 
Updated MaximInterface revision.

Who changed what in which revision?

UserRevisionLine numberNew contents of line
IanBenzMaxim 0:33d4e66780c0 1 /*******************************************************************************
IanBenzMaxim 0:33d4e66780c0 2 * Copyright (C) 2017 Maxim Integrated Products, Inc., All Rights Reserved.
IanBenzMaxim 0:33d4e66780c0 3 *
IanBenzMaxim 0:33d4e66780c0 4 * Permission is hereby granted, free of charge, to any person obtaining a
IanBenzMaxim 0:33d4e66780c0 5 * copy of this software and associated documentation files (the "Software"),
IanBenzMaxim 0:33d4e66780c0 6 * to deal in the Software without restriction, including without limitation
IanBenzMaxim 0:33d4e66780c0 7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
IanBenzMaxim 0:33d4e66780c0 8 * and/or sell copies of the Software, and to permit persons to whom the
IanBenzMaxim 0:33d4e66780c0 9 * Software is furnished to do so, subject to the following conditions:
IanBenzMaxim 0:33d4e66780c0 10 *
IanBenzMaxim 0:33d4e66780c0 11 * The above copyright notice and this permission notice shall be included
IanBenzMaxim 0:33d4e66780c0 12 * in all copies or substantial portions of the Software.
IanBenzMaxim 0:33d4e66780c0 13 *
IanBenzMaxim 0:33d4e66780c0 14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
IanBenzMaxim 0:33d4e66780c0 15 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
IanBenzMaxim 0:33d4e66780c0 16 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IanBenzMaxim 0:33d4e66780c0 17 * IN NO EVENT SHALL MAXIM INTEGRATED BE LIABLE FOR ANY CLAIM, DAMAGES
IanBenzMaxim 0:33d4e66780c0 18 * OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
IanBenzMaxim 0:33d4e66780c0 19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
IanBenzMaxim 0:33d4e66780c0 20 * OTHER DEALINGS IN THE SOFTWARE.
IanBenzMaxim 0:33d4e66780c0 21 *
IanBenzMaxim 0:33d4e66780c0 22 * Except as contained in this notice, the name of Maxim Integrated
IanBenzMaxim 0:33d4e66780c0 23 * Products, Inc. shall not be used except as stated in the Maxim Integrated
IanBenzMaxim 0:33d4e66780c0 24 * Products, Inc. Branding Policy.
IanBenzMaxim 0:33d4e66780c0 25 *
IanBenzMaxim 0:33d4e66780c0 26 * The mere transfer of this software does not imply any licenses
IanBenzMaxim 0:33d4e66780c0 27 * of trade secrets, proprietary technology, copyrights, patents,
IanBenzMaxim 0:33d4e66780c0 28 * trademarks, maskwork rights, or any other form of intellectual
IanBenzMaxim 0:33d4e66780c0 29 * property whatsoever. Maxim Integrated Products, Inc. retains all
IanBenzMaxim 0:33d4e66780c0 30 * ownership rights.
IanBenzMaxim 0:33d4e66780c0 31 *******************************************************************************/
IanBenzMaxim 0:33d4e66780c0 32
IanBenzMaxim 0:33d4e66780c0 33 #include <algorithm>
IanBenzMaxim 0:33d4e66780c0 34 #include "Bitmap.hpp"
IanBenzMaxim 0:33d4e66780c0 35
IanBenzMaxim 0:33d4e66780c0 36 static const int minWidthHeight = 1;
IanBenzMaxim 11:989eabe2a376 37 static const int pixelsPerSegment = 8;
IanBenzMaxim 0:33d4e66780c0 38
IanBenzMaxim 0:33d4e66780c0 39 template <typename T>
IanBenzMaxim 13:6a6225690c2e 40 static T divideRoundUp(const T dividend, const T divisor) {
IanBenzMaxim 13:6a6225690c2e 41 return (dividend / divisor) + (((dividend % divisor) == 0) ? 0 : 1);
IanBenzMaxim 0:33d4e66780c0 42 }
IanBenzMaxim 0:33d4e66780c0 43
IanBenzMaxim 13:6a6225690c2e 44 static int calculateSegmentsPerLine(int width) {
IanBenzMaxim 13:6a6225690c2e 45 return divideRoundUp(width, pixelsPerSegment);
IanBenzMaxim 11:989eabe2a376 46 }
IanBenzMaxim 11:989eabe2a376 47
IanBenzMaxim 13:6a6225690c2e 48 static int calculateHeight(size_t size, int width) {
IanBenzMaxim 13:6a6225690c2e 49 return static_cast<int>(divideRoundUp(
IanBenzMaxim 13:6a6225690c2e 50 size, static_cast<size_t>(calculateSegmentsPerLine(width))));
IanBenzMaxim 11:989eabe2a376 51 }
IanBenzMaxim 11:989eabe2a376 52
IanBenzMaxim 13:6a6225690c2e 53 static int calculateSegmentIndex(int x, int y, int width) {
IanBenzMaxim 13:6a6225690c2e 54 return y * calculateSegmentsPerLine(width) + x / pixelsPerSegment;
IanBenzMaxim 0:33d4e66780c0 55 }
IanBenzMaxim 0:33d4e66780c0 56
IanBenzMaxim 13:6a6225690c2e 57 static int calculatePixelMask(int x) {
IanBenzMaxim 13:6a6225690c2e 58 return 1 << (pixelsPerSegment - 1 - (x % pixelsPerSegment));
IanBenzMaxim 11:989eabe2a376 59 }
IanBenzMaxim 11:989eabe2a376 60
IanBenzMaxim 13:6a6225690c2e 61 Bitmap::Bitmap(int width, int height)
IanBenzMaxim 13:6a6225690c2e 62 : m_width(std::max(width, minWidthHeight)),
IanBenzMaxim 13:6a6225690c2e 63 m_height(std::max(height, minWidthHeight)),
IanBenzMaxim 13:6a6225690c2e 64 m_data(calculateSegmentsPerLine(m_width) * m_height, 0x00) {}
IanBenzMaxim 11:989eabe2a376 65
IanBenzMaxim 13:6a6225690c2e 66 Bitmap::Bitmap(const uint8_t * data, size_t size, int width)
IanBenzMaxim 13:6a6225690c2e 67 : m_width(std::max(width, minWidthHeight)),
IanBenzMaxim 13:6a6225690c2e 68 m_height(std::max(calculateHeight(size, width), minWidthHeight)),
IanBenzMaxim 13:6a6225690c2e 69 m_data(calculateSegmentsPerLine(m_width) * m_height, 0x00) {
IanBenzMaxim 13:6a6225690c2e 70 std::copy(data, data + size, m_data.begin());
IanBenzMaxim 0:33d4e66780c0 71 }
IanBenzMaxim 0:33d4e66780c0 72
IanBenzMaxim 13:6a6225690c2e 73 bool Bitmap::pixelEnabled(int x, int y) const {
IanBenzMaxim 13:6a6225690c2e 74 bool enabled = false;
IanBenzMaxim 13:6a6225690c2e 75 if ((x >= 0) && (x < m_width) && (y >= 0) && (y < m_height)) {
IanBenzMaxim 13:6a6225690c2e 76 enabled =
IanBenzMaxim 13:6a6225690c2e 77 m_data[calculateSegmentIndex(x, y, m_width)] & calculatePixelMask(x);
IanBenzMaxim 13:6a6225690c2e 78 }
IanBenzMaxim 13:6a6225690c2e 79 return enabled;
IanBenzMaxim 0:33d4e66780c0 80 }
IanBenzMaxim 0:33d4e66780c0 81
IanBenzMaxim 13:6a6225690c2e 82 void Bitmap::setPixelEnabled(int x, int y, bool enabled) {
IanBenzMaxim 13:6a6225690c2e 83 if ((x >= 0) && (x < m_width) && (y >= 0) && (y < m_height)) {
IanBenzMaxim 13:6a6225690c2e 84 uint8_t & dataSegment = m_data[calculateSegmentIndex(x, y, m_width)];
IanBenzMaxim 13:6a6225690c2e 85 uint8_t dataMask = calculatePixelMask(x);
IanBenzMaxim 13:6a6225690c2e 86 if (enabled) {
IanBenzMaxim 13:6a6225690c2e 87 dataSegment |= dataMask;
IanBenzMaxim 13:6a6225690c2e 88 } else {
IanBenzMaxim 13:6a6225690c2e 89 dataSegment &= ~dataMask;
IanBenzMaxim 0:33d4e66780c0 90 }
IanBenzMaxim 13:6a6225690c2e 91 }
IanBenzMaxim 0:33d4e66780c0 92 }
IanBenzMaxim 0:33d4e66780c0 93
IanBenzMaxim 13:6a6225690c2e 94 void Bitmap::overlay(int x, int y, const uint8_t * data, size_t size,
IanBenzMaxim 13:6a6225690c2e 95 int width) {
IanBenzMaxim 13:6a6225690c2e 96 if (width < minWidthHeight) {
IanBenzMaxim 13:6a6225690c2e 97 return;
IanBenzMaxim 13:6a6225690c2e 98 }
IanBenzMaxim 11:989eabe2a376 99
IanBenzMaxim 13:6a6225690c2e 100 const int segmentsPerLine = calculateSegmentsPerLine(width);
IanBenzMaxim 13:6a6225690c2e 101 for (size_t segment = 0; segment < size; segment++) {
IanBenzMaxim 13:6a6225690c2e 102 const int curY = segment / segmentsPerLine;
IanBenzMaxim 13:6a6225690c2e 103 if (!((y + curY) < m_height)) {
IanBenzMaxim 13:6a6225690c2e 104 break;
IanBenzMaxim 0:33d4e66780c0 105 }
IanBenzMaxim 13:6a6225690c2e 106 for (int pixel = 0; pixel < pixelsPerSegment; pixel++) {
IanBenzMaxim 13:6a6225690c2e 107 const int curX = (segment % segmentsPerLine) * pixelsPerSegment + pixel;
IanBenzMaxim 13:6a6225690c2e 108 if (!(((x + curX) < m_width) && (curX < width))) {
IanBenzMaxim 13:6a6225690c2e 109 break;
IanBenzMaxim 13:6a6225690c2e 110 }
IanBenzMaxim 13:6a6225690c2e 111 setPixelEnabled(x + curX, y + curY,
IanBenzMaxim 13:6a6225690c2e 112 data[segment] & (1 << (pixelsPerSegment - 1 - pixel)));
IanBenzMaxim 13:6a6225690c2e 113 }
IanBenzMaxim 13:6a6225690c2e 114 }
IanBenzMaxim 0:33d4e66780c0 115 }
IanBenzMaxim 10:71359af61af8 116
IanBenzMaxim 13:6a6225690c2e 117 void Bitmap::overlay(int x, int y, const Bitmap & src) {
IanBenzMaxim 13:6a6225690c2e 118 overlay(x, y, &src.m_data[0], src.m_data.size(), src.m_width);
IanBenzMaxim 10:71359af61af8 119 }
IanBenzMaxim 10:71359af61af8 120
IanBenzMaxim 13:6a6225690c2e 121 void Bitmap::clear() { std::fill(m_data.begin(), m_data.end(), 0); }
IanBenzMaxim 13:6a6225690c2e 122
IanBenzMaxim 13:6a6225690c2e 123 void Bitmap::clear(int x, int y, int width, int height) {
IanBenzMaxim 13:6a6225690c2e 124 if (!((x >= 0) && (x < m_width) && (y >= 0) && (y < m_height))) {
IanBenzMaxim 13:6a6225690c2e 125 return;
IanBenzMaxim 13:6a6225690c2e 126 }
IanBenzMaxim 13:6a6225690c2e 127 if ((x + width) > m_width) {
IanBenzMaxim 13:6a6225690c2e 128 width = m_width - x;
IanBenzMaxim 13:6a6225690c2e 129 }
IanBenzMaxim 13:6a6225690c2e 130 if ((y + height) > m_height) {
IanBenzMaxim 13:6a6225690c2e 131 height = m_height - y;
IanBenzMaxim 13:6a6225690c2e 132 }
IanBenzMaxim 13:6a6225690c2e 133
IanBenzMaxim 13:6a6225690c2e 134 const int startX = x;
IanBenzMaxim 13:6a6225690c2e 135 const int startY = y;
IanBenzMaxim 13:6a6225690c2e 136 while (y < (startY + height)) {
IanBenzMaxim 13:6a6225690c2e 137 x = startX;
IanBenzMaxim 13:6a6225690c2e 138 while (x < (startX + width)) {
IanBenzMaxim 13:6a6225690c2e 139 if (((x % pixelsPerSegment) == 0) &&
IanBenzMaxim 13:6a6225690c2e 140 ((x + pixelsPerSegment) < (startX + width))) {
IanBenzMaxim 13:6a6225690c2e 141 m_data[calculateSegmentIndex(x, y, m_width)] = 0;
IanBenzMaxim 13:6a6225690c2e 142 x += pixelsPerSegment;
IanBenzMaxim 13:6a6225690c2e 143 } else {
IanBenzMaxim 13:6a6225690c2e 144 setPixelEnabled(x, y, false);
IanBenzMaxim 13:6a6225690c2e 145 x++;
IanBenzMaxim 13:6a6225690c2e 146 }
IanBenzMaxim 10:71359af61af8 147 }
IanBenzMaxim 13:6a6225690c2e 148 y++;
IanBenzMaxim 13:6a6225690c2e 149 }
IanBenzMaxim 10:71359af61af8 150 }