blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability
Register Forum

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Release notes
European Patent Register Assistant
European Patent Register Resource Book
European Patent Register – pocket guide
FAQ - European Patent Register
FAQ - Register Alert
Federated Register (Flyer)
Global Dossier (Flyer)
Register events
Deep link coverage
Federated Register content
The Patent Information Tour
Fair use charter

Extract from the Register of European Patents

EP About this file: EP2446363

EP2446363 - Algorithm for generating a digital DNA sequence [Right-click to bookmark this link]
Former [2012/18]FUZZY HASH ALGORITHM
[2021/25]
StatusNo opposition filed within time limit
Status updated on  23.09.2022
Database last updated on 14.08.2024
FormerThe patent has been granted
Status updated on  15.10.2021
FormerGrant of patent is intended
Status updated on  03.06.2021
FormerExamination is in progress
Status updated on  04.02.2019
Most recent event   Tooltip14.06.2024Lapse of the patent in a contracting state
New state(s): TR		published on 17.07.2024  [2024/29]
Applicant(s)For all designated states
GoSecure Inc.
100 5th Avenue, 1st Floor
Waltham, MA 02451 / US
[2020/14]
Former [2019/36]For all designated states
CounterTack, Inc.
1639 11th Street, Suite 119
Santa Monica, CA 90404 / US
Former [2012/18]For all designated states
HBGary, Inc.
3604 Fair Oaks Blvd. Suite 250
Sacramento, CA 95864 / US
Inventor(s)01 / HOGLUND, Michael Gregory
3941 Park Drive
Suite 20-305
El Dorado Hills, CA 95762 / US
 [2021/46]
Former [2012/18]01 / HOGLUND, Michael, Gregory
3941 Park Drive
Suite 20-305
El Dorado Hills, CA 95762 / US
Representative(s)Mathys & Squire
The Shard
32 London Bridge Street
London SE1 9SG / GB
[2021/46]
Former [2012/18]Garratt, Peter Douglas, et al
Mathys & Squire LLP 120 Holborn London
EC1N 2SQ / GB
Application number, filing date10792455.725.06.2010
[2021/46]
WO2010US01826
Priority number, dateUS2009045920326.06.2009         Original published format: US 459203
[2012/18]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report
No.:WO2010151332
Date:29.12.2010
Language:EN
[2010/52]
Type: A1 Application with search report 
No.:EP2446363
Date:02.05.2012
Language:EN
The application published by WIPO in one of the EPO official languages on 29.12.2010 takes the place of the publication of the European patent application.
[2012/18]
Type: B1 Patent specification 
No.:EP2446363
Date:17.11.2021
Language:EN
[2021/46]
Search report(s)International search report - published on:US29.12.2010
(Supplementary) European search report - dispatched on:EP24.02.2017
ClassificationIPC:G06F21/56, H04L9/06, H04L29/06, H04L9/32
[2019/45]
CPC:
G06F21/562 (EP,IL,US); G06F21/563 (EP,IL,US); G06F21/564 (EP,IL,US);
H04L63/123 (EP,IL,US); H04L9/3239 (EP,IL,US)
Former IPC [2017/13]G06F21/56, H04L9/06, H04L29/06
Former IPC [2012/18]G06F12/14
Designated contracting statesAL,   AT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HR,   HU,   IE,   IS,   IT,   LI,   LT,   LU,   LV,   MC,   MK,   MT,   NL,   NO,   PL,   PT,   RO,   SE,   SI,   SK,   SM,   TR [2012/18]
Extension statesBANot yet paid
MENot yet paid
RSNot yet paid
TitleGerman:Algorithmus zur Erzeugung einer digitale DNA-Sequenz[2021/25]
English:Algorithm for generating a digital DNA sequence[2021/25]
French:Procédé pour générer une séquence d'ADN numérique[2021/25]
Former [2012/18]UNSCHARFER HASH-ALGORITHMUS
Former [2012/18]FUZZY HASH ALGORITHM
Former [2012/18]ALGORITHME DE HACHAGE FLOU
Entry into regional phase23.12.2011National basic fee paid 
23.12.2011Search fee paid 
23.12.2011Designation fee(s) paid 
23.12.2011Examination fee paid 
Examination procedure23.12.2011Examination requested  [2012/18]
22.09.2017Amendment by applicant (claims and/or description)
07.02.2019Despatch of a communication from the examining division (Time limit: M04)
07.06.2019Reply to a communication from the examining division
24.10.2019Despatch of a communication from the examining division (Time limit: M04)
20.02.2020Reply to a communication from the examining division
20.07.2020Despatch of a communication from the examining division (Time limit: M04)
27.11.2020Reply to a communication from the examining division
04.06.2021Communication of intention to grant the patent
12.10.2021Fee for grant paid
12.10.2021Fee for publishing/printing paid
12.10.2021Receipt of the translation of the claim(s)
Divisional application(s)The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  07.02.2019
Opposition(s)18.08.2022No opposition filed within time limit [2022/43]
Fees paidRenewal fee
31.03.2012Renewal fee patent year 03
10.06.2013Renewal fee patent year 04
27.06.2014Renewal fee patent year 05
10.06.2015Renewal fee patent year 06
27.06.2016Renewal fee patent year 07
26.06.2017Renewal fee patent year 08
28.06.2018Renewal fee patent year 09
27.06.2019Renewal fee patent year 10
26.06.2020Renewal fee patent year 11
27.08.2021Renewal fee patent year 12
Penalty fee
Additional fee for renewal fee
30.06.202112   M06   Fee paid on   27.08.2021
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court		 See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU25.06.2010
AL17.11.2021
AT17.11.2021
CY17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
IT17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
MK17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
TR17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
GB25.06.2022
IE25.06.2022
LU25.06.2022
BE30.06.2022
CH30.06.2022
FR30.06.2022
LI30.06.2022
[2024/29]
Former [2024/22]HU25.06.2010
AL17.11.2021
AT17.11.2021
CY17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
IT17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
MK17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
GB25.06.2022
IE25.06.2022
LU25.06.2022
BE30.06.2022
CH30.06.2022
FR30.06.2022
LI30.06.2022
Former [2024/20]HU25.06.2010
AL17.11.2021
AT17.11.2021
CY17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
IT17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
GB25.06.2022
IE25.06.2022
LU25.06.2022
BE30.06.2022
CH30.06.2022
FR30.06.2022
LI30.06.2022
Former [2024/18]HU25.06.2010
AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
IT17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
GB25.06.2022
IE25.06.2022
LU25.06.2022
BE30.06.2022
CH30.06.2022
FR30.06.2022
LI30.06.2022
Former [2023/27]AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
IT17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
GB25.06.2022
IE25.06.2022
LU25.06.2022
BE30.06.2022
CH30.06.2022
FR30.06.2022
LI30.06.2022
Former [2023/25]AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
IT17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
IE25.06.2022
LU25.06.2022
BE30.06.2022
CH30.06.2022
FR30.06.2022
LI30.06.2022
Former [2023/22]AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
IE25.06.2022
LU25.06.2022
CH30.06.2022
FR30.06.2022
LI30.06.2022
Former [2023/21]AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
IE25.06.2022
LU25.06.2022
CH30.06.2022
LI30.06.2022
Former [2023/20]AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
IE25.06.2022
Former [2023/08]AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
MC17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
Former [2023/01]AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SI17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
Former [2022/49]AL17.11.2021
AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
Former [2022/35]AT17.11.2021
CZ17.11.2021
DK17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SK17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
Former [2022/34]AT17.11.2021
EE17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
NL17.11.2021
PL17.11.2021
RO17.11.2021
SE17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
Former [2022/33]AT17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
NL17.11.2021
PL17.11.2021
SE17.11.2021
SM17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
Former [2022/25]AT17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
NL17.11.2021
PL17.11.2021
SE17.11.2021
BG17.02.2022
NO17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
Former [2022/24]AT17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
NL17.11.2021
PL17.11.2021
SE17.11.2021
BG17.02.2022
GR18.02.2022
IS17.03.2022
PT17.03.2022
Former [2022/23]AT17.11.2021
ES17.11.2021
FI17.11.2021
HR17.11.2021
LT17.11.2021
LV17.11.2021
PL17.11.2021
BG17.02.2022
PT17.03.2022
Former [2022/22]AT17.11.2021
FI17.11.2021
LT17.11.2021
BG17.02.2022
Former [2022/21]AT17.11.2021
BG17.02.2022
Former [2022/19]BG17.02.2022
Documents cited:Search[A]US2005060643  (GLASS JEFFREY BRIAN [US], et al) [A] 1-15 * paragraphs [0002] , [0116] - [0118] - [0123] * * claim 6 *;
 [A]US2005235154  (SERRET-AVILA XAVIER [US]) [A] 1-15 * paragraphs [0003] , [0089] - [0092] * * figures 9, 10A-10C *;
 [XI]US2008040505  (BRITTO ARTHUR [US], et al) [X] 1,2,5,8,9,12,15 * paragraphs [0004] , [0045] - [0049] - [0056] , [0057] , [0059] * * figures 10A-10D, 15 * [I] 3,4,6,7,10,11,13,14;
 [A]  - KORNBLUM ET AL, "Identifying almost identical files using context triggered piecewise hashing", DIGITAL INVESTIGATION, ELSEVIER, AMSTERDAM, NL, vol. 3, doi:10.1016/J.DIIN.2006.06.015, ISSN 1742-2876, (20060901), pages 91 - 97, (20060901), XP024979902 [A] 1-15 * abstract * * Sections 1, 3, 4, 7 *

DOI:   http://dx.doi.org/10.1016/j.diin.2006.06.015
International search[Y]US5923872  (CHRYSOS GEORGE Z [US], et al);
 [A]US2003078899  (SHANAHAN JAMES G [US]);
 [A]US6683546  (TORRUBIA-SAEZ ANDRES [ES]);
 [Y]US2005060643  (GLASS JEFFREY BRIAN [US], et al);
 [X]US2008040505  (BRITTO ARTHUR [US], et al);
 [AP]US2009271454  (ANGLIN MATTHEW J [US], et al)
by applicantUS2008040505
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.