Patent Grant
11985244
The present disclosure generally relates to data cryptography, and more particularly to systems and methods for improved data encryption in portable storage devices.
Communication between devices is typically performed over a network, such as the internet or a local area network. However, networks may not always be available for communication between devices and additionally may expose communications to security breaches on the network. Devices enabled with Bluetooth® may communicate directly. However, Bluetooth® enabled devices must be within a limited range, and communication speeds may be relatively slow. Consumers may have files stored on one device and wish to access the files from another device. It may be difficult to transfer the file without an internet connection or using data on a data plan. Additionally, transferring the information may expose the information to hackers and security breaches.
Information may be stored on portable storage devices (e.g., USB sticks) to facilitate the physical transfer of data from one device to a second device. Data retained on the storage device may be encrypted to partially prevent third parties from accessing and viewing the data. Typical encryption methods use cyphers to create data that is easy to encrypt but hard to reverse without knowing the cypher, or use one-way hashing to produce a hashed value that can be compared and confirmed to match, but the stored data can no longer be viewed. Typical encryption methods may be susceptible to attacks by hackers or other third parties
Systems and methods of encrypting a data file on a portable storage device is disclosed. The system may retrieve a plurality of math functions based on a password input. The system may apply the math functions to each byte in the data file. The system may transpose a position of bytes in the data file based on the password input. The system may add filler bytes into the data file based on the password input. The system may adjust a starting byte position of the data file based on the password input.
Data may be encrypted using the enclosed processes on any device, including portable storage devices. The systems and methods may provide a mechanism for one-way cyphering of data that cannot be reversed on its own without the same password/key used to encrypt the data. For example, a user may input a password/key to encrypt a selected data file. The selected data file may be encrypted by applying various math functions to the bytes of the data file and by rearranging and adding bytes in the data file, all based on the password/key. The password/key is not stored and is not included within the encrypted data, thus increasing the security of the encrypted data and decreasing the possibility of the password/key being compromised. A user may input a password/key to decrypt the encrypted data file. The user will only learn if the decryption was successful by viewing the decrypted data. In response to inputting an incorrect password/key during the decryption process (e.g., a password/key that does not match the original input password/key), the resulting decrypted data will be different than the original data before encrypting.
A more complete understanding may be derived by referring to the detailed description and claims when considered in connection with the Figures, wherein like reference numbers refer to similar elements throughout the Figures, and:
The detailed description of exemplary embodiments herein makes reference to the accompanying drawings and pictures, which show various embodiments by way of illustration. While these various embodiments are described in sufficient detail to enable those skilled in the art to practice the disclosure, it should be understood that other embodiments may be realized, and that logical and mechanical changes may be made without departing from the spirit and scope of the disclosure. Thus, the detailed description herein is presented for purposes of illustration only and not of limitation. For example, the steps recited in any of the method or process descriptions may be executed in any order and are not limited to the order presented. Moreover, any of the functions or steps may be outsourced to or performed by one or more third parties. Furthermore, any reference to singular includes plural embodiments, and any reference to more than one component may include a singular embodiment.
The present disclosure relates to systems, methods, and computer program products. In the detailed description herein, references to “various embodiments,” “one embodiment,” “an embodiment,” “an example embodiment,” etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to implement such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described. After reading the description, it will be apparent to one skilled in the relevant art(s) how to implement the disclosure in alternative embodiments.
Systems and methods are disclosed herein for the improved encryption of data. Data may be encrypted using the enclosed processes on any device including portable storage devices. The systems and methods may provide a mechanism for one-way cyphering of data that cannot be reversed on its own without the same password/key used to encrypt the data. A user may input a password/key to encrypt a selected data file. The selected data file may be encrypted by applying various math functions (based on the password/key) to the bytes of the data file and by rearranging and adding bytes in the data file, as discussed further herein. The password/key is not stored and is not included within the encrypted data, thus increasing the security of the encrypted data and decreasing the possibility of the password/key being compromised. The present disclosure may also decrease the susceptibility of encrypted data to brute force attacks by not having a check or confirmation that a decryption was successful or not successful. In that respect, a user may only learn if the decryption was successful by viewing the decrypted data. In response to inputting an incorrect password/key during the decryption process, the resulting decrypted data will be different than the original data before encrypting.
The systems and methods disclosed herein may enable communication between devices without connection to the Internet or other networks using an SCS. A standardized communication system (“SCS”) may be operable on the computing devices of the present disclosure. The SCS may comprise any combination of hardware and/or software. The SCS may utilize existing physical components of the device, such as 802.11 or 802.2(2) wireless chips and Bluetooth® systems in order to communicate with other devices. The SCS may be suitable for any communication protocol, such as IP, TCP/UDP, Bluetooth®, raw Manchester encoding, and any other form of wireless communication.
The SCS may allow communication between devices of varying types and platforms. Additionally, as communication may be directly between devices without transmitting data across a network, communication may be available when networks are unavailable, and communications may be protected from eavesdroppers on a network. Furthermore, direct communication between devices may avoid data charges on cellular data plans.
Referring to
In various embodiments, the SCS may implement a standardized communication protocol (“SCP”) on a device. SCP may attach an SCP header 152 to a packet in order to identify a datagram 150 as an SCP datagram. First device 110 may communicate with second device 120 via SCP. The SCS may recognize the SCP header and may follow the SCP. The SCP may define the ability for devices to discover one another, to request the transfer of raw data, to transmit confirmations on receipt of data, and to perform any other steps involved with transmitting data.
In various embodiments, the SCS may be implemented at the network layer in the Open Systems Interconnection (“OSI”) model (or the Internet layer in the TCP/IP model). Regardless of the protocol being used at the transport layer (e.g. TCP, UDP, SCTP, DCCP), the SCP header may allow devices comprising an SCS to communicate via SCP.
In various embodiments, at least one of first device 110 and second device 120 may comprise a smartphone. However, in various embodiments, first device 110 and second device 120 may comprise any type of device capable of transmitting and/or receiving data.
Referring to
First device 110 may discover available devices (step 210). First device 110 may attempt to discover other devices by a variety of methods. In various embodiments, first device 110 may discover other devices via a camera or other optical device. In various embodiments, second device 120 may display a symbol, such as a QR-code, a barcode, or text. The symbol may comprise identifying characteristics about second device 120. For example, in various embodiments the identifying characteristics may comprise at least one of a device name, an IP address of the device, an owner name, an endpoint of the device, and the available transport layers on the device. First device 110 may scan the symbol using a camera. First device 110 may obtain the identifying characteristics from the symbol and use the identifying characteristics in order to transmit data to second device 120.
In various embodiments, the SCS on first device 110 may search for other devices using a wireless chip in first device 110. Devices comprising an SCS may transmit a broadcast message. The broadcast message may comprise the identifying characteristics of the device. In various embodiments, first device 110 may be within transmission range of second device 120. The transmission range may depend on the specific type of wireless chips in first device 110 and second device 120. However, in various embodiments, the transmission range may be up to about 200 feet-300 feet. The SCS may open a socket on first device 110 to listen for broadcast messages. The broadcast message may be sent by a variety of hardware. For example, the broadcast message may be transmitted via an 802.11 wireless chip, Bluetooth® chip, or NFC.
In various embodiments, first device 110 and second device 120 may not be within transmission range of each other. However, an intermediary device, such as a smartphone equipped with hotspot technology, may be within transmission range of first device 110. First device 110 may search for available devices by transmitting a message to intermediary device, instructing intermediary device to look for available devices. Intermediary device may receive a broadcast message from second device 120, and intermediary device may transmit the broadcast message to first device 110. Thus, first device 110 may discover second device 120 without connecting to the internet or a cellular network even though first device 110 may not be within transmission range of second device 120. In various embodiments, any number of intermediary devices may be daisy-chained, such that first device 110 may discover second device 120 from miles apart by transmitting data via a series of intermediary devices.
First device 110 may display a list of all discovered devices to the user. The user may select second device 120 in order to transmit data to second device 120. The user may select a file or message to be transmitted to second device 120.
The SCS 112 on first device 110 may determine the transmission hardware to utilize for the transmission (step 220). In various embodiments, first device 110 and second device 120 may each have only one type of transmission hardware, such as an 802.11 wireless chip, and the SCS 112 may thus select the 802.11 wireless chip to transmit the data. However, in various embodiments, multiple transmission paths may be available between first device 110 and second device 120. For example, first device 110 and second device 120 may each comprise an 802.11 wireless chip and a Bluetooth® chip. In various embodiments, the SCS 112 may determine the fastest transmission path, and may select the fastest transmission path to transmit the data. In various embodiments, the transmission path may be selected by default settings. For example, SCS 112 may always select an 802.11 wireless path for transmission when available, and if the 802.11 wireless path is not available, SCS 112 may select a Bluetooth® path. However, in various embodiments, the SCS 112 on first device 110 may transmit a speed test message to second device 120 via each available transmission path, and the SCS 112 may select the fastest transmission path based on the speed test results.
In various embodiments, the SCS 112 may instruct first device 110 to send the data to second device 120 via multiple transmission paths. A message may be divided into multiple packets. SCS 112 may analyze the available transmissions paths and send the message over multiple transmission paths in order to expedite transmission of the entire message. For example, SCS 112 may determine that the fastest method of transmitting the message may be to transmit 90% of the packets via an 802.11 wireless path, and 10% of the packets over a Bluetooth® path. SCS 112 may attach an SCP header to each packet being transmitted to second device 120, whether via 802.11 wireless or Bluetooth®. Thus, SCS 122 on second device 120 may recognize the packets as being received by SCP, and SCS 122 may reassemble the packets in order to recreate the entire message. In various embodiments, SCS 112 may analyze all transmission paths available, including but not limited to multiple 802.11 wireless chips, Bluetooth® chips, NFC, PDQ, or any other transmission paths in order to select the fastest transmission method. The SCS on first device 110 may initiate a file send protocol and transmit the data to second device 120 (step 230).
In various embodiments, first device 110 and second device 120 may be connected to the same local network. First device 110 may transmit a link, such as a QR-code, over a cellular network or the local network to second device 120. In various embodiments, the link may comprise 10 kb or less of data. Second device 120 may use the link to request or accept a file transfer. First device 110 may transmit a file over the local network. In various embodiments, the file may be transferred using TCP/IP directly over the local network.
In various embodiments, second device 120 may have access to an internet connection. First device 110 may transmit a link over a cellular transmission path to second device 120, and second device 120 may use the link to download a file stored on the cloud and/or on a server over the internet. In various embodiments, second device 120 may download the file using TCP/IP.
In various embodiments, first device 110 may sync its contents with a cloud database. In various embodiments, first device 110 may comprise an SCS folder, and only files stored in the SCS folder may be synced with the database. First device 110 may transmit a link over a cellular transmission path to second device 120 identifying a file stored on the database. In various embodiments, second device 120 may not have access to an 802.11 wireless network at the time second device 120 receives the link. Second device 120 may use the link to access the file whenever second device 120 gains access to an 802.11 wireless network in order to prevent cellular data charges. In various embodiments, second device 120 may use the link to access the file over the cellular network. In various embodiments, second device 120 may stream all or part of the file over either the cellular network or an 802.11 wireless network.
In various embodiments, first device 110 may share an online folder with second device 120. First device 110 may indicate that second device 120 may have access to an online folder. First device 110 may sync with the online folder to upload files stored on first device 110 to the online folder. Second device 120 may sync with the online folder to download files stored in the online folder to second device 120.
Referring to
In various embodiments, first device 110 may transmit a message comprising a cypher book to second device 120 (step 330). The cypher book may comprise a list of one-time cyphers and may allow second device 120 to decrypt data sent to second device 120 over the secure socket connection using one-time cyphers. In various embodiments, first device 110 may encrypt the message comprising the cypher book using known encryption methods, such as Advanced Encryption Standard (“AES”) or RSA encryption. However, subsequent messages during the transfer session may be encrypted using the one-time cyphers contained in the cypher book. The messages encrypted using the one-time cyphers may be encrypted and decrypted using significantly less processing power and time than messages encrypted with AES or RSA. Additionally, the messages sent using the one-time cyphers may be indecipherable to parties not containing the cypher book.
First device 110 may send a file transfer request (step 340). For an example of a file transfer request, refer to
Referring to
Referring to
Referring to
Referring to
Referring to
The PSD 800 may comprise a storage module 810, a communication module 820, a processor 830, and a battery 805. The storage module 810 may comprise a memory card. For example, the storage module 810 may comprise an SD card, an xD card, a CompactFlash card, or any other suitable memory card. The storage module 810 may comprise an internal memory, such as iSSD, SSD, iNAND, or flash SD. The communication module 820 may comprise one or more components capable of wireless communication. For example, the communication module may comprise an 802.11 or 802.2(2) wireless chip, a Bluetooth® chip, an NFC chip, etc. The processor 830 may comprise any combination of hardware and/or software capable of providing instructions to the storage module 810 and the communication module 820.
The PSD 800 may comprise a standard communication system (“SCS”) as previously described herein. The SCS may be any combination of hardware and/or software which is capable of communicating via a standard communication protocol (“SCP”) as previously described herein. In various embodiments, the SCS may be implemented on at least one of the storage module 810, the communication module 820, or the processor 830. The PSD 800 may wirelessly receive and transmit files and communications from other devices, such as smartphones, televisions, game consoles, tablets, personal computers, printers, etc. Due to the SCS, the PSD 800 may not be limited to communicating with any particular brand or manufacturer of device. In contrast, the PSD 800 may communicate across platforms, such as with Apple® devices, Android® devices, Windows® devices, UNIX® devices, or any other suitable devices.
In various embodiments, the PSD 800 may allow a user to access their files wherever the user goes. For example, a user may have a document stored on a laptop computer. The user may transmit the document from the laptop computer to the PSD 800 using the SCS. The PSD 800 may store the document in the storage module 810. The user may then transmit the document from the PSD 800 to another device, such as a smartphone, using the SCS.
In various embodiments, the PSD 800 may communicate directly with other devices without using a network. Thus, information may be transmitted securely between the PSD 800 and other devices. However, in various embodiments, the PSD 800 may communicate over a network using a wireless chip in the communication module 820. The communication module 820 may comprise two wireless chips, allowing the PSD 800 to simultaneously communicate over a network on a first wireless chip and directly to another device on a second wireless chip.
In various embodiments, the PSD 800 may allow data to be transferred from a device to the PSD 800 without storing the data on the device. For example, a smartphone may capture a picture and transmit the picture directly to the PSD 800 using the smartphone's RAM without storing the picture on the hard drive of the smartphone. Thus, the smartphone may be lost, stolen, sold, or donated without risk of a third-party obtaining the picture, or other data which is stored on the PSD 800 and not the smartphone. Similarly, a user may initiate an SCS on a device, such as a laptop, and open a file stored on the PSD 800 using the device. The user may edit the file on the device and save the edited file directly on the PSD 800 without saving the edited file on the device.
A user may use the PSD 800 to store all of the user's files. Regardless of what device a user is using to access the files on the PSD 800, the user may create, edit, and delete files directly on the PSD 800 using another device, such as a personal computer. In various embodiments, the PSD 800 may emulate a network drive. Thus, the PSD 800 may be able to communicate with devices which are not capable of downloading or installing custom software. For example, the PSD 800 may emulate a DLNA media service, or a Windows® network. The PSD 800 may require a password to be entered on the device, and the device may then access files stored on the PSD 800.
In various embodiments, the PSD 800 may automatically sync when charging the battery 805 and may charge wirelessly or on a charging cable. The PSD 1010 may reach a predefined battery level prior to initiating the sync. For example, when placed on a charger, the PSD 1010 may initiate a sync in response to the battery level reach at least 50%, or at least 90%. The PSD 1010 may sync to any location specified by a user, such as the server 1030, a local device, or another PSD.
In various embodiments, PSD 800 may comprise any suitable form factor having any suitable size and shape. For example, and with reference to
The surfaces of housing 902 may leave exposed various interfaces and components. For example, surface 905 of housing 902 may include electronic interface panel 904. Electronic interface panel 904 may further include conductive pads 906 disposed slightly proud from, flush with, or slightly recessed from surface 905. Conductive pads 906 may form an electrical connection with conductive pins and/or conductive pads formed on an opposing surface in contact with or near to surface 905. In various embodiments, electronic interface panel 904 may further comprise a data port 908 exposed from housing 902. Data port 908 may be configured to transmit power and/or signals over electronic connections in a predetermined format. For example, data port 908 may use a protocol such as USB, firewire, lightning cable, SATA, PCIe, or other suitable cable interface for data and/or power transfer. Data port 908 may also use a proprietary pin configuration and slot geometry.
In various embodiments, housing 902 may further include surface 915 having a rectangular geometry as depicted in a top view by
Referring now to
In various embodiments, case 1012 may include an interface 1018 suitable for communication with data port 908 or conductive pads 906 (e.g., of
In various embodiments, case 1012 may enable electronic communication between portable storage device 900, a power supply, a printed circuit board PCB (“PCB”), or other electronic devices retained within case 1012. Case 1012 may further enable electronic communication of power and/or data to and/or from the mobile device retained within case 1012. Portable storage device 900 may also be in wireless communication with the mobile device retained within case 1012 as described herein.
In various embodiments, PSD 900 may also comprise modular components to be coupled together, such as a primary module and a secondary module. The primary module may comprise computing components, such as a processor, hard drive, wireless chip, battery, etc. Various secondary modules may be removably coupled to the primary module, such as batteries, charging stations, storage units, LTE hotspot devices, cover plates, cameras, virtual reality units, speakers, video screens, user interfaces, etc. The secondary modules may comprise connection posts which mate with receiving slots in the primary module to couple the primary and secondary components together. An alignment post on the secondary module may mate with an alignment depression in the primary module. Metallic pins on the secondary module may contact pads on the primary module to allow for the exchange of electronic signals between the primary module and the secondary module.
The primary module may wirelessly receive and transmit files and communications from other devices, such as cameras, smartphones, televisions, game consoles, tablets, personal computers, printers, etc. The primary module may communicate across platforms, such as with Apple® devices, Android® devices, Windows® devices, UNIX® devices, or any other suitable devices. In various embodiments, the primary module may allow a user to access their files wherever the user goes. For example, a user may have a document stored on a laptop computer. The user may transmit the document from the laptop computer to the primary module wirelessly. In various embodiments, the primary module may communicate directly with other devices without using a network. Thus, information may be transmitted securely between the primary module and other devices. However, in various embodiments, the primary module may communicate over a network using a wireless chip in the primary module. For more information regarding the capabilities of a primary module, see U.S. patent application Ser. No. 15/367,961 titled “SYSTEMS AND METHODS FOR MEMORY CARD EMULATION,” and filed on Dec. 2, 2016, the contents of which are incorporated by reference herein in their entirety.
Referring to
The primary module 1100 may further comprise a connection port 1130. The connection port 1130 may be configured to receive a cord to connect the primary module 1100 to other components, such as a computer, camera, printer, etc. In various embodiments, the connection port 1130 may be a USB Type C port, any other USB Type port, a serial port, or any other type of connection port capable of connecting to other devices. However, the USB Type C port allows the primary module to be constructed in a very thin package. For example, in various embodiments, a height of the primary module 1100 is less than 0.3 inches. In various embodiments, the connection port 1130 may be located on the front side 1104 of the primary module 1100 between the first pin set 1102 and the second pin set 1104.
Referring to
For the first pin set 1110, the first pin 1201 may comprise a battery pack positive pin, the second pin 1202 may comprise a battery pack positive pin, the third pin 1203 may comprise a system ground pin, the fourth pin 1204 may comprises a USB 2.0 Data (+) pin, the fifth pin 1205, may comprise a USB 2.0 Data (−) pin, the sixth pin 1206 may comprise a system ground pin, the seventh pin 1207 may comprise a UART data receive pin, the eighth pin 1208 may comprise a UART data transmit pin, the ninth pin 1209 may comprise a system ground pin, and the tenth pin 1210 may comprise a system ground pin.
For the second pin set 1120, the first pin 1301 may comprise an external power positive pin, the second pin 1302 may comprise an external power positive pin, the third pin 1303 may comprise a battery pack temperature sensor pin, the fourth pin 1304 may comprise an on switch/signal (low) pin, the fifth pin 1305 may comprise a reset signal (low) pin, the sixth pin 1306 may comprise a mode select (low) pin, the seventh pin 1307 may comprise a serial com data pin, the eighth pin 1308 may comprise a serial com clock pin, the ninth pin 1309 may comprise a system ground pin, and the tenth pin 1310 may comprise a system ground pin.
Referring to
The phone case 1330 may comprise a first pin set 1333 and a second pin set 1334. The first pin set 1333 and the second pin set 1334 may be configured to interface with the pins on the primary module 1100. In various embodiments, the first pin set 1333 and the second pin set 1334 on the phone case 1330 may be male pins, and the pins on the primary module 1100 may be female pins. In various embodiments, the pins on the primary module 1100 may be male pins, and the first pin set 1333 and the second pin set 1334 may be female pins.
The phone case 1330 may comprise a module reception cavity 1335. The module reception cavity 1335 may be configured to receive the primary module 1100. The module reception cavity 1335 may comprise the same size and shape as the primary module 1100. The phone case 1330 may further comprise a phone reception cavity 1336 which is configured to receive the phone 1340. The module reception cavity 1335 may comprise a back wall 1337 which is configured to keep the primary module 1100 within place between the back wall 1337 and the phone 1340 when the phone 1340 is inserted within the phone reception cavity 1336.
The phone case 1330 may comprise a phone jack 1338. The phone jack 1338 may be configured to electrically connect the battery 1332 and/or primary module 1100 to the phone 1340 via a connection port in the phone 1340. The connection port may be a standard port typically used to charge and transfer data to/from the phone 1340. The phone case 1330 may comprise internal wires 1339 which connect the primary module 1100, the battery 1332, and the phone jack 1338.
Referring to
As previously discussed, the primary module 1100 may be capable of wirelessly communicating with other devices. However, in various embodiments, the primary module 1100 may be able to transfer and receive data faster using a wired connection rather than a wireless connection. Thus, by electrically connecting the primary module 1100 to the phone as shown in
Those skilled in the art will recognize that various pin configurations may be utilized. Additionally, although only two secondary modules have been illustrated, many different sizes, shapes, and functions of secondary modules may couple to the primary module. Although the illustrated embodiments comprise connection posts and pins on the secondary modules, in various embodiments, the connection posts and/or the pins may be located on the primary module, and the receiving slots and/or contact pads may be located on the secondary modules.
In various embodiments, and with reference to
In various embodiments, storage module 1510 may be similar to storage module 810, with brief reference to
In various embodiments, encryption module 1540 may comprise any combination of hardware and/or software and may be configured to encrypt and decrypt data files. Encryption module 1540 may comprise a sub-component of processor 1530, or may comprise a physically and/or logically distinct component of PSD 1500. Encryption module 1540 may be configured to perform various operations to encrypt and/or decrypt data, as discussed further herein.
In various embodiments, encryption module 1540 may comprise a math function list 1545. Math function list 1545 may comprise a database (e.g., relational, hierarchical, graphical, blockchain, or object-oriented structure), a flat file structure, and/or any other suitable data structure capable of storing and maintaining data. Math function list 1545 may contain one or more math functions. As used herein, a “math function” may refer to any suitable mathematical and reversible function that can be applied to alter data bytes. For example, an exemplary math function may comprise instructions to divide a byte by two (2) and generate random halves from the two bytes (e.g., a byte comprising a value of 100 would be divided into two separate bytes, and byte[0] may be assigned a value of 57 whereas byte[1] may be assigned a value of 43). Math function list 1545 may comprise any suitable number of math functions. The math functions in math function list 1545 may be ordered in a numerical order, with each math function being assigned a corresponding numerical value (e.g., an identifier) corresponding to the numerical ordering (e.g., 1, 2, 3, 4, etc.). In various embodiments, a user may interact with PSD 1500 to input additional math functions into math function list 1545 (via a secondary device in logical communication with PSD 1500, via direct input, or the like).
In various embodiments, and with reference to
Method 1601 may comprise receiving a password input (step 1602). PSD 1500, via communication module 1520 or processor 1530, may be configured to receive the password input. The password input may comprise any suitable combination of letters, numbers, and symbols, and may be input to encrypt a data file, as discussed further herein. The password input may be input by a user via any suitable input device (e.g., keyboard, mouse, touchscreen, etc., or a secondary device in logical communication with PSD 1500). Processor 1530 may be configured to parse the password input to determine the number of bytes in the password input. Processor 1530 may also be configured to determine a decimal value of each byte. For example, a password input of “Hello1” comprises six (6) total bytes (e.g., “H” as byte[0], “e” as byte[1], “1” as byte[2], “1” as byte[3], “o” as byte[4], and “1” as byte[5]). Each byte may comprise a numerical value based on the American Standard Code for Information Interchange (ASCII) decimal value of each byte. For example, byte[0] corresponding to character “H” may comprise an ASCII decimal value of 72; byte[1] corresponding to character “e” may comprise an ASCII decimal value of 101; byte[2] corresponding to character “1” may comprise an ASCII decimal value of 108; byte[3] corresponding to character “1” may comprise an ASCII decimal value of 108; byte[4] corresponding to character “o” may comprise an ASCII decimal value of 111; and byte[5] corresponding to character “1” may comprise an ASCII decimal value of 49.
In various embodiments, method 1601 may comprise randomizing the password input (step 1604). Processor 1530 may be configured to randomize the password input. The password input may be randomized to vary the length of the password. Varying the password length may increase the strength of the encryption and partially reduce the correct guess of the password input by a third party or hacker. The password input may be randomized using any suitable technique. For example, processor 1530 may randomize the password input based on a comparison of the decimal values of each byte in the password input. In that regard, the password input may be randomized byte by byte. For example, beginning with byte[0] and looping through all of the bytes, in response to the decimal value byte[0] being greater than the decimal value byte[1], the decimal value of byte[0] may be added to the decimal value of byte[0], or in response to the decimal value byte[0] being less than or equal to the decimal value byte[1], the decimal value of byte[2] may be added to the decimal value of byte[0]; in response to the modulus of the decimal value of byte[0] with the decimal value of byte[2] being greater than the decimal value of byte[2], the decimal value of byte[0] is subtracted by the decimal value of byte[1], or in response to the modulus of the decimal value of byte[0] with the decimal value of byte[2] being less than or equal to the decimal value of byte[2], the decimal value of byte[0] is multiplied by 2; and/or the like. In that respect, all of the bytes in the password input may be randomized. In various embodiments, processor 1530 may implement modulus logic such that the decimal value of each byte is not randomized to a number greater than the list size of math function list 1545.
In various embodiments, method 1601 may comprise selecting math functions based on each byte in the password input (step 1606). Processor 1530 may be configured to transmit the password input, the byte data, and the decimal value data to encryption module 140. Encryption module 1540 may be configured to retrieve and select the math functions from math function list 1545. In that respect, each math function in math function list 1545 may be ordered in a numerical order, and each math function may be assigned a corresponding numerical value corresponding to the ordering (e.g., 1, 2, 3, 4, etc.). Encryption module 1540 may retrieve and select a math function for each byte in the password input based on the bytes decimal value. For example, given the above example relating to the data input of “Hello1,” encryption module 1540 may select the math function assigned numerical value 72 for byte[0], the math function assigned numerical value 101 for byte[1], the math function assigned numerical value 108 for byte[2], the math function assigned numerical value 108 for byte[3], the math function assigned numerical value 111 for byte[4], and the math function assigned numerical value 49 for byte[5].
In various embodiments, method 1601 may comprise retrieving a data file to be encrypted (step 1608). Encryption module 1540 may be configured to retrieve the data file from storage module 1510. In various embodiments, the data file may also be input and received into PSD 1500, via communication module 1520 and/or processor 1530, and transmitted to encryption module 1540 for encryption.
In various embodiments, method 1601 may comprise applying a first math function to each byte in the data file (step 1610). Encryption module 1540 may be configured to apply the first math function (e.g., the math function selected based on byte[0] of the password) to each byte in the data file. For example, encryption module 1540 may apply the first math function to each byte in consecutive order (e.g., byte[0], byte[1], byte[2], etc.), until the first math function is applied all of the bytes in the data file.
In various embodiments, method 1601 may comprise iterating step 1610 for the remaining selected math functions (step 1612). In that respect, encryption module 1540 may be configured to continue applying the math functions to each byte in the data file until all of the selected math functions have been applied. For example, given the example of “Hello1” having six (6) total bytes, thus six (6) total selected math functions, encryption module 1540 may repeat step 1610 five (5) additional times to separately apply each math function selected in step 1606.
In various embodiments, method 1601 may comprise repeating the application of math functions to the data file (step 1614). Encryption module 1540 may be configured to repeat the application of math functions. Steps 1610, 1612 may be repeated any suitable and/or desirable number of times. For example, steps 1610, 1612 may be repeated based on a user input or a stored value. In various embodiments, steps 1610, 1612 may be repeated based on a decimal value of one of the bytes from the data input. For example, given the above example of “Hello1” wherein byte[2] comprises an ASCII decimal value of 108, steps 1610, 1612 may be repeated 108 times (e.g., all of the math functions are applied 108 times). Encryption module 1540 may be pre-configured to select a specific byte in the data input (e.g., byte[0], byte[1], etc.) to determine the number of times to repeat steps 1610, 1612.
In various embodiments, method 1601 may comprise transposing the position of bytes in the data file (step 1616). The byte positions in the data file may be transposed to partially prevent any relational patterns from being discovered in the encrypted data file. Encryption module 1540 may be configured to transpose the data file bytes. Encryption module 1540 may transpose the data file bytes using any suitable process. For example, the data file bytes may be transposed based on the password input bytes, such as, for example, by transposing the data file byte at the current position (starting with byte[0]) with the data file byte at the position offset of the current data file byte in the password input byte. For example, in response to the first byte in the password input comprising an ASCII decimal value of three (3), the first data file byte (e.g., byte[0]) may be transposed with the data file byte that is offset by three (3) bytes (e.g., byte[3]). As a further example, each byte may be transposed based on the ASCII decimal value of the byte. For example, in response to byte[0] comprising a decimal value of 3, byte[0] may be transposed with byte[2]; in response to byte[2] comprising a decimal value of 15, byte[2] may be transposed with byte[15]; and the like. In various embodiments, the data file bytes may continue to be transposed until every data file byte has been transposed. In various embodiments, the bytes may continue to be transposed based on a predetermined number of transpositions, or the like.
In various embodiments, method 1601 may comprise adding filler bytes to the data file (step 1618). Filler bytes may be added to the data file to ensure that the password input length or original data file length (e.g., before the process of method 1601 is applied) cannot be determined by the finished file size of the data file. Encryption module 1540 may be configured to add the filler bytes to the data file. The filler bytes may be added using any suitable process. For example, the filler bytes may be added based on a minimum file size and/or a maximum file size. The minimum file and/or the maximum file size may be specified by a user, and may comprise any suitable file size. In various embodiments, the maximum file size may be constrained by the free disk or memory space in storage module 1510. In various embodiments, encryption module 1540 may be configured to add filler bytes to the data file until the data file size is greater than the minimum file size and less than the maximum file size. In various embodiments, the filler bytes may be added based on the password input. For example, the decimal value of byte[0] may be multiplied with the decimal value of byte[1] from the password input to calculate the total number of filler bytes to add.
In various embodiments, method 1601 may comprise adjusting the starting position of the data file (step 1620). Encryption module 1540 may be configured to adjust the starting position of the data file. The starting position of the data file may be adjusted to partially protect against attacks by hackers or third parties on the initial file headers of the data file, or on the start position of the data file. The starting position of the data file may be adjusted using any suitable technique. For example, the starting position may be calculated and adjusted based on the password input, such as, for example, by calculating a starting position value. The start position value may be calculated by selecting a data byte from the password input to generate the starting position value.
In response to the modulus of byte[1] being greater than the decimal value of byte[2], the starting position value is multiplied by 5; in response to the modulus of byte[2] being less than the decimal value of byte[3], the starting position value is divided by 3, or in response to the modulus of byte[2] being greater than or equal to the decimal value of byte[3], the starting position value is multiplied by 2; in response to the modulus of byte[3] being 0 the starting position value is assigned a value of 0; in response to the decimal value of byte[4] being greater than byte[2] the starting position value is added to the decimal value of byte[4], byte[1], and byte[2] multiplied together; and/or the like. The starting point of the data file may be assigned based on the starting position value.
In various embodiments, the resulting encrypted data file may be stored in storage module 1510, or transmitted to any other suitable storage. In that respect, the encrypted data file may not comprise a known file extension (e.g., .exe, .pdf, etc.), and/or may not comprise the file extension of the original data file. In various embodiments, a random extension may be assigned to the encrypted data file. In various embodiments, PSD 1500 may comprise a file manager, graphic user interface, or other suitable software interface configured to allow users to track encrypted data files and the corresponding original data file and data name. In various embodiments, a data file list may be stored, maintained, and secured in storage module 1510 to track the encrypted data file and the corresponding original data file and data name.
In various embodiments, the encrypted data file may be decrypted using the same or similar steps as in method 1601. In that respect, in response to receiving a second password input, processor 1530 may randomize the second password input similar to the randomization in step 1604. Encryption module 1540 may adjust the starting byte position of the encrypted data file based on the second password input, similar to step 1618. Encryption module 1540 may remove the filler bytes from the encrypted data file based on the second password input, similar to step 1616. Encryption module 1540 may retrieve math function list 1545 and select math functions based on the second password input's bytes, similar to step 1606. Encryption module 1540 may apply each selected math function to each byte in the data file and repeat the application of the match functions based on the second password input's bytes, in the reverse of steps 1610, 1612, and 1614. In that regard, the encrypted data file may be decrypted. In response to the second password input matching the password input, the decrypted data file will be the same as the original data file. In response to the second password input not matching the password input, the decrypted data file will not be the same as the original data file.
In various embodiments, the methods described herein are implemented using the various particular machines described herein. The methods described herein may be implemented using the below particular machines, and those hereinafter developed, in any suitable combination, as would be appreciated immediately by one skilled in the art. Further, as is unambiguous from this disclosure, the methods described herein may result in various transformations of certain articles.
For the sake of brevity, conventional data networking, application development and other functional aspects of the systems (and components of the individual operating components of the systems) may not be described in detail herein. Furthermore, the connecting lines shown in the various figures contained herein are intended to represent exemplary functional relationships and/or physical couplings between the various elements. It should be noted that many alternative or additional functional relationships or physical connections may be present in a practical system.
As used herein, “transmit” may include sending at least a portion of electronic data from one component to another. Additionally, as used herein, “data,” “information,” or the like may include encompassing information such as commands, queries, files, messages, data for storage, and the like in digital or any other form.
As used herein, “electronic communication” may comprise a physical coupling and/or non-physical coupling capable of enabling components to transmit and receive data. For example, “electronic communication” may refer to a wired or wireless protocol such as a CAN bus protocol, an Ethernet physical layer protocol (e.g., those using 10BASE-T, 100BASE-T, 1000BASE-T, etc.), an IEEE 1394 interface (e.g., FireWire), Integrated Services for Digital Network (ISDN), a digital subscriber line (DSL), an 802.11a/b/g/n/ac signal (e.g., Wi-Fi), a wireless communications protocol using short wavelength UHF radio waves and defined at least in part by IEEE 802.15.1 (e.g., the BLUETOOTH® protocol maintained by Bluetooth Special Interest Group), a wireless communications protocol defined at least in part by IEEE 802.15.4 (e.g., the ZIGBEE® protocol maintained by the ZigBee alliance), a cellular protocol, an infrared protocol, an optical protocol, or any other protocol capable of transmitting information via a wired or wireless connection.
One or more of the components discussed herein may be in electronic communication via a network. As used herein, the term “network” may further include any cloud, cloud computing system, or electronic communications system or method that incorporates hardware and/or software components. Communication amongst the nodes may be accomplished through any suitable communication channels, such as, for example, a telephone network, an extranet, an intranet, Internet, point of interaction device (personal digital assistant, cellular phone, kiosk, tablet, etc.), online communications, satellite communications, off-line communications, wireless communications, transponder communications, local area network (LAN), wide area network (WAN), virtual private network (VPN), networked or linked devices, keyboard, mouse and/or any suitable communication or data input modality. Moreover, although the system is frequently described herein as being implemented with TCP/IP communications protocols, the system may also be implemented using Internetwork Packet Exchange (IPX), APPLETALK® program, IP-6, NetBIOS, OSI, any tunneling protocol (e.g., IPsec, SSH, etc.), or any number of existing or future protocols. If the network is in the nature of a public network, such as the internet, it may be advantageous to presume the network to be insecure and open to eavesdroppers. Specific information related to the protocols, standards, and application software utilized in connection with the Internet is generally known to those skilled in the art and, as such, need not be detailed herein.
“Cloud” or “Cloud computing” includes a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications, and services) that can be rapidly provisioned and released with minimal management effort or service provider interaction. Cloud computing may include location-independent computing, whereby shared servers provide resources, software, and data to computers and other devices on demand. For more information regarding cloud computing, see the NIST's (National Institute of Standards and Technology) definition of cloud computing.
The various system components may be independently, separately or collectively suitably coupled to the network via data links which includes, for example, a connection to an Internet Service Provider (ISP) over the local loop as is typically used in connection with standard modem communication, cable modem, DISH NETWORKS®, ISDN, DSL, or various wireless communication methods. It is noted that the network may be implemented as other types of networks, such as an interactive television (ITV) network. Moreover, the system contemplates the use, sale or distribution of any goods, services or information over any network having similar functionality described herein.
A network may be unsecure. Thus, communication over the network may utilize data encryption. Encryption may be performed by way of any of the techniques now available in the art or which may become available—e.g., Twofish, RSA, El Gamal, Schorr signature, DSA, PGP, PM, GPG (GnuPG), HPE Format-Preserving Encryption (FPE), Voltage, Triple DES, Blowfish, AES, MD5, HMAC, IDEA, RC6, and symmetric and asymmetric cryptosystems. Network communications may also incorporate SHA series cryptographic methods, elliptic-curve cryptography (e.g., ECC, ECDH, ECDSA, etc.), and/or other post-quantum cryptography algorithms under development.
Any communication, transmission and/or channel discussed herein may include any system or method for delivering content (e.g. data, information, metadata, etc.), and/or the content itself. The content may be presented in any form or medium, and in various embodiments, the content may be delivered electronically and/or capable of being presented electronically. For example, a channel may comprise a website or device (e.g., FACEBOOK®, YOUTUBE®, PANDORA®, APPLE TV®, MICROSOFT® XBOX®, ROKU®, AMAZON FIRE®, GOOGLE CHROMECAST™, SONY® PLAYSTATION®, NINTENDO® SWITCH®, etc.), a uniform resource locator (“URL”), a document (e.g., a MICROSOFT® Word™ document, a MICROSOFT® Excel® document, an ADOBE® .pdf document, etc.), an “ebook,” an “emagazine,” an application or microapplication (as described herein), an SMS or other type of text message, an email, a FACEBOOK® message, a TWITTER® tweet, MMS and/or other type of communication technology. In various embodiments, a channel may be hosted or provided by a data partner. In various embodiments, the distribution channel may include at least one of a social media site, an external vendor, and a mobile device communication. Examples of social media sites include FACEBOOK®, FOURSQUARE®, TWITTER®, LINKEDIN®, INSTAGRAM®, PINTEREST®, TUMBLR®, REDDIT®, SNAPCHAT®, WHATSAPP®, FLICKR®, VK®, QZONE®, WECHAT®, and the like. Examples of mobile device communications include texting, email, and mobile applications for smartphones.
The various system components discussed herein may include one or more of the following: a host server or other computing systems including a processor for processing digital data; a memory coupled to the processor for storing digital data; an input digitizer coupled to the processor for inputting digital data; an application program stored in the memory and accessible by the processor for directing processing of digital data by the processor; a display device coupled to the processor and memory for displaying information derived from digital data processed by the processor; and a plurality of databases. Various databases used herein may include: client data; merchant data; financial institution data; and/or like data useful in the operation of the system. As those skilled in the art will appreciate, user computer may include an operating system (e.g., WINDOWS®, UNIX®, LINUX®, SOLARIS®, MacOS, etc.) as well as various conventional support software and drivers typically associated with computers.
The present system or any part(s) or function(s) thereof may be implemented using hardware, software or a combination thereof and may be implemented in one or more computer systems or other processing systems. However, the manipulations performed by embodiments were often referred to in terms, such as matching or selecting, which are commonly associated with mental operations performed by a human operator. No such capability of a human operator is necessary, or desirable in most cases, in any of the operations described herein. Rather, the operations may be machine operations or any of the operations may be conducted or enhanced by Artificial Intelligence (AI) or Machine Learning. Useful machines for performing the various embodiments include general purpose digital computers or similar devices.
In various embodiments, the embodiments are directed toward one or more computer systems capable of carrying out the functionalities described herein. The computer system includes one or more processors. The processor is connected to a communication infrastructure (e.g., a communications bus, cross-over bar, network, etc.). Various software embodiments are described in terms of this exemplary computer system. After reading this description, it will become apparent to a person skilled in the relevant art(s) how to implement various embodiments using other computer systems and/or architectures. The computer system can include a display interface that forwards graphics, text, and other data from the communication infrastructure (or from a frame buffer not shown) for display on a display unit.
The computer system also includes a main memory, such as random access memory (RAM), and may also include a secondary memory. The secondary memory may include, for example, a hard disk drive, a solid-state drive, and/or a removable storage drive. The removable storage drive reads from and/or writes to a removable storage unit in a well-known manner. As will be appreciated, the removable storage unit includes a computer usable storage medium having stored therein computer software and/or data.
The terms “computer program medium” and “computer usable medium” and “computer readable medium” are used to generally refer to media such as removable storage drive and a hard disk installed in hard disk drive. These computer program products provide software to computer system.
The computer system may also include a communications interface. Communications interface allows software and data to be transferred between computer system and external devices. Examples of communications interface may include a modem, a network interface (such as an Ethernet card), a communications port, etc. Software and data files transferred via communications interface are in the form of signals which may be electronic, electromagnetic, optical or other signals capable of being received by communications interface. These signals are provided to communications interface via a communications path (e.g., channel). This channel carries signals and may be implemented using wire, cable, fiber optics, a telephone line, a cellular link, a radio frequency (RF) link, wireless and other communications channels.
Computer programs (also referred to as computer control logic) are stored in main memory and/or secondary memory. Computer programs may also be received via communications interface. Such computer programs, when executed, enable the computer system to perform the features as discussed herein. In particular, the computer programs, when executed, enable the processor to perform the features of various embodiments. Accordingly, such computer programs represent controllers of the computer system.
These computer program instructions may be loaded onto a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions that execute on the computer or other programmable data processing apparatus create means for implementing the functions specified in the flowchart block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.
Accordingly, functional blocks of the block diagrams and flowchart illustrations support combinations of means for performing the specified functions, combinations of steps for performing the specified functions, and program instruction means for performing the specified functions. It will also be understood that each functional block of the block diagrams and flowchart illustrations, and combinations of functional blocks in the block diagrams and flowchart illustrations, can be implemented by either special purpose hardware-based computer systems which perform the specified functions or steps, or suitable combinations of special purpose hardware and computer instructions. Further, illustrations of the process flows and the descriptions thereof may make reference to user WINDOWS® applications, webpages, websites, web forms, prompts, etc. Practitioners will appreciate that the illustrated steps described herein may comprise in any number of configurations including the use of WINDOWS® applications, webpages, web forms, popup WINDOWS® applications, prompts, and the like. It should be further appreciated that the multiple steps as illustrated and described may be combined into single webpages and/or WINDOWS® applications but have been expanded for the sake of simplicity. In other cases, steps illustrated and described as single process steps may be separated into multiple webpages and/or WINDOWS® applications but have been combined for simplicity.
In various embodiments, software may be stored in a computer program product and loaded into a computer system using removable storage drive, hard disk drive, or communications interface. The control logic (software), when executed by the processor, causes the processor to perform the functions of various embodiments as described herein. In various embodiments, hardware components may take the form of application specific integrated circuits (ASICs). Implementation of the hardware state machine so as to perform the functions described herein will be apparent to persons skilled in the relevant art(s).
In various embodiments, components, modules, and/or engines described herein may be implemented as micro-applications or micro-apps. Micro-apps are typically deployed in the context of a mobile operating system, including for example, a WINDOWS® mobile operating system, an ANDROID® operating system, an APPLE® iOS operating system, a BLACKBERRY® company's operating system, and the like. The micro-app may be configured to leverage the resources of the larger operating system and associated hardware via a set of predetermined rules which govern the operations of various operating systems and hardware resources. For example, where a micro-app desires to communicate with a device or network other than the mobile device or mobile operating system, the micro-app may leverage the communication protocol of the operating system and associated device hardware under the predetermined rules of the mobile operating system. Moreover, where the micro-app desires an input from a user, the micro-app may be configured to request a response from the operating system which monitors various hardware components and then communicates a detected input from the hardware to the micro-app.
In various embodiments, the system may implement middleware to provide software applications and services, and/or to bridge software components in the computer based system, such as the operating system, database, applications, and the like. Middleware may include any hardware and/or software suitably configured to facilitate communications and/or process transactions between disparate computing systems. Middleware components are commercially available and known in the art. Middleware may be implemented through commercially available hardware and/or software, through custom hardware and/or software components, or through a combination thereof. Middleware may reside in a variety of configurations and may exist as a standalone system or may be a software component residing on the internet server. Middleware may be configured to process transactions between the various components of an application server and any number of internal or external systems for any of the purposes disclosed herein. WEBSPHERE® MQ™ (formerly MQSeries) by IBM®, Inc. (Armonk, N.Y.) is an example of a commercially available middleware product. An Enterprise Service Bus (“ESB”) application is another example of middleware.
The systems, computers, computer based systems, and the like disclosed herein may provide a suitable website or other internet-based graphical user interface which is accessible by users. Practitioners will appreciate that there are a number of methods for displaying data within a browser-based document. Data may be represented as standard text or within a fixed list, scrollable list, drop-down list, editable text field, fixed text field, pop-up window, and the like. Likewise, there are a number of methods available for modifying data in a web page such as, for example, free text entry using a keyboard, selection of menu items, check boxes, option boxes, and the like.
Any of the communications, inputs, storage, databases or displays discussed herein may be facilitated through a website having web pages. The term “web page” as it is used herein is not meant to limit the type of documents and applications that might be used to interact with the user. For example, a typical website might include, in addition to standard HTML documents, various forms, JAVA® applets, JAVASCRIPT® programs, active server pages (ASP), common gateway interface scripts (CGI), extensible markup language (XML), dynamic HTML, cascading style sheets (CSS), AJAX (Asynchronous JAVASCRIPT And XML) programs, helper applications, plug-ins, and the like. A server may include a web service that receives a request from a web server, the request including a URL and an IP address (192.168.1.1). The web server retrieves the appropriate web pages and sends the data or applications for the web pages to the IP address. Web services are applications that are capable of interacting with other applications over a communications means, such as the internet. Web services are typically based on standards or protocols such as XML, SOAP, AJAX, WSDL and UDDI. Web services methods are well known in the art, and are covered in many standard texts. As a further example, representational state transfer (REST), or RESTful, web services may provide one way of enabling interoperability between applications.
In one embodiment, MICROSOFT® company's Internet Information Services (IIS), Transaction Server (MTS) service, and an SQL SERVER® database, are used in conjunction with MICROSOFT® operating systems, WINDOWS NT® web server software, SQL SERVER® database, and MICROSOFT® Commerce Server. Additionally, components such as ACCESS® software, SQL SERVER® database, ORACLE® software, SYBASE® software, INFORMIX® software, MYSQL® software, INTERBASE® software, etc., may be used to provide an Active Data Object (ADO) compliant database management system. In one embodiment, the APACHE® web server is used in conjunction with a LINUX® operating system, a MYSQL® database, and PERL®, PHP, Ruby, and/or PYTHON® programming languages.
In various embodiments, the server may include application servers (e.g. WEBSPHERE®, WEBLOGIC®, JBOSS®, POSTGRES PLUS ADVANCED SERVER®, etc.). In various embodiments, the server may include web servers (e.g. Apache, IIS, GOOGLE® Web Server, SUN JAVA® System Web Server, JAVA® Virtual Machine running on LINUX® or WINDOWS® operating systems).
Users, systems, computer based systems or the like may communicate with the server via a web client. The web client includes any device or software which communicates via any network, such as, for example any device or software discussed herein. The web client may include internet browsing software installed within a computing unit or system to conduct communications. These computing units or systems may take the form of a computer or set of computers, although other types of computing units or systems may be used, including personal computers, laptops, notebooks, tablets, smart phones, cellular phones, personal digital assistants, servers, pooled servers, mainframe computers, distributed computing clusters, kiosks, terminals, point of sale (POS) devices or terminals, televisions, or any other device capable of receiving data over a network. The web client may include an operating system (e.g., WINDOWS®, WINDOWS MOBILE® operating systems, UNIX® operating system, LINUX® operating systems, APPLE® OS® operating systems, etc.) as well as various conventional support software and drivers typically associated with computers. The web-client may also run MICROSOFT® INTERNET EXPLORER® software, MOZILLA® FIREFOX® software, GOOGLE® CHROME® software, APPLE® SAFARI® software, or any other of the myriad software packages available for browsing the internet.
As those skilled in the art will appreciate, the web client may or may not be in direct contact with the server (e.g., application server, web server, etc., as discussed herein). For example, the web client may access the services of the server through another server and/or hardware component, which may have a direct or indirect connection to an internet server. For example, the web client may communicate with the server via a load balancer. In various embodiments, web client access is through a network or the internet through a commercially-available web-browser software package. In that regard, the web client may be in a home or business environment with access to the network or the internet. The web client may implement security protocols such as Secure Sockets Layer (SSL) and Transport Layer Security (TLS). A web client may implement several application layer protocols including HTTP, HTTPS, FTP, and SFTP.
Any database, data structure, or the like discussed herein may include relational, hierarchical, graphical, blockchain, object-oriented structure, and/or any other database configurations. Any database, data structure, or the like may also include a flat file structure wherein data may be stored in a single file in the form of rows and columns, with no structure for indexing and no structural relationships between records. For example, a flat file structure may include a delimited text file, a CSV (comma-separated values) file, and/or any other suitable flat file structure. Common database products that may be used to implement the databases include DB2® by IBM® (Armonk, N.Y.), various database products available from ORACLE® Corporation (Redwood Shores, Calif.), MICROSOFT ACCESS® or MICROSOFT SQL SERVER® by MICROSOFT® Corporation (Redmond, Wash.), MYSQL® by MySQL AB (Uppsala, Sweden), MONGODB®, Redis, Apache Cassandra®, HBASE® by APACHE®, MapR-DB by the MAPR® corporation, or any other suitable database product. Moreover, any database may be organized in any suitable manner, for example, as data tables or lookup tables. Each record may be a single file, a series of files, a linked series of data fields, or any other data structure.
One skilled in the art will also appreciate that, for security reasons, any databases, systems, devices, servers, or other components of the system may consist of any combination thereof at a single location or at multiple locations, wherein each database, system, device, server, and/or other component includes any of various suitable security features, such as firewalls, access codes, encryption, decryption, compression, decompression, and/or the like.
Encryption may be performed by way of any of the techniques now available in the art or which may become available—e.g., Twofish, RSA, El Gamal, Schorr signature, DSA, PGP, PM, GPG (GnuPG), HPE Format-Preserving Encryption (FPE), Voltage, Triple DES, Blowfish, AES, MD5, HMAC, IDEA, RC6, and symmetric and asymmetric cryptosystems. Network communications may also incorporate SHA series cryptographic methods, elliptic-curve cryptography (e.g., ECC, ECDH, ECDSA, etc.), and/or other post-quantum cryptography algorithms under development.
A firewall may include any hardware and/or software suitably configured to protect CMS components and/or enterprise computing resources from users of other networks. Further, the firewall may be configured to limit or restrict access to various systems and components behind the firewall for web clients connecting through a web server. The firewall may reside in varying configurations including Stateful Inspection, Proxy based, access control lists, and Packet Filtering among others. The firewall may be integrated within a web server or any other CMS components or may further reside as a separate entity. The firewall may implement network address translation (“NAT”) and/or network address port translation (“NAPT”). The firewall may accommodate various tunneling protocols to facilitate secure communications, such as those used in virtual private networking. The firewall may implement a demilitarized zone (“DMZ”) to facilitate communications with a public network such as the internet. The firewall may be integrated as software within an internet server, any other application server components or may reside within another computing device or may take the form of a standalone hardware component.
The systems and methods may be described herein in terms of functional block components, screen shots, optional selections, and various processing steps. It should be appreciated that such functional blocks may be realized by any number of hardware and/or software components configured to perform the specified functions. For example, the system may employ various integrated circuit components, e.g., memory elements, processing elements, logic elements, look-up tables, and the like, which may carry out a variety of functions under the control of one or more microprocessors or other control devices. Similarly, the software elements of the system may be implemented with any programming or scripting language such as C, C++, C#, JAVA®, JAVASCRIPT®, JAVASCRIPT® Object Notation (JSON), VBScript, Macromedia COLD FUSION, COBOL, MICROSOFT® company's Active Server Pages, assembly, PERL®, PHP, awk, PYTHON®, Visual Basic, SQL Stored Procedures, PL/SQL, any UNIX® shell script, and extensible markup language (XML) with the various algorithms being implemented with any combination of data structures, objects, processes, routines or other programming elements. Further, it should be noted that the system may employ any number of conventional techniques for data transmission, signaling, data processing, network control, and the like. Still further, the system could be used to detect or prevent security issues with a client-side scripting language, such as JAVASCRIPT®, VBScript, or the like. Cryptography and network security methods are well known in the art, and are covered in many standard texts.
In various embodiments, the software elements described herein may also be implemented using NODE.JS® components. NODE.JS® programs may implement several modules to handle various core functionalities. For example, a package management module, such as NPM®, may be implemented as an open source library to aid in organizing the installation and management of third-party NODE.JS® programs. NODE.JS® programs may also implement a process manager, such as, for example, Parallel Multithreaded Machine (“PM2”); a resource and performance monitoring tool, such as, for example, Node Application Metrics (“appmetrics”); a library module for building user interfaces, and/or any other suitable and/or desired module.
As will be appreciated by one of ordinary skill in the art, the system may be embodied as a customization of an existing system, an add-on product, a processing apparatus executing upgraded software, a stand-alone system, a distributed system, a method, a data processing system, a device for data processing, and/or a computer program product. Accordingly, any portion of the system or a module may take the form of a processing apparatus executing code, an internet-based embodiment, an entirely hardware embodiment, or an embodiment combining aspects of the internet, software, and hardware. Furthermore, the system may take the form of a computer program product on a computer-readable storage medium having computer-readable program code means embodied in the storage medium. Any suitable computer-readable storage medium may be utilized, including hard disks, CD-ROM, SONY BLU-RAY DISC®, optical storage devices, magnetic storage devices, and/or the like.
The systems described herein may also contemplate uses in association with web services, utility computing, pervasive and individualized computing, security and identity solutions, autonomic computing, cloud computing, commodity computing, mobility and wireless solutions, open source, biometrics, grid computing and/or mesh computing.
The term “non-transitory” is to be understood to remove only propagating transitory signals per se from the claim scope and does not relinquish rights to all standard computer-readable media that are not only propagating transitory signals per se. Stated another way, the meaning of the term “non-transitory computer-readable medium” and “non-transitory computer-readable storage medium” should be construed to exclude only those types of transitory computer-readable media which were found in In Re Nuijten to fall outside the scope of patentable subject matter under 35 U.S.C. § 101.
Benefits, other advantages, and solutions to problems have been described herein with regard to specific embodiments. However, the benefits, advantages, solutions to problems, and any elements that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as critical, required, or essential features or elements of the disclosure. The scope of the disclosure is accordingly to be limited by nothing other than the appended claims, in which reference to an element in the singular is not intended to mean “one and only one” unless explicitly so stated, but rather “one or more.” Moreover, where a phrase similar to ‘at least one of A, B, and C’ or ‘at least one of A, B, or C’ is used in the claims or specification, it is intended that the phrase be interpreted to mean that A alone may be present in an embodiment, B alone may be present in an embodiment, C alone may be present in an embodiment, or that any combination of the elements A, B and C may be present in a single embodiment; for example, A and B, A and C, B and C, or A and B and C.
Although the disclosure includes a method, it is contemplated that it may be embodied as computer program instructions on a tangible computer-readable carrier, such as a magnetic or optical memory or a magnetic or optical disk. All structural, chemical, and functional equivalents to the elements of the above-described various embodiments that are known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the present claims. Moreover, it is not necessary for a device or method to address each and every problem sought to be solved by the present disclosure, for it to be encompassed by the present claims. Furthermore, no element, component, or method step in the present disclosure is intended to be dedicated to the public regardless of whether the element, component, or method step is explicitly recited in the claims. No claim element is intended to invoke 35 U.S.C. 112(f) unless the element is expressly recited using the phrase “means for.” As used herein, the terms “comprises”, “comprising”, or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
This Non-Provisional patent application claims priority to U.S. Provisional Patent Application Ser. No. 62/593,603, entitled “SYSTEMS AND METHODS FOR IMPROVED DATA ENCRYPTION,” and filed Dec. 1, 2017, which is incorporated herein by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5003596 | Wood | Mar 1991 | A |
| 5246564 | Tamiya et al. | Sep 1993 | A |
| 5303388 | Kreitman et al. | Apr 1994 | A |
| 5590024 | Honda et al. | Dec 1996 | A |
| 5664228 | Mital | Sep 1997 | A |
| 5678015 | Goh | Oct 1997 | A |
| 5689287 | Mackinlay et al. | Nov 1997 | A |
| 5689654 | Kikinis et al. | Nov 1997 | A |
| 5729471 | Jain et al. | Mar 1998 | A |
| 5861873 | Kikinis | Jan 1999 | A |
| 5956038 | Rekimoto | Sep 1999 | A |
| 5963215 | Rosenzweig | Oct 1999 | A |
| 5982295 | Goto et al. | Nov 1999 | A |
| 6002403 | Sugiyama et al. | Dec 1999 | A |
| 6008809 | Brooks | Dec 1999 | A |
| 6029183 | Jenkins et al. | Feb 2000 | A |
| 6160488 | Honda | Dec 2000 | A |
| 6489932 | Chitturi et al. | Dec 2002 | B1 |
| 6497367 | Conzola et al. | Dec 2002 | B2 |
| 6581068 | Bensoussan | Jun 2003 | B1 |
| 6597358 | Miller | Jul 2003 | B2 |
| 6652170 | Arnold | Nov 2003 | B1 |
| 6710788 | Freach et al. | Mar 2004 | B1 |
| 6922815 | Rosen | Jul 2005 | B2 |
| 6938218 | Rosen | Aug 2005 | B1 |
| 7054963 | Betts-LaCroix et al. | May 2006 | B2 |
| 7134095 | Smith et al. | Nov 2006 | B1 |
| 7149836 | Yu et al. | Dec 2006 | B2 |
| 7216305 | Jaeger | May 2007 | B1 |
| 7428702 | Cervantes et al. | Sep 2008 | B1 |
| 7480872 | Ubillos | Jan 2009 | B1 |
| 7516484 | Arnouse | Apr 2009 | B1 |
| 7533408 | Arnouse | May 2009 | B1 |
| 7725839 | Michaels | May 2010 | B2 |
| 7761813 | Kim | Jul 2010 | B2 |
| D654931 | Lemelman et al. | Feb 2012 | S |
| 8111255 | Park | Feb 2012 | B2 |
| 8117563 | Ok et al. | Feb 2012 | B2 |
| 8264488 | Ueno | Sep 2012 | B2 |
| 8386686 | Lin et al. | Feb 2013 | B2 |
| 8390255 | Fathollahi | Mar 2013 | B1 |
| 8405502 | Teague | Mar 2013 | B2 |
| 8483758 | Huang | Jul 2013 | B2 |
| 8497859 | Hickman et al. | Jul 2013 | B1 |
| 8510680 | Kang et al. | Aug 2013 | B2 |
| 8587590 | Erickson et al. | Nov 2013 | B2 |
| 8614885 | Solomon et al. | Dec 2013 | B2 |
| 8634883 | Hong | Jan 2014 | B2 |
| 8699218 | Xu | Apr 2014 | B2 |
| 8745535 | Chaudhri et al. | Jun 2014 | B2 |
| 8810430 | Proud | Aug 2014 | B2 |
| 8924862 | Luo | Dec 2014 | B1 |
| 8935438 | Ivanchenko | Jan 2015 | B1 |
| 8942371 | Urbanik | Jan 2015 | B2 |
| 8952566 | Harris | Feb 2015 | B2 |
| 8996795 | Mardiks et al. | Mar 2015 | B2 |
| 9047050 | Medica et al. | Jun 2015 | B2 |
| 9100685 | Conrad et al. | Aug 2015 | B2 |
| 9178976 | Djordjevic | Nov 2015 | B2 |
| 9247303 | Phang et al. | Jan 2016 | B2 |
| 9288295 | Ivanovski et al. | Mar 2016 | B2 |
| 9356267 | To et al. | May 2016 | B1 |
| 9360991 | Celebisoy | Jun 2016 | B2 |
| 9378588 | Song et al. | Jun 2016 | B2 |
| 9390082 | Stolte et al. | Jul 2016 | B1 |
| 9405435 | Hendricks | Aug 2016 | B2 |
| 9437038 | Costello et al. | Sep 2016 | B1 |
| 9495375 | Huang et al. | Nov 2016 | B2 |
| 9516151 | Moran et al. | Dec 2016 | B2 |
| 9584402 | Christmas et al. | Feb 2017 | B2 |
| 9626341 | Guan et al. | Apr 2017 | B1 |
| 9658651 | Balogh | May 2017 | B2 |
| 9684887 | Majeti et al. | Jun 2017 | B2 |
| 9836479 | Velummylum et al. | Dec 2017 | B2 |
| 9886229 | Christmas et al. | Feb 2018 | B2 |
| 10075502 | Malpass | Sep 2018 | B2 |
| 10084688 | Christmas et al. | Sep 2018 | B2 |
| 10095873 | Christmas et al. | Oct 2018 | B2 |
| 10122483 | Gonzales, Jr. | Nov 2018 | B2 |
| 10123153 | Christmas et al. | Nov 2018 | B2 |
| 10193587 | Li | Jan 2019 | B2 |
| 10231013 | Besehanic | Mar 2019 | B2 |
| 10411406 | Hill | Sep 2019 | B1 |
| 10437288 | Christmas et al. | Oct 2019 | B2 |
| 20010028369 | Gallo et al. | Oct 2001 | A1 |
| 20010033654 | Wieser | Oct 2001 | A1 |
| 20010044578 | Ben-Haim et al. | Nov 2001 | A1 |
| 20020085681 | Jensen | Jul 2002 | A1 |
| 20020105529 | Bowser et al. | Aug 2002 | A1 |
| 20020105551 | Kamen et al. | Aug 2002 | A1 |
| 20020138543 | Teng et al. | Sep 2002 | A1 |
| 20030014978 | Horil et al. | Jan 2003 | A1 |
| 20030031161 | Froehlich | Feb 2003 | A1 |
| 20030074529 | Crohas | Apr 2003 | A1 |
| 20030126272 | Cori et al. | Jul 2003 | A1 |
| 20030126335 | Silvester | Jul 2003 | A1 |
| 20030131050 | Vincent | Jul 2003 | A1 |
| 20030141978 | D'Agosto | Jul 2003 | A1 |
| 20030142136 | Carter et al. | Jul 2003 | A1 |
| 20030217097 | Eitel | Nov 2003 | A1 |
| 20040088280 | Koh et al. | May 2004 | A1 |
| 20040104932 | Brebner | Jun 2004 | A1 |
| 20040205091 | Mulcahy et al. | Oct 2004 | A1 |
| 20050005246 | Card et al. | Jan 2005 | A1 |
| 20050076216 | Nyberg | Apr 2005 | A1 |
| 20050097008 | Ehring et al. | May 2005 | A1 |
| 20050185364 | Bell et al. | Aug 2005 | A1 |
| 20050224589 | Park et al. | Oct 2005 | A1 |
| 20050237704 | Ceresoli | Oct 2005 | A1 |
| 20050271207 | Frey | Dec 2005 | A1 |
| 20060020888 | Kang et al. | Jan 2006 | A1 |
| 20060057960 | Tran | Mar 2006 | A1 |
| 20060075225 | Flynn et al. | Apr 2006 | A1 |
| 20060085741 | Weiner et al. | Apr 2006 | A1 |
| 20060090122 | Pyhalammi et al. | Apr 2006 | A1 |
| 20060112270 | Erez | May 2006 | A1 |
| 20060130004 | Hughes et al. | Jun 2006 | A1 |
| 20060134997 | Curtis et al. | Jun 2006 | A1 |
| 20060149825 | Kim | Jul 2006 | A1 |
| 20060159028 | Curran-Gray | Jul 2006 | A1 |
| 20060161631 | Lira | Jul 2006 | A1 |
| 20060193472 | Yuen | Aug 2006 | A1 |
| 20060200518 | Sinclair et al. | Sep 2006 | A1 |
| 20060239275 | Zlateff et al. | Oct 2006 | A1 |
| 20060239375 | Kim et al. | Oct 2006 | A1 |
| 20060294386 | Yuval et al. | Dec 2006 | A1 |
| 20070050778 | Lee et al. | Mar 2007 | A1 |
| 20070058806 | Ferguson | Mar 2007 | A1 |
| 20070120846 | Ok et al. | May 2007 | A1 |
| 20070130541 | Louch et al. | Jun 2007 | A1 |
| 20070158408 | Wang et al. | Jul 2007 | A1 |
| 20070160198 | Orsini et al. | Jul 2007 | A1 |
| 20070168614 | Jianjun et al. | Jul 2007 | A1 |
| 20070245048 | Mezet et al. | Oct 2007 | A1 |
| 20070259570 | Moshayedi | Nov 2007 | A1 |
| 20070271580 | Tischer et al. | Nov 2007 | A1 |
| 20070273675 | Wangler | Nov 2007 | A1 |
| 20070279852 | Daniel et al. | Dec 2007 | A1 |
| 20070282601 | Li | Dec 2007 | A1 |
| 20080024976 | Hardson et al. | Jan 2008 | A1 |
| 20080069358 | Yang | Mar 2008 | A1 |
| 20080080709 | Michtchenko | Apr 2008 | A1 |
| 20080181141 | Krantz et al. | Jul 2008 | A1 |
| 20080186305 | Carter | Aug 2008 | A1 |
| 20080222238 | Ivanov et al. | Sep 2008 | A1 |
| 20080223890 | Tecchiolli et al. | Sep 2008 | A1 |
| 20080235629 | Porter et al. | Sep 2008 | A1 |
| 20080241809 | Ashmore et al. | Oct 2008 | A1 |
| 20080250179 | Moon | Oct 2008 | A1 |
| 20080305738 | Khedouri et al. | Dec 2008 | A1 |
| 20080313450 | Rosenberg | Dec 2008 | A1 |
| 20080317068 | Sagar et al. | Dec 2008 | A1 |
| 20090009605 | Ortiz | Jan 2009 | A1 |
| 20090089692 | Morris | Apr 2009 | A1 |
| 20090116445 | Samar et al. | May 2009 | A1 |
| 20090144653 | Ubillos | Jun 2009 | A1 |
| 20090146775 | Bonnaud et al. | Jun 2009 | A1 |
| 20090239468 | He et al. | Sep 2009 | A1 |
| 20090240598 | Kargman | Dec 2009 | A1 |
| 20090300025 | Rothschild et al. | Dec 2009 | A1 |
| 20090316351 | Zadesky | Dec 2009 | A1 |
| 20100007768 | Yong et al. | Jan 2010 | A1 |
| 20100020035 | Ryu et al. | Jan 2010 | A1 |
| 20100050129 | Li et al. | Feb 2010 | A1 |
| 20100073869 | Mangaroo | Mar 2010 | A1 |
| 20100078343 | Hoellwarth et al. | Apr 2010 | A1 |
| 20100088634 | Tsuruta et al. | Apr 2010 | A1 |
| 20100093412 | Serra et al. | Apr 2010 | A1 |
| 20100122207 | Kim et al. | May 2010 | A1 |
| 20100153449 | Baba et al. | Jun 2010 | A1 |
| 20100161743 | Krishnamurthi et al. | Jun 2010 | A1 |
| 20100169639 | Jeffries et al. | Jul 2010 | A1 |
| 20100169836 | Stallings et al. | Jul 2010 | A1 |
| 20100225735 | Shaffer et al. | Sep 2010 | A1 |
| 20100238089 | Massand | Sep 2010 | A1 |
| 20100256624 | Brannon et al. | Oct 2010 | A1 |
| 20100268929 | Fumiyoshi | Oct 2010 | A1 |
| 20100281138 | Froirntchuk et al. | Nov 2010 | A1 |
| 20100309228 | Mattos et al. | Dec 2010 | A1 |
| 20100313154 | Choi et al. | Dec 2010 | A1 |
| 20100315225 | Harrison et al. | Dec 2010 | A1 |
| 20100315417 | Cho et al. | Dec 2010 | A1 |
| 20110051642 | Krishnaswamy | Mar 2011 | A1 |
| 20110063211 | Hoerl et al. | Mar 2011 | A1 |
| 20110090534 | Terao et al. | Apr 2011 | A1 |
| 20110107269 | Chiu et al. | May 2011 | A1 |
| 20110113251 | Lu et al. | May 2011 | A1 |
| 20110131660 | Claessen et al. | Jun 2011 | A1 |
| 20110134110 | Song et al. | Jun 2011 | A1 |
| 20110138175 | Clark et al. | Jun 2011 | A1 |
| 20110179368 | King et al. | Jul 2011 | A1 |
| 20110252098 | Kumar | Oct 2011 | A1 |
| 20110256905 | Ryan | Oct 2011 | A1 |
| 20110283208 | Gallo | Nov 2011 | A1 |
| 20110287808 | Huang | Nov 2011 | A1 |
| 20110294474 | Barany et al. | Dec 2011 | A1 |
| 20110295392 | Cunnington | Dec 2011 | A1 |
| 20110296339 | Kang | Dec 2011 | A1 |
| 20110310100 | Adimatyam et al. | Dec 2011 | A1 |
| 20120011200 | Zhang et al. | Jan 2012 | A1 |
| 20120034897 | Kreitzer et al. | Feb 2012 | A1 |
| 20120047517 | Townsend et al. | Feb 2012 | A1 |
| 20120098754 | Kim | Apr 2012 | A1 |
| 20120128172 | Alden | May 2012 | A1 |
| 20120151224 | Koifman | Jun 2012 | A1 |
| 20120155510 | Hirsch et al. | Jun 2012 | A1 |
| 20120166953 | Affronti et al. | Jun 2012 | A1 |
| 20120194976 | Golko et al. | Aug 2012 | A1 |
| 20120200567 | Mandel et al. | Aug 2012 | A1 |
| 20120209630 | Ihm et al. | Aug 2012 | A1 |
| 20120242845 | Tan | Sep 2012 | A1 |
| 20120260218 | Bawel | Oct 2012 | A1 |
| 20120267432 | Kuttuva | Oct 2012 | A1 |
| 20120282858 | Gill et al. | Nov 2012 | A1 |
| 20120293509 | Barnsley | Nov 2012 | A1 |
| 20120310446 | Murphy | Dec 2012 | A1 |
| 20130028419 | Das | Jan 2013 | A1 |
| 20130050117 | Cho et al. | Feb 2013 | A1 |
| 20130073692 | Isaza et al. | Mar 2013 | A1 |
| 20130077529 | Lueckenhoff et al. | Mar 2013 | A1 |
| 20130080541 | Herbert | Mar 2013 | A1 |
| 20130097239 | Brown et al. | Apr 2013 | A1 |
| 20130111038 | Girard | May 2013 | A1 |
| 20130125000 | Fleischhauer et al. | May 2013 | A1 |
| 20130145171 | Hsien | Jun 2013 | A1 |
| 20130145384 | Krum et al. | Jun 2013 | A1 |
| 20130152113 | Conrad et al. | Jun 2013 | A1 |
| 20130159080 | Wu et al. | Jun 2013 | A1 |
| 20130159178 | Colon et al. | Jun 2013 | A1 |
| 20130163195 | Pelletier | Jun 2013 | A1 |
| 20130173598 | Nguyen | Jul 2013 | A1 |
| 20130173798 | Micucci et al. | Jul 2013 | A1 |
| 20130201176 | Lee et al. | Aug 2013 | A1 |
| 20130205277 | Seven et al. | Aug 2013 | A1 |
| 20130212112 | Blom et al. | Aug 2013 | A1 |
| 20130217448 | Kim | Aug 2013 | A1 |
| 20130219479 | Desoto et al. | Aug 2013 | A1 |
| 20130227420 | Pasquero et al. | Aug 2013 | A1 |
| 20130235037 | Baldwin et al. | Sep 2013 | A1 |
| 20130238711 | Lashkari et al. | Sep 2013 | A1 |
| 20130256403 | Mackinnon Keith | Oct 2013 | A1 |
| 20130260819 | Suzuki et al. | Oct 2013 | A1 |
| 20130266065 | Paczkowski | Oct 2013 | A1 |
| 20130266129 | Pattan et al. | Oct 2013 | A1 |
| 20130268802 | Ito et al. | Oct 2013 | A1 |
| 20130268955 | Conrad et al. | Oct 2013 | A1 |
| 20130272196 | Li et al. | Oct 2013 | A1 |
| 20130273983 | Hsu | Oct 2013 | A1 |
| 20130290440 | Pratt et al. | Oct 2013 | A1 |
| 20130300740 | Snyder | Nov 2013 | A1 |
| 20130303160 | Fong et al. | Nov 2013 | A1 |
| 20130317835 | Matthew | Nov 2013 | A1 |
| 20130346911 | Sripada | Dec 2013 | A1 |
| 20140012913 | Varoglu et al. | Jan 2014 | A1 |
| 20140026204 | Buntinx et al. | Jan 2014 | A1 |
| 20140034531 | Wang | Feb 2014 | A1 |
| 20140039804 | Park et al. | Feb 2014 | A1 |
| 20140040777 | Jones et al. | Feb 2014 | A1 |
| 20140052522 | Irani et al. | Feb 2014 | A1 |
| 20140052618 | Drozd et al. | Feb 2014 | A1 |
| 20140055822 | Hannaway et al. | Feb 2014 | A1 |
| 20140078136 | Sohn et al. | Mar 2014 | A1 |
| 20140082547 | Ding | Mar 2014 | A1 |
| 20140106677 | Altman | Apr 2014 | A1 |
| 20140121858 | Chen | May 2014 | A1 |
| 20140123033 | Ross | May 2014 | A1 |
| 20140132594 | Gharpure et al. | May 2014 | A1 |
| 20140132736 | Chang et al. | May 2014 | A1 |
| 20140136429 | Psihos | May 2014 | A1 |
| 20140141713 | Shirinfar et al. | May 2014 | A1 |
| 20140156725 | Mandyam | Jun 2014 | A1 |
| 20140189532 | Sivaraman et al. | Jul 2014 | A1 |
| 20140203950 | Zdeblick | Jul 2014 | A1 |
| 20140207657 | Gacs et al. | Jul 2014 | A1 |
| 20140218356 | Distler | Aug 2014 | A1 |
| 20140232817 | Jones et al. | Aug 2014 | A1 |
| 20140258938 | Christmas et al. | Sep 2014 | A1 |
| 20140337640 | Sharma et al. | Nov 2014 | A1 |
| 20140351181 | Canoy et al. | Nov 2014 | A1 |
| 20140355761 | Kawamura et al. | Dec 2014 | A1 |
| 20150009531 | Kawaguchi | Jan 2015 | A1 |
| 20150012617 | Park et al. | Jan 2015 | A1 |
| 20150015368 | Roth | Jan 2015 | A1 |
| 20150019628 | Li | Jan 2015 | A1 |
| 20150082399 | Wu | Mar 2015 | A1 |
| 20150095777 | Lim et al. | Apr 2015 | A1 |
| 20150101018 | Forte | Apr 2015 | A1 |
| 20150106837 | Li et al. | Apr 2015 | A1 |
| 20150133000 | Kim | May 2015 | A1 |
| 20150133204 | Ivanovski | May 2015 | A1 |
| 20150145889 | Hanai | May 2015 | A1 |
| 20150177362 | Gutierrez | Jun 2015 | A1 |
| 20150194833 | Fathollahi et al. | Jul 2015 | A1 |
| 20150271271 | Bullota et al. | Sep 2015 | A1 |
| 20150271299 | Bullota et al. | Sep 2015 | A1 |
| 20150271307 | Berg et al. | Sep 2015 | A1 |
| 20150279470 | Cerrelli et al. | Oct 2015 | A1 |
| 20150281439 | Dudai | Oct 2015 | A1 |
| 20150339867 | Amon | Nov 2015 | A1 |
| 20150367230 | Bradford et al. | Dec 2015 | A1 |
| 20150382169 | Burba | Dec 2015 | A1 |
| 20160014574 | Christmas et al. | Jan 2016 | A1 |
| 20160037055 | Waddington | Feb 2016 | A1 |
| 20160100279 | Christmas et al. | Apr 2016 | A1 |
| 20160134941 | Selvaraj | May 2016 | A1 |
| 20160162244 | Christmas et al. | Jun 2016 | A1 |
| 20160188468 | Rao | Jun 2016 | A1 |
| 20160195899 | Plante | Jul 2016 | A1 |
| 20160198322 | Pitis | Jul 2016 | A1 |
| 20160205804 | Hartman | Jul 2016 | A1 |
| 20160226730 | Schumacher | Aug 2016 | A1 |
| 20160260319 | Jeffery et al. | Sep 2016 | A1 |
| 20160269468 | Malpass | Sep 2016 | A1 |
| 20170034167 | Figueira | Feb 2017 | A1 |
| 20170134803 | Shaw et al. | May 2017 | A1 |
| 20170160992 | Christmas et al. | Jun 2017 | A1 |
| 20170371378 | Christmas et al. | Dec 2017 | A1 |
| 20180009416 | Maiwand | Jan 2018 | A1 |
| 20180032531 | Shiomi | Feb 2018 | A1 |
| 20180146378 | Christmas et al. | May 2018 | A1 |
| 20180375641 | Murguia Cosentino | Dec 2018 | A1 |
| 20190007477 | Malpass | Jan 2019 | A1 |
| 20190012473 | Christmas et al. | Jan 2019 | A1 |
| 20190020576 | Christmas et al. | Jan 2019 | A1 |
| 20190037381 | Christmas et al. | Jan 2019 | A1 |
| 20190123501 | Christmas | Apr 2019 | A1 |
| Number | Date | Country |
|---|---|---|
| 2013352236 | Nov 2018 | AU |
| 103945003 | Jul 2001 | CN |
| 1881164 | Dec 2006 | CN |
| 101388815 | Mar 2009 | CN |
| 101401341 | Apr 2009 | CN |
| 102376133 | Mar 2012 | CN |
| 202230439 | May 2012 | CN |
| 202230493 | May 2012 | CN |
| 102591571 | Jul 2012 | CN |
| 103077462 | May 2013 | CN |
| 103095852 | May 2013 | CN |
| 103546181 | Jan 2014 | CN |
| 104238730 | Dec 2014 | CN |
| 205427859 | Aug 2016 | CN |
| 106797337 | May 2018 | CN |
| 105706033 | May 2019 | CN |
| 102008023577 | Nov 2009 | DE |
| 0800144 | Oct 1997 | EP |
| 1168769 | Feb 2002 | EP |
| 1761048 | Mar 2007 | EP |
| 1806649 | Jul 2007 | EP |
| 2642728 | Mar 2013 | EP |
| 3022638 | Apr 2018 | EP |
| 1242492 | Jun 2018 | HK |
| H07-108883 | Apr 1995 | JP |
| 09-091155 | Apr 1997 | JP |
| 2001344571 | Dec 2001 | JP |
| 2003184379 | Jul 2003 | JP |
| 2005-054368 | Mar 2005 | JP |
| 2006-317802 | Nov 2006 | JP |
| 2007-049606 | Feb 2007 | JP |
| 2010-535351 | Nov 2010 | JP |
| 2011-134159 | Jul 2011 | JP |
| 2011-147136 | Jul 2011 | JP |
| 2011-248489 | Dec 2011 | JP |
| 2012-050075 | Mar 2012 | JP |
| 2013-185344 | Sep 2013 | JP |
| 2013-204254 | Oct 2013 | JP |
| 2013-214801 | Oct 2013 | JP |
| 2014071581 | Apr 2014 | JP |
| 2016-111446 | Jun 2016 | JP |
| 2016-517317 | Jun 2016 | JP |
| 6310477 | Apr 2018 | JP |
| 2018-514845 | Jun 2018 | JP |
| 6479026 | Feb 2019 | JP |
| 10-2004-018122 | Dec 2004 | KR |
| 10-2005-098078 | Oct 2005 | KR |
| 10-2009005972 | Jun 2009 | KR |
| 10-20100056594 | May 2010 | KR |
| 10-20120092487 | Aug 2012 | KR |
| 10-2012-0059488 | May 2013 | KR |
| 10-2017-0047866 | May 2017 | KR |
| 2421800 | Jun 2011 | RU |
| 201214150 | Apr 2012 | TW |
| 201320681 | May 2013 | TW |
| 201349811 | Dec 2013 | TW |
| 629910 | Jul 2018 | TW |
| 2000033545 | Jun 2000 | WO |
| 2005050393 | Jun 2005 | WO |
| 2006107324 | Oct 2006 | WO |
| 2006125027 | Nov 2006 | WO |
| 2007076494 | Jul 2007 | WO |
| 2007103908 | Sep 2007 | WO |
| 2008090902 | Jul 2008 | WO |
| 2009016612 | Feb 2009 | WO |
| 2010018551 | Aug 2010 | WO |
| 2012087847 | Jun 2012 | WO |
| 2014012486 | Jan 2014 | WO |
| 2014016622 | Jan 2014 | WO |
| 2014085502 | Jun 2014 | WO |
| 2014138187 | Sep 2014 | WO |
| 2014141235 | Sep 2014 | WO |
| 2014151925 | Sep 2014 | WO |
| 2015009944 | Jan 2015 | WO |
| 2015022615 | Feb 2015 | WO |
| 2015048684 | Apr 2015 | WO |
| 2015112506 | Jul 2015 | WO |
| 2016007780 | Jan 2016 | WO |
| 2016057091 | Apr 2016 | WO |
| 2016145126 | Sep 2016 | WO |
| 2017090014 | Jun 2017 | WO |
| 2017096245 | Jun 2017 | WO |
| 2018098313 | May 2018 | WO |
| 2018144833 | Aug 2018 | WO |
| 2018173798 | Sep 2018 | WO |
| 2018232186 | Dec 2018 | WO |
| 2019079628 | Apr 2019 | WO |
| Entry |
|---|
| Bormann, G. (May 16, 2008). DE102008023577A1—Symmetrical algorithm for coding and decoding of byte sequences, has byte sequence encoded or decoded in block with variable long key, where byte sequence is extended to certain length, https://patents.google.com/patent/DE1 (Year: 2008). |
| Shinge SR, Patil R. An encryption algorithm based on ASCII value of data. International Journal of Computer Science and Information Technologies. Nov. 2014; 5(6)7232-4. (Year: 2014). |
| Sokouti M, Sokouti B, Pashazadeh S. An approach in improving transposition cipher system. Indian Journal of Science and Technology. Aug. 2009;2(8):9-15. (Year: 2009). |
| USPTO; Non-Final Office Action dated Feb. 6, 2019 in U.S. Appl. No. 15/644,556. |
| USPTO; Final Office Action dated Feb. 7, 2019 in U.S. Appl. No. 14/795,210. |
| USPTO; Non-Final Office Action dated Mar. 7, 2019 in U.S. Appl. No. 15/367,961. |
| USPTO; Advisory Action dated Mar. 12, 2019 in U.S. Appl. No. 14/197,517. |
| CN; 1st Office Action dated Nov. 26, 2018 in Application Serial No. 201480065117.6. |
| CN; Notice of Intent to Grant dated Feb. 11, 2019 in Application No. CN 201380070415. |
| EP; Notice of Intent to Grant dated Jan. 4, 2019 in Application No. EP14760041.5. |
| CN; Notice of Intent to Grant dated Jan. 30, 2019 in Application No. CN 201480023946.8. |
| EP; Examination Report dated Feb. 5, 2019 in Application No. EP 13859205.0. |
| JP; Notice of Allowance dated Dec. 30, 2018 in Application No. JP 2016-549317. |
| TW; Search Report dated Dec. 10, 2018 in Application No. TW 107119353. |
| TW; First Office Action dated Dec. 6, 2018 in Application No. TW 107119353. |
| EP; Examination Report dated Jan. 3, 2019 in Application No. EP 15848371.9. |
| PCT; International Search Report and Written Opinion dated Oct. 12, 2018 in International Application PCT/US2018/037643. |
| Rico Fabio et al., “A Testbed for Developing, Simulating and Experimenting Multipath Aggregation Algorithms,” Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA), IEEE, pp. 1-4, (Sep. 2014). |
| USPTO; Notice of Allowance dated May 21, 2019 in U.S. Appl. No. 15/644,556. |
| USPTO; Non-Final Office Action dated May 30, 2019 in U.S. Appl. No. 16/114,531. |
| USPTO; Non-Final Office Action dated Jun. 14, 2019 in U.S. Appl. No. 14/197,517. |
| USPTO; Restriction Requirement dated Jun. 20, 2019 in U.S. Appl. No. 16/152,342. |
| AU; 2nd Examination Report Mar. 20, 2019 in Application No. AU 2014225864. |
| MX; 3rd Examination Report dated Mar. 21, 2019 in Application No. MX/a/2016/003798. |
| CA; Office Action dated Nov. 23, 2018 in Application No. CA 2892664. |
| CA; 2nd Office Action dated Feb. 14, 2019 in Application No. CA 2892664. |
| AU; Examination Report dated Feb. 8, 2019 in Application No. AU 2015328723. |
| RU; Examination Report dated Jan. 31, 2019 in Application No. RU 2017113541. |
| EP; Examination Report dated Apr. 18, 2019 in Application No. EP 15819468.8. |
| JP; Examination Report dated May 8, 2019 in Application No. 2017-518492. |
| MX; Examination Report dated Jun. 19, 2019 in Application No. MX/a/2017/004463. |
| MX; Examination Report dated May 27, 2019 in Application No. MX/a/2016/000616. |
| Sweden; Office Action dated Jul. 17, 2019 in Application No. 1551071-2. |
| CN; Second Office Action dated Apr. 29, 2019 in Application No. 201480065117.6. |
| PCT; International Search Report dated Feb. 12, 2019 in International Application PCT/US2019/056562 (Received Apr. 25, 2019). |
| PCT; Written Opinion dated Feb. 12, 2019 in International Application No. PCT/US2019/056562 (Received Apr. 25, 2019). |
| USPTO; Non-Final Office Action dated Sep. 30, 2019 in U.S. Appl. No. 16/152,342. |
| USPTO; Notice of Allowance dated Aug. 28, 2019 in the U.S. Appl. No. 15/821,212. |
| USPTO; Restriction Requirement dated Jun. 11, 2019 in the U.S. Appl. No. 16/164,468. |
| CN; Third Office Action dated Aug. 8, 2019 in Application No. 201480065117.6. |
| PCT; International Preliminary Report on Patentability dated Jan. 19, 2017 in the International Application No. PCT/US2015/039797. |
| PCT; International Preliminary Report on Patentability dated Aug. 15, 2019 in the International Application No. PCT/US2018/016610. |
| PCT; International Search Report and Written Opinion dated Mar. 22, 2019 in the International Application No. PCT/US2018/063468. |
| PCT; International Search Report and Written Opinion dated Aug. 9, 2019 in the International Application No. PCT/US2019/027993. |
| USPTO; Office Action dated Oct. 8, 2015 in U.S. Appl. No. 14/092,165. |
| USPTO; Office Action dated Sep. 18, 2015 in U.S. Appl. No. 14/164,919. |
| USPTO; Office Action dated Apr. 5, 2016 in U.S. Appl. No. 14/500,363. |
| USPTO; Final Office Action dated Jun. 3, 2016 in U.S. Appl. No. 14/092,165. |
| USPTO; Final Office Action dated Apr. 26, 2016 in U.S. Appl. No. 14/164,919. |
| USPTO; Office Action dated Jun. 22, 2016 in U.S. Appl. No. 14/745,100. |
| USPTO; Office action dated Apr. 22, 2016 in U.S. Appl. No. 14/709,231. |
| USPTO; Notice of Allowance dated Aug. 16, 2016 in U.S. Appl. No. 14/092,165. |
| USPTO; Office Action dated Oct. 6, 2016 in U.S. Appl. No. 14/197,517. |
| USPTO; Final Office Action dated Oct. 26, 2016 in U.S. Appl. No. 14/500,363. |
| USPTO; Final Office Action dated Oct. 11, 2016 in U.S. Appl. No. 14/709,231. |
| USPTO; Notice of Allowance dated Oct. 14, 2016 in U.S. Appl. No. 14/164,919. |
| USPTO; Final Office Action dated Dec. 20, 2016 in U.S. Appl. No. 14/745,100. |
| USPTO; Office Action dated Nov. 25, 2016 in U.S. Appl. No. 14/795,210. |
| USPTO; Office Action dated Apr. 7, 2017 in U.S. Appl. No. 14/500,363. |
| USPTO; Office Action dated Apr. 14, 2017 in U.S. Appl. No. 14/905,639. |
| USPTO; Office Action dated Apr. 6, 2017 in U.S. Appl. No. 14/709,231. |
| USPTO; Office Action dated May 4, 2017 in U.S. Appl. No. 14/745,100. |
| USPTO; Final Office Action dated Jun. 30, 2017 in U.S. Appl. No. 14/197,517. |
| USPTO; Final Office Action dated Aug. 17, 2017 in U.S. Appl. No. 14/795,210. |
| USPTO; Notice of Allowance dated Oct. 11, 2017 in U.S. Appl. No. 14/905,639. |
| USPTO; Final Office Action dated Oct. 3, 2017 in U.S. Appl. No. 14/500,363. |
| USPTO; Final Office action dated Sep. 29, 2017 in U.S. Appl. No. 14/709,231. |
| USPTO; Office Action dated Oct. 25, 2017 in U.S. Appl. No. 15/435,884. |
| USPTO; Final Office Action dated Oct. 13, 2017 in U.S. Appl. No. 14/745,100. |
| USPTO; Notice of Allowance dated Nov. 29, 2017 in U.S. Appl. No. 14/905,639. |
| USPTO; Non-Final Office Action dated Dec. 12, 2017 in U.S. Appl. No. 15/367,961. |
| USPTO; Non-Final Office Action dated Jan. 8, 2018 in U.S. Appl. No. 15/065,713. |
| USPTO; Notice of Allowance dated Feb. 26, 2018 in U.S. Appl. No. 14/745,100. |
| USPTO; Non-Final Office Action dated Mar. 8, 2018 in U.S. Appl. No. 14/197,517. |
| USPTO; Notice of Allowance dated May 7, 2018 in U.S. Appl. No. 15/065,713. |
| USPTO; Notice of Allowance dated May 17, 2018 in U.S. Appl. No. 14/709,231. |
| USPTO; Non-Final Office Action dated May 18, 2018 in U.S. Appl. No. 15/644,556. |
| USPTO; Notice of Allowance dated May 22, 2018 in U.S. Appl. No. 15/435,884. |
| USPTO; Notice of Allowance dated May 29, 2018 in U.S. Appl. No. 15/065,713. |
| USPTO; Notice of Allowance dated Jun. 20, 2018 in U.S. Appl. No. 15/435,884. |
| USPTO; Non-Final Office Action dated Jun. 28, 2018 in U.S. Appl. No. 14/795,210. |
| USPTO; Notice of Allowance dated Jun. 29, 2018 in U.S. Appl. No. 15/065,713. |
| USPTO; Notice of Allowance dated Jul. 5, 2018 in U.S. Appl. No. 14/745,100. |
| USPTO; Notice of Allowance dated Jul. 10, 2018 in U.S. Appl. No. 14/709,231. |
| USPTO; Final Office Action dated Aug. 10, 2018 in U.S. Appl. No. 15/367,961. |
| USPTO; Notice of Allowance dated Sep. 28, 2018 in U.S. Appl. No. 15/644,556. |
| USPTO; Final Office Action dated Oct. 18, 2018 in U.S. Appl. No. 14/197,517. |
| EP; Extended Search Report dated Sep. 17, 2015 in Application Serial No. 15740208.2. |
| Sweden; Office Action dated Nov. 18, 2015 in Application Serial No. 1551071-2. |
| EP; Supplemental Search Report dated Jun. 14, 2016 in Application Serial No. 13859205.0. |
| EP; Supplemental Search Report dated Oct. 20, 2016 in Application Serial No. 14760041.5. |
| EP; Extended Search Report dated Jan. 24, 2017 in Application Serial No. 14760041.5. |
| EP; Supplemental Search Report dated Mar. 2, 2017 in Application Serial No. 14826056.5. |
| EP; Extended Search Report dated Mar. 21, 2017 in Application Serial No. 14846886.1. |
| MX; Examination Report dated Feb. 24, 2017 in Application Serial No. 2015/006550. |
| MX; Examination Report dated Apr. 21, 2017 in Application Serial No. 2015/011314. |
| JP; Examination Report dated Jul. 28, 2017 in Application Serial No. 2015-545200. |
| CN; Examination Report dated Jul. 28, 2017 in Application Serial No. 20138007041.5X [Assoc did not report OA Until Sep. 27, 2017]. |
| CN; 2nd Examination Report dated Apr. 18, 2018 in Application Serial No. 201380070415.X. |
| CN; Examination Report dated May 9, 2018 in Application Serial No. 201480023946.8. |
| CN; 1st Office Action dated Nov. 20, 2018 in Application Serial No. 201580016416.5. |
| MX; 2nd Examination Report dated Oct. 24, 2017 in Application Serial No. 2015/011314. |
| MX; 3rd Examination Report dated Jul. 2, 2018 in Application No. 2015/011314 (Received on Sep. 7, 2018). |
| EP; Supplemental Search Report dated Sep. 15, 2017 in Application Serial No. 15740208.2. |
| MX; Office Action dated Jan. 23, 2018 in Application Serial No. MX/a/2016/003798. |
| TW; Office Action dated Jan. 24, 2018 in Application Serial No. 104102514. |
| TW; Notice of Allowance dated May 15, 2018 in Application Serial No. 104102514. |
| EP; Extended Search Report dated Apr. 9, 2018 in Application Serial No. 15848371.9. |
| EP; Supplementary Search Report dated Apr. 30, 2018 in Application Serial No. 15848371.9. |
| EP; Extended Search Report dated Apr. 24, 2018 in Application Serial No. 15819468.8. |
| JP; Office Action dated Aug. 2, 2017 in Application Serial No. 2015-545200. |
| JP; Notice of Allowance dated Mar. 17, 2018 in Application Serial No. 2015-545200. |
| JP; Office Action dated Feb. 2, 2018 in Application Serial No. 2016-549317. |
| AU; 1st Office Action dated Apr. 13, 2018 in Application Serial No. 2013352236. |
| EP; Extended Search Report and Supplementary Search Report dated Oct. 19, 2018 in Application Serial No. 16762464.2. |
| AU; 1st Office Action dated Oct. 24, 2018 in Application Serial No. 2015287705. |
| MX; 2nd Examination Report dated Oct. 4, 2018 (Received from Mexico Counsel on Nov. 6, 2018) in Application Serial No. MX/a/2016/003798. |
| CN; 3rd Examination Report dated Oct. 31, 2018 in Application Serial No. CN 2013 80070415. |
| EPO; Examination Report dated Nov. 8, 2018 in Application No. EP 15740208.2. |
| AU; Examination Report dated Dec. 19, 2018 in Application Serial No. AU 2014225864. |
| PCT; International Search Report dated Jul. 4, 2014 in Application No. US2014/020624. |
| PCT; Written Opinion dated Jul. 4, 2014 in Application No. US2014/020624. |
| PCT; International Preliminary Report on Patentability dated Sep. 8, 2015 in Application No. US2014/020624. |
| PCT; International Search Report dated Nov. 13, 2014 inUS2014/047054. |
| PCT; Written Opinion dated Nov. 13, 2014 in US2014/047054. |
| PCT; International Preliminary Report on Patentability dated Jan. 19, 2016 in US2014/047054. |
| PCT; International Search Report dated Jan. 6, 2015 inUS2014/058126. |
| PCT; Written Opinion dated Jan. 6, 2015 inUS2014/058126. |
| PCT; International Search Report dated Mar. 5, 2014 inU.S. Pat. No. 2013042089. |
| PCT; Written Opinion dated Mar. 5, 2015 in US2013/072089. |
| PCT; International Preliminary Report on Patentability dated Jun. 2, 2015 in U.S. Pat. No. 2013072089. |
| PCT; International Search Report dated Apr. 24, 2015 in US2015/012063. |
| PCT; Written Opinion dated Apr. 24, 2015 in US2015/012063. |
| PCT; International Search Report and Written Opinion dated Oct. 6, 2015 in US2015/036801. |
| PCT; International Search Report and Written Opinion dated Nov. 2, 2015 in US2015/039797. |
| PCT; International Preliminary Report on Patentability dated Apr. 14, 2016 in US2014/058126. |
| PCT; International Search Report and Written Opinion dated Jul. 11, 2016 in US2016/021627. |
| PCT; International Search Report and Written Opinion dated Mar. 20, 2017 in US/2016/064744. |
| PCT; International Search Report and Written Opinion dated Feb. 20, 2018 in US/2017/063061 received May 31, 2018. |
| PCT; International Search Report and Written Opinion dated Aug. 9, 2018 in International Application PCT/US2018/016610. |
| Kim, Young-Gon, and Moon-Seog Jun. A design of user authentication system using QR code identifying method. Computer Sciences and Convergence Information Technology (ICCIT), 6th International Conference on IEEE. Nov 29-Dec. 1, 2011. |
| Application Programming Interface by David Orenstein, published Jan. 10, 2000 on Computerworld.com. |
| Gerd Kortuem et al., “Architectural Issues in Supporting Ad-hoc Collaboration with Wearable Computers,” In: Proceedings of the Workshop on Software Engineering for Wearable and Pervasive Computing at the 22nd International Conference on Software Engineering, 2000. |
| 3rd party observation dated Dec. 22, 2015 against Patent Application No. 1551071-2 in Sweden. |
| Revault Product Data Sheet dated Mar. 19, 2015. |
| Dusk Jockeys; Dust Jockeys Android Apps dated Mar. 7, 2012, pp. 1-5. |
| Sue White: Wi-Fi and Bluetooth Coexistence, Electronic Component News, Mar. 2, 2012, pp. 1-7, XP05504386, Retrieved from Internet: URL: https://www.ecnmag.com/article/2012/03/wi-fi-andbluetooth-coexistence [retrieved on Sep. 6, 2017]. |
| “Class Persistent Manager,” https://web.archive.org/web/20131110042918/https://tomcat.apache.org/tomcat-4.1-doc/catalina/docs/api/org/apache/catalina/session, 3 Pages, (Oct. 2018). |
| EP; European Extended Search Report in the EP Application No. 18748348.2 dated Nov. 4, 2020. |
| USPTO; Notice of Allowance dated Oct. 31, 2019 in the U.S. Appl. No. 16/164,468. |
| USPTO; Non-Final Office Action dated Dec. 20, 2019 in the U.S. Appl. No. 16/164,468. |
| USPTO; Non-Final Office Action dated Jan. 10, 2020 in the U.S. Appl. No. 16/387,464. |
| USPTO; Notice of Allowance dated Dec. 16, 2020 in the U.S. Appl. No. 16/554,373. |
| USPTO; Notice of Allowance dated Dec. 16, 2020 in the U.S. Application No. 16/387,464. |
| EP; European Notice of Publication in the EP Application No. 18882373.6 dated Sep. 9, 2020. |
| EP; Extended Search Report dated Nov. 4, 2020 in EP 18748348.2. |
| PCT; International Preliminary Patentability Report dated Oct. 29, 2020 in PCT/US2019027993. |
| PCT; International Preliminary Report on Patentability dated Dec. 26, 2019 in PCT/US2018/037643. |
| USPTO; Notice of Allowance dated Apr. 29, 2020 in the U.S. Appl. No. 16/164,468. |
| USPTO; Final Office Action dated Jul. 24, 2020 in the U.S. Appl. No. 16/387,464. |
| USPTO; Non-Final Office Action dated Sep. 29, 2020 in the U.S. Appl. No. 16/483,004. |
| EP; European Search Report dated Jul. 31, 2020 in the EP Application No. 18748348.2. |
| X Autohaux, “Keyless Entry System”, Jun. 2, 2016, XP055717379 Retrieved from the Internet URL: hltps://images-na.ssl-images-amazon.com/images/I/91ncMVRWOSL.pdf [retrieved on 2020-. |
| USPTO; Supplemental Notice of Allowance dated Feb. 18, 2021 in the U.S. Appl. No. 16/554,373. |
| USPTO; Final Office Action dated Mar. 29, 2021 in the U.S. Appl. No. 16/483,004. |
| EP; Extended European Search Report dated May 19, 2021 in the EP Application No. 18816954.4. |
| PKCS #5 V2.0 Password-Based Cryptography Standard, Pkcs NRB.1 V2.0: Rsa Cryptography Standard, XX, XX, #5 Mar. 25, 1999. |
| Modern Programmable Controller Network Communication Technology, Wang Renxiang, Wang Xiaoman, pp. 176-180, China Electric Power Press, May 2006. |
| CN; Office Action dated May 24, 2021 in Application Serial No. 201980040511.7. |
| EP; Search Report dated Jul. 9, 2021 in Application Serial No. 18882373.6. |
| CN; Office Action dated Aug. 16, 2021 in Application Serial No. 201880020064.4. |
| JP; Office Action dated Nov. 29, 2021 in Application Serial No. 2019-542452. |
| EP; Search Report dated Dec. 2, 2021 in Application Serial No. 19788549.4. |
| IN; Office Action dated Mar. 9, 2022 in Application Serial No. 202017000785. |
| AU; Office Action dated Apr. 28, 2022 in Application Serial No. 2018285545. |
| CN; Office Action dated May 6, 2022 in Application Serial No. 201880020064.4. |
| JP; Office Action dated May 27, 2022 in Application Serial No. 2019-542452. |
| KR; Office Action dated Jul. 15, 2022 in Application Serial No. 10-2020-7000866. |
| JP; Office Action dated Jul. 27, 2022 in Application Serial No. 2019-569833. |
| KR; Office Action dated Aug. 12, 2022 in Application Serial No. 10-2019-7025759. |
| CN; Office Action dated Aug. 15, 2022 in Application Serial No. 201880020064.4. |
| IN; Office Action dated Aug. 23, 2022 in Application Serial No. 202017048781. |
| KR; Office Action dated Oct. 25, 2022 in Application Serial No. 10-2022-7032033. |
| KR; Office Action dated Oct. 25, 2022 in Application Serial No. 10-2022-7032036. |
| EP; Office Action dated Nov. 7, 2022 in Application Serial No. 18748348.2. |
| TW; Office Action dated Dec. 21, 2022 in Application Serial No. 108113448. |
| JP; Office Action dated Jan. 11, 2023 in Application Serial No. 2020-529716. |
| EP; Office Action dated Feb. 27, 2023 in Application Serial No. 18882373.6. |
| USPTO; Non-Final Office Action dated Jul. 22, 2020 in U.S. Appl. No. 16/554,373. |
| USPTO; Non-Final Office Action dated Oct. 6, 2021 in U.S. Appl. No. 16/483,004. |
| USPTO; Notice of Allowance dated Mar. 9, 2022 in U.S. Appl. No. 17/228,541. |
| USPTO; Final Office Action dated Apr. 25, 2022 in U.S. Appl. No. 16/483,004. |
| USPTO; Non-Final Office Action dated Sep. 9, 2022 in U.S. Appl. No. 16/483,004. |
| KIPO; Notice of Allowance dated Sep. 22, 2022 in Application No. 2022-071947008. |
| JPO; Notice of Allowance dated Oct. 21, 2022 in Application No. JP 2016-542452. |
| JPO; Notice of Reason for Rejection dated Jan. 27, 2023 in Application No. JP 2020-557949. |
| JPO; Notice of Reason for Rejection dated Feb. 3, 2023 in Application No. JP 2019-569833. |
| USPTO; Notice of Allowance dated Mar. 7, 2023 in U.S. Appl. No. 16/483,004. |
| JPO; Notice of Allowance dated Apr. 17, 2023 for Application No. 2023-034742281. |
| KIPO; Notice of Preliminary Rejection dated Apr. 29, 2023 in Application No. 2020-7019034. |
| KIPO; Notice of Preliminary Rejection dated May 17, 2023 in Application No. 2022-7045455. |
| KIPO; Notice of Allowance dated May 24, 2023 in Application No. 2023-047665504. |
| KIPO; Notice of Allowance dated May 24, 2023 in Application No. 2023-047665649. |
| IMPI; First Office Action dated Apr. 27, 2023 in Application No. MX/a/2019/015176. |
| AGIP; First Examination Report dated Jul. 10, 2023 in Application No. 2018374384. |
| PCT; International Search Report and Written Opinion dated May 15, 2018 in Application No. PCT/US2018/016610. |
| PCT; International Search Report and Written Opinion dated Oct. 12, 2018 in Application No. PCT/US2018/037643. |
| CNIPA; Notice of the First Office Action dated Mar. 28, 2023 in Application No. 201880052992.9. |
| Number | Date | Country | |
|---|---|---|---|
| 20190173677 A1 | Jun 2019 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62593603 | Dec 2017 | US |
