Log in
Enquire now
‌

US Patent 10261784 Detecting copied computer code using cryptographically hashed overlapping shingles

Patent 10261784 was granted and assigned to Terbium Labs on April, 2019 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Is a
Patent
Patent
0

Patent attributes

Patent Applicant
Terbium Labs
Terbium Labs
0
Current Assignee
Terbium Labs
Terbium Labs
0
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
0
Patent Number
102617840
Patent Inventor Names
Daniel J. Rogers0
Dionysus Blazakis0
Date of Patent
April 16, 2019
0
Patent Application Number
160131610
Date Filed
June 20, 2018
0
Patent Citations Received
‌
US Patent 11882140 System and method for detecting repetitive cybersecurity attacks constituting an email campaign
0
Patent Primary Examiner
‌
Roderick Tolentino
0
Patent abstract

Systems and methods of detecting copying of code or portions of code involve disassembling a set of compiled code into an architecture-agnostic intermediate representation. The intermediate representation is used to form a number of cryptographically hashed overlapping shingles. The number of cryptographically hashed overlapping shingles can be searched against a database of cryptographically hashed overlapping shingles to identify copied code.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 10261784 Detecting copied computer code using cryptographically hashed overlapping shingles

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.