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: EP2656266

EP2656266 - IMPROVEMENTS RELATING TO CRYPTOGRAPHY USING POLYMORPHIC CODE [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  02.08.2019
Database last updated on 31.08.2024
FormerThe patent has been granted
Status updated on  24.08.2018
FormerGrant of patent is intended
Status updated on  17.04.2018
FormerExamination is in progress
Status updated on  24.02.2017
Most recent event   Tooltip03.07.2020Lapse of the patent in a contracting state
New state(s): CY, MK		published on 05.08.2020  [2020/32]
Applicant(s)For all designated states
Google Technology Holdings LLC
1600 Amphitheatre Parkway
Mountain View, CA 94043 / US
[2016/21]
Former [2013/44]For all designated states
Motorola Mobility LLC
600 North US Highway 45
Libertyville, IL 60048 / US
Inventor(s)01 / ANDERSON, Lex Aaron
2/34 Sylvia Avenue
St Heliers
Auckland 1071 / NZ
 [2013/44]
Representative(s)Boult Wade Tennant LLP
Salisbury Square House
8 Salisbury Square
London EC4Y 8AP / GB
[N/P]
Former [2018/39]Boult Wade Tennant LLP
Verulam Gardens
70 Gray's Inn Road
London WC1X 8BT / GB
Former [2013/44]Boult Wade Tennant
Verulam Gardens
70 Grays Inn Road
London WC1X 8BT / GB
Application number, filing date11808996.013.12.2011
[2018/39]
WO2011US64522
Priority number, dateUS201061425086P20.12.2010         Original published format: US 201061425086 P
US2010097495221.12.2010         Original published format: US 974952
[2013/44]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report
No.:WO2012087650
Date:28.06.2012
Language:EN
[2012/26]
Type: A1 Application with search report 
No.:EP2656266
Date:30.10.2013
Language:EN
The application published by WIPO in one of the EPO official languages on 28.06.2012 takes the place of the publication of the European patent application.
[2013/44]
Type: B1 Patent specification 
No.:EP2656266
Date:26.09.2018
Language:EN
[2018/39]
Search report(s)International search report - published on:EP28.06.2012
ClassificationIPC:G06F21/14, H04L9/00
[2018/18]
CPC:
G06F21/14 (EP,US); H04L9/002 (EP,US); H04L2209/08 (EP,US);
H04L2209/16 (EP,US)
Former IPC [2013/44]G06F21/00, H04L9/00
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,   RS,   SE,   SI,   SK,   SM,   TR [2013/44]
Extension statesBANot yet paid
MENot yet paid
TitleGerman:VERBESSERUNGEN IM ZUSAMMENHANG MIT KRYPTOGRAFIE ANHAND VON POLYMORPHEN CODES[2013/44]
English:IMPROVEMENTS RELATING TO CRYPTOGRAPHY USING POLYMORPHIC CODE[2013/44]
French:AMÉLIORATIONS APPORTÉES À LA CRYPTOGRAPHIE À L'AIDE D'UN CODE POLYMORPHE[2013/44]
Entry into regional phase27.06.2013National basic fee paid 
27.06.2013Designation fee(s) paid 
27.06.2013Examination fee paid 
Examination procedure27.06.2013Examination requested  [2013/44]
05.02.2014Amendment by applicant (claims and/or description)
18.11.2015Despatch of a communication from the examining division (Time limit: M06)
24.03.2016Reply to a communication from the examining division
14.10.2016Despatch of a communication from the examining division (Time limit: M04)
23.02.2017Reply to a communication from the examining division
17.07.2017Despatch of a communication from the examining division (Time limit: M04)
16.11.2017Reply to a communication from the examining division
18.04.2018Communication of intention to grant the patent
14.08.2018Fee for grant paid
14.08.2018Fee for publishing/printing paid
14.08.2018Receipt 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  18.11.2015
Opposition(s)27.06.2019No opposition filed within time limit [2019/36]
Fees paidRenewal fee
06.12.2013Renewal fee patent year 03
29.12.2014Renewal fee patent year 04
28.12.2015Renewal fee patent year 05
27.12.2016Renewal fee patent year 06
27.12.2017Renewal fee patent year 07
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  TooltipHU13.12.2011
AL26.09.2018
AT26.09.2018
CY26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
MC26.09.2018
MK26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SI26.09.2018
SK26.09.2018
SM26.09.2018
TR26.09.2018
IE13.12.2018
LU13.12.2018
MT13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
IS26.01.2019
PT26.01.2019
[2020/31]
Former [2020/30]HU13.12.2011
AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
MC26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SI26.09.2018
SK26.09.2018
SM26.09.2018
TR26.09.2018
IE13.12.2018
LU13.12.2018
MT13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
IS26.01.2019
PT26.01.2019
Former [2020/17]AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
MC26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SI26.09.2018
SK26.09.2018
SM26.09.2018
TR26.09.2018
IE13.12.2018
LU13.12.2018
MT13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
IS26.01.2019
PT26.01.2019
Former [2020/08]AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
MC26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SI26.09.2018
SK26.09.2018
SM26.09.2018
IE13.12.2018
LU13.12.2018
MT13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
IS26.01.2019
PT26.01.2019
Former [2020/04]AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
MC26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SI26.09.2018
SK26.09.2018
SM26.09.2018
IE13.12.2018
LU13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
BE31.12.2018
CH31.12.2018
LI31.12.2018
IS26.01.2019
PT26.01.2019
Former [2019/50]AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
MC26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SI26.09.2018
SK26.09.2018
SM26.09.2018
IE13.12.2018
LU13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
BE31.12.2018
IS26.01.2019
PT26.01.2019
Former [2019/48]AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
MC26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SK26.09.2018
SM26.09.2018
IE13.12.2018
LU13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
IS26.01.2019
PT26.01.2019
Former [2019/40]AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
MC26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SK26.09.2018
SM26.09.2018
LU13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
IS26.01.2019
PT26.01.2019
Former [2019/39]AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SK26.09.2018
SM26.09.2018
LU13.12.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
IS26.01.2019
PT26.01.2019
Former [2019/34]AL26.09.2018
AT26.09.2018
CZ26.09.2018
DK26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SK26.09.2018
SM26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
IS26.01.2019
PT26.01.2019
Former [2019/26]AL26.09.2018
AT26.09.2018
CZ26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SK26.09.2018
SM26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
IS26.01.2019
PT26.01.2019
Former [2019/23]AL26.09.2018
AT26.09.2018
CZ26.09.2018
EE26.09.2018
ES26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
SK26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
IS26.01.2019
Former [2019/22]AL26.09.2018
CZ26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
NL26.09.2018
PL26.09.2018
RO26.09.2018
RS26.09.2018
SE26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
IS26.01.2019
Former [2019/21]AL26.09.2018
FI26.09.2018
HR26.09.2018
IT26.09.2018
LT26.09.2018
LV26.09.2018
NL26.09.2018
RS26.09.2018
SE26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
IS26.01.2019
Former [2019/20]AL26.09.2018
FI26.09.2018
HR26.09.2018
LT26.09.2018
LV26.09.2018
NL26.09.2018
RS26.09.2018
SE26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
Former [2019/12]AL26.09.2018
FI26.09.2018
HR26.09.2018
LT26.09.2018
LV26.09.2018
RS26.09.2018
SE26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
Former [2019/11]FI26.09.2018
HR26.09.2018
LT26.09.2018
RS26.09.2018
SE26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
Former [2019/10]FI26.09.2018
LT26.09.2018
RS26.09.2018
SE26.09.2018
BG26.12.2018
NO26.12.2018
GR27.12.2018
Former [2019/08]FI26.09.2018
LT26.09.2018
NO26.12.2018
Former [2019/07]LT26.09.2018
Cited inInternational search[IA]US2008184041  (JAKUBOWSKI MARIUSZ H [US], et al) [I] 1,2,4,8-10,12,16-18,20,24 * paragraph [0035]; figure 2 * * paragraphs [0088] - [0094]; figure 5 * [A] 3,5-7,11,13-15,19,21-23;
 [XAY]  - CHRISTOPH HERBST ET AL, An AES Smart Card Implementation Resistant to Power Analysis Attacks, APPLIED CRYPTOGRAPHY AND NETWORK SECURITY LECTURE NOTES IN COMPUTER SCIENCE;;LNCS, SPRINGER, BERLIN, DE, PAGE(S) 239 - 252, (20060101), ISBN 978-3-540-34703-3, XP019034418 [X] 8,16,24 * section 3.1 and 3.2;; figure 5 * [A] 3-7,11-15,19-23 [Y] 1,2,9,10,17,18

DOI:   http://dx.doi.org/10.1007/11767480_16
 [XAY]  - STEFAN TILLICH ET AL, Protecting AES Software Implementations on 32-Bit Processors Against Power Analysis, APPLIED CRYPTOGRAPHY AND NETWORK SECURITY; [LECTURE NOTES IN COMPUTER SCIENCE;;LNCS], SPRINGER BERLIN HEIDELBERG, BERLIN, HEIDELBERG, PAGE(S) 141 - 157, (20070605), ISBN 978-3-540-72737-8, XP019080164 [X] 8,16,24 * sections 3.2-3.4 * [A] 3-7,11-15,19-23 [Y] 1,2,9,10,17,18

DOI:   http://dx.doi.org/10.1007/978-3-540-72738-5_10
 [Y]  - RYAD BENADJILA AND OLIVIER BILLET AND STANISLAS FRANCFORT, "Drm to counter side-channel attacks?", (CONFERENCE INFO: PROCEEDINGS OF THE 2007 ACM WORKSHOP ON DIGITAL RIGHTS MANAGEMENT),, (20071029), pages 23 - 32, XP009141304 [Y] 1,2,8-10,16-18,24 * section 2 section 3.2 *
 [Y]  - Julien Bringer ET AL, "White Box Cryptography: Another Attempt", (20061220), URL: http://eprint.iacr.org/2006/468.pdf, (20120314), XP055021857 [Y] 1,2,8-10,16-18,24 * section 3.3 *
 [Y]  - MICHAL STREHOVSKY, "Advanced self-modifying code", (20070802), pages 1 - 5, 20070802, URL: http://migeel.sk/blog/2007/08/02/advanced-self-modifying-code/, (20120312), XP007920374 [Y] 1,2,9,10,17,18
ExaminationUS2009041236
    - Czeslaw Koscielny, "GENERATING QUASIGROUPS FOR CRYPTOGRAPHIC APPLICATIONS", Int. J. Appl. Math. Comput. Sci, (20020101), vol. 12, no. 4, pages 559 - 569, XP055227172
    - SHCHERBACOV V A, "Quasigroups in cryptology", ARXIV.ORG, CORNELL UNIVERSITY LIBRARY, 201 OLIN LIBRARY CORNELL UNIVERSITY ITHACA, NY 14853, (20100721), XP080489400
    - PRG A!CLAV SN PRG A!SEL V ET AL, Genetic Algorithms Evolving Quasigroups with Good Pseudorandom Properties, COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2010, SPRINGER BERLIN HEIDELBERG, BERLIN, HEIDELBERG, PAGE(S) 472 - 482, (20100323), ISBN 978-3-642-12178-4, XP019139540
    - Kristen Ann Meyer, "A new message authentication code based on the non-associativity of quasigroups", ISBN 978-0-542-68427-2, (20060101), URL: http://orion.math.iastate.edu/dept/thesisarchive/PHD/KMeyerPhDSp06.pdf, (20151111), XP055227546
by applicantUS2008184041
    - CHRISTOPH HERBST ET AL., "An AES Smart Card Implementation Resistant to Power Analysis Attacks", APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, LECTURE NOTES IN COMPUTER SCIENCE (LNCS, (20060101), pages 239 - 252, XP019034418

DOI:   http://dx.doi.org/10.1007/11767480_16
    - STEFAN TILLICH ET AL., "Protecting AES Software Implementations on 32-Bit Processors Against Power Analysis", APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, LECTURE NOTES IN COMPUTER SCIENCE (LNCS, (20070605), pages 141 - 157
    - RYAD BENADJILA; OLIVIER BILLET; STANISLAS FRANCFORT, "DRM to counter side-channel attacks?", CONFERENCE INFO: PROCEEDINGS OF THE 2007 ACM WORKSHOP ON DIGITAL RIGHTS MANAGEMENT, (20071029), doi:doi:10.1145/1314276.1314282, pages 23 - 32, XP058334631

DOI:   http://dx.doi.org/10.1145/1314276.1314282
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.