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 information for Unitary Patents.

2024-03-06

More...
blank Related links

Extract from the Register of European Patents

EP About this file: EP3900255

EP3900255 - A CIRCUIT COMPILING DEVICE AND CIRCUIT EVALUATION DEVICE [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  05.05.2023
Database last updated on 12.07.2024
FormerThe patent has been granted
Status updated on  27.05.2022
FormerGrant of patent is intended
Status updated on  14.02.2022
FormerRequest for examination was made
Status updated on  24.09.2021
FormerThe international publication has been made
Status updated on  02.07.2020
Formerunknown
Status updated on  17.12.2019
Most recent event   Tooltip14.06.2024Lapse of the patent in a contracting state
New state(s): MC, TR
published on 17.07.2024 [2024/29]
Applicant(s)For all designated states
Koninklijke Philips N.V.
High Tech Campus 52
5656 AG Eindhoven / NL
[2021/43]
Inventor(s)01 / RIETMAN, Ronald
High Tech Campus 5
5656 AE Eindhoven / NL
02 / DE HOOGH, Sebastiaan, Jacobus, Antonius
High Tech Campus 5
5656 AE Eindhoven / NL
 [2021/43]
Representative(s)Philips Intellectual Property & Standards
High Tech Campus 52
5656 AG Eindhoven / NL
[2022/26]
Former [2021/43]Philips Intellectual Property & Standards
High Tech Campus 5
5656 AE Eindhoven / NL
Application number, filing date19816786.813.12.2019
[2021/43]
WO2019EP85000
Priority number, dateEP2018021393619.12.2018         Original published format: EP 18213936
[2021/43]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report
No.:WO2020126863
Date:25.06.2020
Language:EN
[2020/26]
Type: A1 Application with search report 
No.:EP3900255
Date:27.10.2021
Language:EN
The application published by WIPO in one of the EPO official languages on 25.06.2020 takes the place of the publication of the European patent application.
[2021/43]
Type: B1 Patent specification 
No.:EP3900255
Date:29.06.2022
Language:EN
[2022/26]
Search report(s)International search report - published on:EP25.06.2020
ClassificationIPC:H04L9/00
[2021/43]
CPC:
H04L9/004 (EP,US)
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 [2021/43]
Extension statesBANot yet paid
MENot yet paid
Validation statesKHNot yet paid
MANot yet paid
MDNot yet paid
TNNot yet paid
TitleGerman:SCHALTUNGSKOMPILIERUNGSVORRICHTUNG UND SCHALTUNGSBEURTEILUNGSVORRICHTUNG[2021/43]
English:A CIRCUIT COMPILING DEVICE AND CIRCUIT EVALUATION DEVICE[2021/43]
French:DISPOSITIF DE COMPILATION DE CIRCUITS ET DISPOSITIF D'ÉVALUATION DE CIRCUITS[2022/09]
Former [2021/43]DISPOSITIF DE COMPILATION DE CIRCUIT ET DISPOSITIF D'ÉVALUATION DE CIRCUIT
Entry into regional phase19.07.2021National basic fee paid 
19.07.2021Designation fee(s) paid 
19.07.2021Examination fee paid 
Examination procedure16.07.2021Amendment by applicant (claims and/or description)
19.07.2021Examination requested  [2021/43]
19.07.2021Date on which the examining division has become responsible
15.02.2022Communication of intention to grant the patent
19.05.2022Fee for grant paid
19.05.2022Fee for publishing/printing paid
19.05.2022Receipt of the translation of the claim(s)
Opposition(s)30.03.2023No opposition filed within time limit [2023/23]
Fees paidRenewal fee
03.01.2022Renewal fee patent year 03
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.2019
AL29.06.2022
AT29.06.2022
CY29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
IT29.06.2022
LT29.06.2022
LV29.06.2022
MC29.06.2022
MK29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
TR29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
IE13.12.2022
LU13.12.2022
BE31.12.2022
CH31.12.2022
LI31.12.2022
[2024/29]
Former [2024/27]HU13.12.2019
AL29.06.2022
AT29.06.2022
CY29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
IT29.06.2022
LT29.06.2022
LV29.06.2022
MK29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
IE13.12.2022
LU13.12.2022
BE31.12.2022
CH31.12.2022
LI31.12.2022
Former [2024/25]HU13.12.2019
AL29.06.2022
AT29.06.2022
CY29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
IT29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
IE13.12.2022
LU13.12.2022
BE31.12.2022
CH31.12.2022
LI31.12.2022
Former [2024/21]AL29.06.2022
AT29.06.2022
CY29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
IT29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
IE13.12.2022
LU13.12.2022
BE31.12.2022
CH31.12.2022
LI31.12.2022
Former [2024/11]AL29.06.2022
AT29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
IT29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
IE13.12.2022
LU13.12.2022
BE31.12.2022
CH31.12.2022
LI31.12.2022
Former [2023/49]AL29.06.2022
AT29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
IE13.12.2022
LU13.12.2022
BE31.12.2022
CH31.12.2022
LI31.12.2022
Former [2023/48]AL29.06.2022
AT29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
IE13.12.2022
LU13.12.2022
CH31.12.2022
LI31.12.2022
Former [2023/47]AL29.06.2022
AT29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
LU13.12.2022
CH31.12.2022
LI31.12.2022
Former [2023/38]AL29.06.2022
AT29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
LU13.12.2022
Former [2023/22]AL29.06.2022
AT29.06.2022
CZ29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
Former [2023/21]AL29.06.2022
AT29.06.2022
DK29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
Former [2023/17]AL29.06.2022
AT29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
Former [2023/12]AT29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
IS29.10.2022
PT31.10.2022
Former [2023/11]AT29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
PL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
PT31.10.2022
Former [2023/09]AT29.06.2022
EE29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
RO29.06.2022
RS29.06.2022
SE29.06.2022
SK29.06.2022
SM29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
PT31.10.2022
Former [2023/08]AT29.06.2022
ES29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
RS29.06.2022
SE29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
Former [2023/07]AT29.06.2022
FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
RS29.06.2022
SE29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
Former [2023/02]FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
NL29.06.2022
RS29.06.2022
SE29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
Former [2022/50]FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
RS29.06.2022
SE29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
Former [2022/49]FI29.06.2022
HR29.06.2022
LT29.06.2022
LV29.06.2022
SE29.06.2022
BG29.09.2022
NO29.09.2022
GR30.09.2022
Former [2022/47]FI29.06.2022
LT29.06.2022
SE29.06.2022
NO29.09.2022
Cited inInternational search[A]  - ELDIB HASSAN ET AL, Synthesis of Fault-Attack Countermeasures for Cryptographic Circuits, INTERNATIONAL CONFERENCE ON COMPUTER ANALYSIS OF IMAGES AND PATTERNS. CAIP 2017: COMPUTER ANALYSIS OF IMAGES AND PATTERNS; [LECTURE NOTES IN COMPUTER SCIENCE; LECT.NOTES COMPUTER], SPRINGER, BERLIN, HEIDELBERG, PAGE(S) 343 - 363, (20160713), ISBN 978-3-642-17318-9, XP047350858 [A] 1-15 * section 2;; figures 2, 3 *

DOI:   http://dx.doi.org/10.1007/978-3-319-41540-6_19
 [A]  - KISS ÁGNES ET AL, Valiant's Universal Circuit is Practical, INTERNATIONAL CONFERENCE ON COMPUTER ANALYSIS OF IMAGES AND PATTERNS. CAIP 2017: COMPUTER ANALYSIS OF IMAGES AND PATTERNS; [LECTURE NOTES IN COMPUTER SCIENCE; LECT.NOTES COMPUTER], SPRINGER, BERLIN, HEIDELBERG, PAGE(S) 699 - 728, (20160428), ISBN 978-3-642-17318-9, XP047351570 [A] 1-15 * section 2.1 *

DOI:   http://dx.doi.org/10.1007/978-3-662-49890-3_27
 [A]  - Andisheh Sarabi ET AL, "Design For Testability Properties of AND/XOR Networks", (19930101), URL: https://pdfs.semanticscholar.org/6bcf/1632d9b35ee143b6aabc3e90f85a823c0a54.pdf, (20190529), XP055592998 [A] 1-15 * section 2 *
 [A]  - FROESSL J ET AL, "Module generation for AND/XOR-fields (XPLAs)", PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN - VLSI IN COMPUTERS AND PROCESSORS. CAMBRIDGE, MA., OCT. 14 - 16, 19; [PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN - VLSI IN COMPUTERS AND PROCESSORS], LOS ALAMITOS, IE, (19911014), vol. -, doi:10.1109/ICCD.1991.139836, ISBN 978-0-8186-2270-0, pages 26 - 29, XP010025173 [A] 1-15 * section 1, 2 *

DOI:   http://dx.doi.org/10.1109/ICCD.1991.139836
 [A]  - CHRISTOPH DOBRAUNIG ET AL, "SIFA: Exploiting Ineffective Fault Inductions on Symmetric Cryptography", vol. 20180904:115744, (20180904), pages 1 - 26, IACR, INTERNATIONAL ASSOCIATION FOR CRYPTOLOGIC RESEARCH, URL: http://eprint.iacr.org/2018/071.pdf, (20180904), XP061027238 [A] 1-15 * abstract * * section 3, 5 *
by applicant   - J. BOYARRENE PERALTA, "A depth-16 circuit for the AES S-box", IACR eprint 2011/322
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.