values
+ self.__create_line(text=f"{bibl_scope.get('from')}-{bibl_scope.get('to')}", hierarchy_level_id=3, paragraph_type="biblScope_page")
+ for bibl_scope in bib_item.find_all("biblscope", {"unit": "page"}, recursive=True) if bibl_scope
+ ]
+ finally:
+ self.logger.warning("Grobid parsing warning: was non-standard format")
+
+ lines += [ # parse DOI (maybe more one)
+ self.__create_line(text=self.__tag2text(idno), hierarchy_level_id=3, paragraph_type="DOI")
+ for idno in bib_item.find_all("idno", recursive=True) if idno
+ ]
+
+ if bib_item.publisher:
+ lines.append(self.__create_line(text=self.__tag2text(bib_item.publisher), hierarchy_level_id=3, paragraph_type="publisher"))
+
+ if bib_item.date:
+ lines.append(self.__create_line(text=self.__tag2text(bib_item.date), hierarchy_level_id=3, paragraph_type="date"))
+
+ return lines, cites
+
+ def __parse_title(self, soup: Tag) -> List[LineWithMeta]:
+ return [self.__create_line(text=self.__tag2text(soup.title), hierarchy_level_id=0, paragraph_type="root")]
diff --git a/dedoc/readers/csv_reader/csv_reader.py b/dedoc/readers/csv_reader/csv_reader.py
index d1de64ed..e2e09453 100644
--- a/dedoc/readers/csv_reader/csv_reader.py
+++ b/dedoc/readers/csv_reader/csv_reader.py
@@ -25,7 +25,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower() in recognized_extensions.csv_like_format
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/docx_reader/docx_reader.py b/dedoc/readers/docx_reader/docx_reader.py
index 6e0eabde..3d4c9028 100644
--- a/dedoc/readers/docx_reader/docx_reader.py
+++ b/dedoc/readers/docx_reader/docx_reader.py
@@ -26,7 +26,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower() in recognized_extensions.docx_like_format or mime in recognized_mimes.docx_like_format
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/email_reader/email_reader.py b/dedoc/readers/email_reader/email_reader.py
index 7a239e31..448d13e0 100644
--- a/dedoc/readers/email_reader/email_reader.py
+++ b/dedoc/readers/email_reader/email_reader.py
@@ -33,7 +33,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension or mime is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return file_path.lower().endswith(".eml") or mime == "message/rfc822"
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/excel_reader/excel_reader.py b/dedoc/readers/excel_reader/excel_reader.py
index 4fc8e12c..6e882a50 100644
--- a/dedoc/readers/excel_reader/excel_reader.py
+++ b/dedoc/readers/excel_reader/excel_reader.py
@@ -33,7 +33,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower() in recognized_extensions.excel_like_format or mime in recognized_mimes.excel_like_format
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/html_reader/html_reader.py b/dedoc/readers/html_reader/html_reader.py
index 4a2668bf..83fb2085 100644
--- a/dedoc/readers/html_reader/html_reader.py
+++ b/dedoc/readers/html_reader/html_reader.py
@@ -33,7 +33,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower() in [".html", ".shtml"] or mime in ["text/html"]
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/json_reader/json_reader.py b/dedoc/readers/json_reader/json_reader.py
index f408674f..767542cf 100644
--- a/dedoc/readers/json_reader/json_reader.py
+++ b/dedoc/readers/json_reader/json_reader.py
@@ -28,7 +28,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader (it has .json extension).
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower().endswith(".json")
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/mhtml_reader/mhtml_reader.py b/dedoc/readers/mhtml_reader/mhtml_reader.py
index ea980dec..f08e84e4 100644
--- a/dedoc/readers/mhtml_reader/mhtml_reader.py
+++ b/dedoc/readers/mhtml_reader/mhtml_reader.py
@@ -32,7 +32,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower().endswith(tuple(self.mhtml_extensions))
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/note_reader/note_reader.py b/dedoc/readers/note_reader/note_reader.py
index 836a98bb..e1e15b90 100644
--- a/dedoc/readers/note_reader/note_reader.py
+++ b/dedoc/readers/note_reader/note_reader.py
@@ -22,7 +22,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower().endswith(".note.pickle")
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/pdf_reader/pdf_auto_reader/pdf_auto_reader.py b/dedoc/readers/pdf_reader/pdf_auto_reader/pdf_auto_reader.py
index e2c3ad37..c47e7e7d 100644
--- a/dedoc/readers/pdf_reader/pdf_auto_reader/pdf_auto_reader.py
+++ b/dedoc/readers/pdf_reader/pdf_auto_reader/pdf_auto_reader.py
@@ -47,7 +47,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
It is recommended to use `pdf_with_text_layer=auto_tabby` because it's faster and allows to get better results.
You can look to :ref:`pdf_handling_parameters` to get more information about `parameters` dictionary possible arguments.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
if not (mime in recognized_mimes.pdf_like_format or extension.lower() == ".pdf"):
return False
diff --git a/dedoc/readers/pdf_reader/pdf_base_reader.py b/dedoc/readers/pdf_reader/pdf_base_reader.py
index 41e9a310..8372fb92 100644
--- a/dedoc/readers/pdf_reader/pdf_base_reader.py
+++ b/dedoc/readers/pdf_reader/pdf_base_reader.py
@@ -131,7 +131,7 @@ def _parse_document(self, path: str, parameters: ParametersForParseDoc) -> (
prev_line = None
for line in all_lines_with_links:
- line.metadata.tag_hierarchy_level = DefaultStructureExtractor.get_list_hl_with_regexp(line, prev_line)
+ line.metadata.tag_hierarchy_level = DefaultStructureExtractor.get_hl_list_using_regexp(line, prev_line)
prev_line = line
all_lines_with_paragraphs = self.paragraph_extractor.extract(all_lines_with_links)
diff --git a/dedoc/readers/pdf_reader/pdf_image_reader/pdf_image_reader.py b/dedoc/readers/pdf_reader/pdf_image_reader/pdf_image_reader.py
index fd2cf6ff..53edd2e1 100644
--- a/dedoc/readers/pdf_reader/pdf_image_reader/pdf_image_reader.py
+++ b/dedoc/readers/pdf_reader/pdf_image_reader/pdf_image_reader.py
@@ -55,7 +55,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
You can also see :ref:`pdf_handling_parameters` to get more information about `parameters` dictionary possible arguments.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return mime in recognized_mimes.pdf_like_format or mime in recognized_mimes.image_like_format or \
file_path.lower().endswith(tuple(recognized_extensions.image_like_format)) or extension.lower().replace(".", "") in supported_image_types
diff --git a/dedoc/readers/pdf_reader/pdf_txtlayer_reader/pdf_tabby_reader.py b/dedoc/readers/pdf_reader/pdf_txtlayer_reader/pdf_tabby_reader.py
index 42a2b478..00e5e552 100644
--- a/dedoc/readers/pdf_reader/pdf_txtlayer_reader/pdf_tabby_reader.py
+++ b/dedoc/readers/pdf_reader/pdf_txtlayer_reader/pdf_tabby_reader.py
@@ -66,8 +66,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- parameters = {} if parameters is None else parameters
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return (mime in recognized_mimes.pdf_like_format or extension.lower().endswith("pdf")) and get_param_pdf_with_txt_layer(parameters) == "tabby"
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
@@ -265,7 +264,7 @@ def __get_tag(self, line: LineWithMeta, prev_line: Optional[LineWithMeta], line_
return HierarchyLevel(1, header_level, False, line_type)
if line_type == "litem": # TODO automatic list depth and merge list items from multiple lines
- return DefaultStructureExtractor.get_list_hl_with_regexp(line, prev_line)
+ return DefaultStructureExtractor.get_hl_list_using_regexp(line, prev_line)
return HierarchyLevel(None, None, True, line_type)
diff --git a/dedoc/readers/pdf_reader/pdf_txtlayer_reader/pdf_txtlayer_reader.py b/dedoc/readers/pdf_reader/pdf_txtlayer_reader/pdf_txtlayer_reader.py
index 86277bf0..97e55a03 100644
--- a/dedoc/readers/pdf_reader/pdf_txtlayer_reader/pdf_txtlayer_reader.py
+++ b/dedoc/readers/pdf_reader/pdf_txtlayer_reader/pdf_txtlayer_reader.py
@@ -34,8 +34,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- parameters = {} if parameters is None else parameters
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return (mime in recognized_mimes.pdf_like_format or extension.lower().endswith("pdf")) and get_param_pdf_with_txt_layer(parameters) == "true"
def _process_one_page(self,
diff --git a/dedoc/readers/pptx_reader/pptx_reader.py b/dedoc/readers/pptx_reader/pptx_reader.py
index a3040b62..6dc77551 100644
--- a/dedoc/readers/pptx_reader/pptx_reader.py
+++ b/dedoc/readers/pptx_reader/pptx_reader.py
@@ -34,7 +34,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower() in recognized_extensions.pptx_like_format or mime in recognized_mimes.pptx_like_format
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/dedoc/readers/reader_composition.py b/dedoc/readers/reader_composition.py
index 9cf0aec3..2bac6917 100644
--- a/dedoc/readers/reader_composition.py
+++ b/dedoc/readers/reader_composition.py
@@ -30,7 +30,7 @@ def read(self, file_path: str, parameters: Optional[dict] = None) -> Unstructure
:return: intermediate representation of the document with lines, tables and attachments
"""
file_name = os.path.basename(file_path)
- extension, mime = get_mime_extension(file_path=file_path)
+ mime, extension = get_mime_extension(file_path=file_path)
for reader in self.readers:
if reader.can_read(file_path=file_path, mime=mime, extension=extension, parameters=parameters):
diff --git a/dedoc/readers/txt_reader/raw_text_reader.py b/dedoc/readers/txt_reader/raw_text_reader.py
index 33ffe656..58bb1164 100644
--- a/dedoc/readers/txt_reader/raw_text_reader.py
+++ b/dedoc/readers/txt_reader/raw_text_reader.py
@@ -30,7 +30,7 @@ def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None,
Check if the document extension is suitable for this reader.
Look to the documentation of :meth:`~dedoc.readers.BaseReader.can_read` to get information about the method's parameters.
"""
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension.lower().endswith((".txt", "txt.gz"))
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
@@ -70,7 +70,7 @@ def _get_lines_with_meta(self, path: str, encoding: str) -> List[LineWithMeta]:
indent_annotation = self.__get_indent_annotation(line)
line_with_meta = LineWithMeta(line=line, metadata=metadata, annotations=[spacing_annotation, indent_annotation], uid=uid)
- line_with_meta.metadata.tag_hierarchy_level = DefaultStructureExtractor.get_list_hl_with_regexp(line_with_meta, prev_line)
+ line_with_meta.metadata.tag_hierarchy_level = DefaultStructureExtractor.get_hl_list_using_regexp(line_with_meta, prev_line)
prev_line = line_with_meta
lines.append(line_with_meta)
diff --git a/dedoc/structure_extractors/__init__.py b/dedoc/structure_extractors/__init__.py
index 2e3e9132..404d915c 100644
--- a/dedoc/structure_extractors/__init__.py
+++ b/dedoc/structure_extractors/__init__.py
@@ -1,12 +1,14 @@
from .abstract_structure_extractor import AbstractStructureExtractor
+from .concrete_structure_extractors.default_structure_extractor import DefaultStructureExtractor
from .concrete_structure_extractors.abstract_law_structure_extractor import AbstractLawStructureExtractor
+from .concrete_structure_extractors.article_structure_extractor import ArticleStructureExtractor
from .concrete_structure_extractors.classifying_law_structure_extractor import ClassifyingLawStructureExtractor
-from .concrete_structure_extractors.default_structure_extractor import DefaultStructureExtractor
from .concrete_structure_extractors.diploma_structure_extractor import DiplomaStructureExtractor
from .concrete_structure_extractors.foiv_law_structure_extractor import FoivLawStructureExtractor
from .concrete_structure_extractors.law_structure_excractor import LawStructureExtractor
from .concrete_structure_extractors.tz_structure_extractor import TzStructureExtractor
from .structure_extractor_composition import StructureExtractorComposition
-__all__ = ['AbstractStructureExtractor', 'AbstractLawStructureExtractor', 'ClassifyingLawStructureExtractor', 'DefaultStructureExtractor',
- 'DiplomaStructureExtractor', 'FoivLawStructureExtractor', 'LawStructureExtractor', 'TzStructureExtractor', 'StructureExtractorComposition']
+__all__ = ['AbstractStructureExtractor', 'AbstractLawStructureExtractor', 'ArticleStructureExtractor', 'ClassifyingLawStructureExtractor',
+ 'DefaultStructureExtractor', 'DiplomaStructureExtractor', 'FoivLawStructureExtractor', 'LawStructureExtractor', 'TzStructureExtractor',
+ 'StructureExtractorComposition']
diff --git a/dedoc/structure_extractors/concrete_structure_extractors/article_structure_extractor.py b/dedoc/structure_extractors/concrete_structure_extractors/article_structure_extractor.py
new file mode 100644
index 00000000..4ef6d4e8
--- /dev/null
+++ b/dedoc/structure_extractors/concrete_structure_extractors/article_structure_extractor.py
@@ -0,0 +1,35 @@
+from typing import List, Optional
+
+from dedoc.data_structures import HierarchyLevel, UnstructuredDocument
+from dedoc.data_structures.line_with_meta import LineWithMeta
+from dedoc.structure_extractors import AbstractStructureExtractor
+
+
+class ArticleStructureExtractor(AbstractStructureExtractor):
+ """
+ This class corresponds to the `GROBID `_ article structure extraction.
+
+ This class saves all tag_hierarchy_levels received from the :class:`~dedoc.readers.ArticleReader` \
+ without using the postprocessing step (without using regular expressions).
+
+ You can find the description of this type of structure in the section :ref:`article_structure`.
+ """
+ document_type = "article"
+
+ def extract(self, document: UnstructuredDocument, parameters: Optional[dict] = None) -> UnstructuredDocument:
+ """
+ Extract article structure from the given document and add additional information to the lines' metadata.
+ To get the information about the method's parameters look at the documentation of the class \
+ :class:`~dedoc.structure_extractors.AbstractStructureExtractor`.
+ """
+ for line in document.lines:
+ if line.metadata.tag_hierarchy_level is None:
+ line.metadata.tag_hierarchy_level = HierarchyLevel.create_raw_text()
+ else:
+ line.metadata.hierarchy_level = line.metadata.tag_hierarchy_level
+ assert line.metadata.hierarchy_level is not None
+
+ return document
+
+ def _postprocess(self, lines: List[LineWithMeta], paragraph_type: List[str], regexps: List, excluding_regexps: List) -> List[LineWithMeta]:
+ return lines
diff --git a/dedoc/structure_extractors/concrete_structure_extractors/default_structure_extractor.py b/dedoc/structure_extractors/concrete_structure_extractors/default_structure_extractor.py
index 9ce18e0e..da6e40cf 100644
--- a/dedoc/structure_extractors/concrete_structure_extractors/default_structure_extractor.py
+++ b/dedoc/structure_extractors/concrete_structure_extractors/default_structure_extractor.py
@@ -35,7 +35,7 @@ def extract(self, document: UnstructuredDocument, parameters: Optional[dict] = N
line.metadata.tag_hierarchy_level = HierarchyLevel.create_unknown()
if line.metadata.tag_hierarchy_level.line_type == HierarchyLevel.unknown:
- line.metadata.hierarchy_level = self.get_list_hl_with_regexp(line, previous_line)
+ line.metadata.hierarchy_level = self.get_hl_list_using_regexp(line, previous_line)
else:
line.metadata.hierarchy_level = self.__get_hl_with_tag(line)
@@ -61,7 +61,7 @@ def __get_hl_with_tag(self, line: LineWithMeta) -> HierarchyLevel:
return line.metadata.tag_hierarchy_level
@staticmethod
- def get_list_hl_with_regexp(line: LineWithMeta, previous_line: Optional[LineWithMeta]) -> HierarchyLevel:
+ def get_hl_list_using_regexp(line: LineWithMeta, previous_line: Optional[LineWithMeta]) -> HierarchyLevel:
prefix = get_prefix(DefaultStructureExtractor.prefix_list, line)
# TODO dotted list without space after numbering, like "1.Some text"
diff --git a/dedoc/structure_extractors/hierarchy_level_builders/diploma_builder/body_builder.py b/dedoc/structure_extractors/hierarchy_level_builders/diploma_builder/body_builder.py
index 85f3006d..7f26fad1 100644
--- a/dedoc/structure_extractors/hierarchy_level_builders/diploma_builder/body_builder.py
+++ b/dedoc/structure_extractors/hierarchy_level_builders/diploma_builder/body_builder.py
@@ -44,7 +44,7 @@ def get_lines_with_hierarchy(self, lines_with_labels: List[Tuple[LineWithMeta, s
elif prediction == "raw_text":
line = self.__postprocess_raw_text(line, init_hl_depth)
if not (line.metadata.hierarchy_level is not None and line.metadata.hierarchy_level.line_type == "named_item"):
- line.metadata.hierarchy_level = DefaultStructureExtractor.get_list_hl_with_regexp(line, previous_raw_text_line)
+ line.metadata.hierarchy_level = DefaultStructureExtractor.get_hl_list_using_regexp(line, previous_raw_text_line)
previous_raw_text_line = line
else:
line.metadata.hierarchy_level = HierarchyLevel.create_raw_text()
diff --git a/dedoc/utils/parameter_utils.py b/dedoc/utils/parameter_utils.py
index da72704a..ece1cf56 100644
--- a/dedoc/utils/parameter_utils.py
+++ b/dedoc/utils/parameter_utils.py
@@ -19,6 +19,13 @@ def get_param_language(parameters: Optional[dict]) -> str:
return language
+def get_param_document_type(parameters: Optional[dict]) -> str:
+ if parameters is None:
+ return "other"
+ document_type = str(parameters.get("document_type", "other")).lower()
+ return document_type
+
+
def get_param_orient_analysis_cells(parameters: Optional[dict]) -> bool:
if parameters is None:
return False
diff --git a/docker-compose.yml b/docker-compose.yml
index 904c36d8..85378db9 100644
--- a/docker-compose.yml
+++ b/docker-compose.yml
@@ -12,10 +12,13 @@ services:
- 1231:1231
environment:
DOCREADER_PORT: 1231
+ GROBID_HOST: "grobid"
+ GROBID_PORT: 8070
test:
depends_on:
+ - grobid
- dedoc
build:
context: .
@@ -24,7 +27,14 @@ services:
environment:
DOC_READER_HOST: "dedoc"
DOCREADER_PORT: 1231
+ GROBID_HOST: "grobid"
+ GROBID_PORT: 8070
is_test: $test
PYTHONPATH: $PYTHONPATH:/dedoc_root/tests:/dedoc_root
command:
bash dedoc_root/tests/run_tests_in_docker.sh
+
+ grobid:
+ image: "lfoppiano/grobid:0.8.0"
+ ports:
+ - 8070:8070
diff --git a/docs/source/_static/code_examples/djvu_converter.py b/docs/source/_static/code_examples/djvu_converter.py
index 192f889f..79415696 100644
--- a/docs/source/_static/code_examples/djvu_converter.py
+++ b/docs/source/_static/code_examples/djvu_converter.py
@@ -15,7 +15,7 @@ def can_convert(self,
extension: Optional[str] = None,
mime: Optional[str] = None,
parameters: Optional[dict] = None) -> bool:
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ _, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension == ".djvu"
def convert(self, file_path: str, parameters: Optional[dict] = None) -> str:
diff --git a/docs/source/_static/code_examples/pdf_attachment_extractor.py b/docs/source/_static/code_examples/pdf_attachment_extractor.py
index e28a7a2e..57d1739e 100644
--- a/docs/source/_static/code_examples/pdf_attachment_extractor.py
+++ b/docs/source/_static/code_examples/pdf_attachment_extractor.py
@@ -15,7 +15,7 @@ def can_extract(self,
extension: Optional[str] = None,
mime: Optional[str] = None,
parameters: Optional[dict] = None) -> bool:
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension in recognized_extensions.pdf_like_format or mime in recognized_mimes.pdf_like_format
def extract(self, file_path: str, parameters: Optional[dict] = None) -> List[AttachedFile]:
diff --git a/docs/source/_static/code_examples/pdf_reader.py b/docs/source/_static/code_examples/pdf_reader.py
index b588ae65..e6b01ef1 100644
--- a/docs/source/_static/code_examples/pdf_reader.py
+++ b/docs/source/_static/code_examples/pdf_reader.py
@@ -21,7 +21,7 @@ def __init__(self, config: Optional[dict] = None) -> None:
self.attachment_extractor = PdfAttachmentsExtractor(config=self.config)
def can_read(self, file_path: Optional[str] = None, mime: Optional[str] = None, extension: Optional[str] = None, parameters: Optional[dict] = None) -> bool:
- extension, mime = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
+ mime, extension = get_mime_extension(file_path=file_path, mime=mime, extension=extension)
return extension in recognized_extensions.pdf_like_format or mime in recognized_mimes.pdf_like_format
def read(self, file_path: str, parameters: Optional[dict] = None) -> UnstructuredDocument:
diff --git a/docs/source/_static/json_format_examples/article_example.json b/docs/source/_static/json_format_examples/article_example.json
new file mode 100644
index 00000000..712c5841
--- /dev/null
+++ b/docs/source/_static/json_format_examples/article_example.json
@@ -0,0 +1,8632 @@
+{
+ "content": {
+ "structure": {
+ "node_id": "0",
+ "text": "Masking and Leakage-Resilient Primitives: One, the Other(s) or Both?",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "root",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.0",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.0.0",
+ "text": "Sonia",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_first_name",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.0.1",
+ "text": "Belaïd",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_surname",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.0.2",
+ "text": "aff0",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_affiliation",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.0.2.0",
+ "text": "École Normale Supérieure",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "org_name",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.0.2.1",
+ "text": "\n45 rue dUlm\n75005\nParis\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "address",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.0.3",
+ "text": "aff1",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_affiliation",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.0.3.0",
+ "text": "Thales Communications & Security",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "org_name",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.0.3.1",
+ "text": "\n4 Avenue des Louvresses\n92230\nGennevilliers\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "address",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ }
+ ]
+ },
+ {
+ "node_id": "0.1",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.1.0",
+ "text": "Vincent",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_first_name",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.1.1",
+ "text": "Grosso",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_surname",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.1.2",
+ "text": "aff2",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_affiliation",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.1.2.0",
+ "text": "ICTEAM/ELEN/Crypto Group",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "org_name",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.1.2.1",
+ "text": "\nBelgium\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "address",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ }
+ ]
+ },
+ {
+ "node_id": "0.2",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.2.0",
+ "text": "François",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_first_name",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.2.1",
+ "text": "Xavier-Standaert",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_surname",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.2.2",
+ "text": "aff2",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author_affiliation",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.2.2.0",
+ "text": "ICTEAM/ELEN/Crypto Group",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "org_name",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.2.2.1",
+ "text": "\nBelgium\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "address",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ }
+ ]
+ },
+ {
+ "node_id": "0.3",
+ "text": "Abstract",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "abstract",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.3.0",
+ "text": "Securing cryptographic implementations against side-channel attacks is one of the most important challenges in modern cryptography. Many countermeasures have been introduced for this purpose, and analyzed in specialized security models. Formal solutions have also been proposed to extend the guarantees of provable security to physically observable devices. Masking and leakage-resilient cryptography are probably the most investigated and best understood representatives of these two approaches. Unfortunately, claims whether one, the other or their combination provides better security at lower cost remained vague so far. In this paper, we provide the first comprehensive treatment of this important problem. For this purpose, we analyze whether cryptographic implementations can be security-bounded, in the sense that the time complexity of the best side-channel attack is lower-bounded, independent of the number of measurements performed. Doing so, we first put forward a significant difference between stateful primitives such as leakage-resilient PRGs (that easily ensure bounded security), and stateless ones such as leakage-resilient PRFs (that hardly do). We then show that in practice, leakage-resilience alone provides the best security vs. performance tradeoff when bounded security is achievable, while masking alone is the solution of choice otherwise. That is, we highlight that one (x)or the other approach should be privileged, which contradicts the usual intuition that physical security is best obtained by combining countermeasures.",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.4",
+ "text": "Introduction",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.4.0",
+ "text": "Masking is a frequently considered solution to improve security against sidechannel attacks [5,19]. A large number of papers investigated its application to smart card implementations of the AES (e.g. [17,37,53,55]). It essentially randomizes all the sensitive variables in a cryptographic device, by splitting them into d shares, and performs all computations on these shares afterwards. The resulting process is expected to improve physical security since if the masking scheme is carefully implemented (i.e. if the leakages of all the shares are independent), higher-order moments of the leakage distribution have to be estimated to reveal key-dependent information. It has been shown that the number of measurements needed to perform a successful DPA (Differential Power Analysis) increases exponentially with the number of shares (see, e.g. [44,59]).One limitation of masking is that (as most countermeasures against sidechannel attacks [30]) it \"only\" reduces the amount of information leakage, at the cost of sometimes strong performance overheads [20]. Another line of work, next denoted as leakage-resilient cryptography, followed a complementary approach and tried to make the exploitation of this information more difficult (e.g. computationally). For this purpose, the main assumption is that the information leakage per iteration is limited in some sense. When applied in the context of symmetric cryptography, most instances of leakage-resilient constructions rely on re-keying strategies for this purpose, as first suggested by Kocher [27]. Examples of primitives include Pseudo-Random Generators (PRGs) [12,15,41,57,58,64,65] and Pseudo-Random Functions (PRFs) [1,10,15,34,58,64].The topic of leakage resilience has given rise to quite animated debates in the cryptographic community. Several assumptions have been proposed, and the quest for models that adequately capture physical reality is still ongoing (see [57] for a recent discussion). Yet, and independent of the relevance of the proofs obtained within these models, a more pragmatic problem is to find out the security levels of leakage-resilient constructions in front of standard side-channel adversaries (i.e. the same as the ones considered in security evaluations for masking). That is, are these primitives useful to help cryptographic designers to pass current certification procedures (e.g. EMVco [14] or Common Criteria [7])?Unfortunately, claims in one or the other direction remained vague so far. The main reason is that, as hinted by Bernstein in a CHES 2012 rump session talk, substantiated answers require to consider both security and performances [3], i.e. two qualities that are generally hard to quantify. In this paper, we aim to contribute to this issue and provide tools allowing to determine the best way to reach a given security level in different (software and hardware) scenarios, within the limits of what empirical evaluations can provide. For this purpose, we will consider the AES-based PRG and PRF illustrated in Figures 1 and2, respectively. For every key k i , the PRG produces a key k i+1 and N -1 strings y i 1 , y i 2 , . . . , y i N -1 , both obtained by encrypting N public plaintexts p i j with k i . As for the PRF, we use the tree-based construction from Goldreich, Goldwasser and Micali [18], where each step incorporates log 2 [N ] input bits and generates k i+1 = AES ki (p i j ). Following [34], the last stage is optionally completed by a whitening step, in order to limit the data complexity of attacks targeting the PRF output to one (e.g. when using large N values, typically). Quite naturally, there is a simple security versus efficiency tradeoff for both types of constructions. In the first (PRG) case, we produce a 128-bit output stream every N N -1 AES encryptions. In the second (PRF) case, we produce a 128-bit output every 128 log(N ) AES encryptions (+1 if output whitening is used). The details of these primitives are not necessary for the understanding of this work. The only important feature in our discussions is that the PRG construction is stateful while the PRF one is stateless. As a result, the PRG limits the number of measurements that a side-channel adversary can perform with the same key, while the PRF limits his data complexity (i.e. the number of plaintexts that can be observed). In practice, it means that in this latter case, the same measurement can be repeated multiple times, e.g. in order to get rid of the physical noise through averaging. As already discussed by Medwed et al. in [34], Section 3, this may lead to significant difference in terms of security against DPA.In order to compare and combine these two primitives with masking, we investigate whether they can lead to security-bounded implementations, i.e. implementations such that the time complexity of the best side-channel attack remains bounded independent of the number of measurements performed by the adversary. Doing so, we first show that the stateful leakage-resilient PRG in Figure 1 naturally leads to such implementations. By contrast, this guarantee is harder to reach with (stateless) leakage-resilient PRFs such as in Figure 2. The tweaked construction proposed in [34] (that takes advantage of hardware parallelism) is in fact the only security-bounded PRF we found in our experiments. Next, we put forward that better security at lower cost is obtained by using the leakage-resilient PRG alone (i.e. without masking), while masking alone is the most efficient solution for improving the security of stateless primitives whenever the implementations cannot be security-bounded. Therefore, our results underline that both masking and leakage-resilient primitives can be useful ingredients in the design of physically secure designs. But they also lead to the counterintuitive observation that sometimes (in fact, frequently), these solutions are better used separately, hence contradicting the usual intuition that security against side-channel attacks is best obtained via a combination of countermeasures.Admittedly, these results are only obtained for a set of side-channel attacks that are representative of the state-of-the-art. Hence, positive observations such as made for the tweaked construction in [34] are not proven: they only indicate that the cryptanalysis of such schemes may be hard with current knowledge. In the same lines, the differences between leakage-resilient PRGs and PRFs do not contradict their proofs: they only indicate that the (crucial) assumption of bounded leakage can imply different challenges for hardware designers. Hence, instantiating these primitives with the same AES implementation can lead to different security levels (even if the same N value is used in both cases).",
+ "annotations": [
+ {
+ "start": 92,
+ "end": 95,
+ "name": "bibliography_ref",
+ "value": "bac4e44c-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 95,
+ "end": 98,
+ "name": "bibliography_ref",
+ "value": "bac4e4bb-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 201,
+ "end": 205,
+ "name": "bibliography_ref",
+ "value": "bac4e4ab-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 205,
+ "end": 208,
+ "name": "bibliography_ref",
+ "value": "bac4e551-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 208,
+ "end": 211,
+ "name": "bibliography_ref",
+ "value": "bac4e5cd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 211,
+ "end": 214,
+ "name": "bibliography_ref",
+ "value": "bac4e5dd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 846,
+ "end": 850,
+ "name": "bibliography_ref",
+ "value": "bac4e584-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 850,
+ "end": 853,
+ "name": "bibliography_ref",
+ "value": "bac4e602-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 942,
+ "end": 946,
+ "name": "bibliography_ref",
+ "value": "bac4e516-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1055,
+ "end": 1059,
+ "name": "bibliography_ref",
+ "value": "bac4e4c5-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1550,
+ "end": 1554,
+ "name": "bibliography_ref",
+ "value": "bac4e501-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1619,
+ "end": 1623,
+ "name": "bibliography_ref",
+ "value": "bac4e480-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1623,
+ "end": 1626,
+ "name": "bibliography_ref",
+ "value": "bac4e49b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1683,
+ "end": 1686,
+ "name": "bibliography_ref",
+ "value": "bac4e49b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1626,
+ "end": 1629,
+ "name": "bibliography_ref",
+ "value": "bac4e571-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1629,
+ "end": 1632,
+ "name": "bibliography_ref",
+ "value": "bac4e5ec-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1929,
+ "end": 1933,
+ "name": "bibliography_ref",
+ "value": "bac4e5ec-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1632,
+ "end": 1635,
+ "name": "bibliography_ref",
+ "value": "bac4e5f6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1689,
+ "end": 1692,
+ "name": "bibliography_ref",
+ "value": "bac4e5f6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1635,
+ "end": 1638,
+ "name": "bibliography_ref",
+ "value": "bac4e634-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1692,
+ "end": 1695,
+ "name": "bibliography_ref",
+ "value": "bac4e634-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1638,
+ "end": 1641,
+ "name": "bibliography_ref",
+ "value": "bac4e63d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1677,
+ "end": 1680,
+ "name": "bibliography_ref",
+ "value": "bac4e42a-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1680,
+ "end": 1683,
+ "name": "bibliography_ref",
+ "value": "bac4e46d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1686,
+ "end": 1689,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3412,
+ "end": 3416,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 4544,
+ "end": 4548,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 5206,
+ "end": 5210,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 6249,
+ "end": 6253,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2381,
+ "end": 2385,
+ "name": "bibliography_ref",
+ "value": "bac4e499-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2405,
+ "end": 2408,
+ "name": "bibliography_ref",
+ "value": "bac4e461-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2640,
+ "end": 2643,
+ "name": "bibliography_ref",
+ "value": "bac4e43e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3306,
+ "end": 3310,
+ "name": "bibliography_ref",
+ "value": "bac4e4b2-f290-11ee-a6ed-b88584b4e4a1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.5",
+ "text": "Methodology & limitations",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.5.0",
+ "text": "The main goal of this paper is to provide sound techniques to evaluate how leakage-resilient PRGs/PRFs and masking combine. In this section, we provide a brief description of the methodology we will use for this purpose, and underline its limitations. The two main components, namely performance and security evaluations, are detailed in Sections 3 and 4, and then combined in Section 5. Our proposal essentially holds in five steps that we detail below.1. Fix the target security level. In the following, we will take the AES Rijndael with 128-bit key as case study. Since a small security degradation due to side-channel attacks is unavoidable, we will consider 120-bit, 100-bit and 80-bit target security levels for illustration. We do not go below 80-bit keys since it typically corresponds to current short-term security levels [9].2. Choose an implementation. Given a cryptographic algorithm, this essentially corresponds to the selection of a technology and possibly a set of countermeasures to incorporate in the designs to evaluate. In the following, we will consider both software and hardware implementations for illustration, since they lead to significantly different performance and security levels. As for countermeasures, different types of masking schemes will be considered.3. Evaluate performances / extract a cost function. Given an implementation, different metrics can be selected for this purpose (such as code size, RAM, or cycle count in software and area, frequency, throughput or power consumption in hardware). Both for software and hardware implementations, we will use combined functions, namely the \"code size × cycle count\" product and the \"area / throughput\" ratio. While our methodology would be perfectly applicable to other choices of metrics, we believe they are an interesting starting point to capture the efficiency of our different implementations. In particular for the hardware cases, such metrics are less dependent on the serial vs. parallel nature of the target architectures (see [26], Section 2).4. Evaluate security / extract the maximum number of measurements. This central part of our analysis first requires to select the attacks from which we will evaluate security. In the following, we will consider the \"standard DPA attacks\" described in [31] for this purpose. Furthermore, we will investigate them in the profiled setting of template attacks (i.e. assuming that the adversary can build a precise model for the leakage function) [6]. This choice is motivated by the goal of approaching worst-case evaluations [56]. Based on these attacks, we will estimate the security graphs introduced in [61], i.e. compute the adversaries' success rates in function of their time complexity and number of measurements. From a given security level (e.g. 120-bit time complexity), we will finally extract the maximum number of measurements per key tolerated, as can be bounded by the PRG construction1 .",
+ "annotations": [
+ {
+ "start": 833,
+ "end": 836,
+ "name": "bibliography_ref",
+ "value": "bac4e46b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2027,
+ "end": 2031,
+ "name": "bibliography_ref",
+ "value": "bac4e4f7-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2295,
+ "end": 2299,
+ "name": "bibliography_ref",
+ "value": "bac4e51d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2486,
+ "end": 2489,
+ "name": "bibliography_ref",
+ "value": "bac4e456-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2566,
+ "end": 2570,
+ "name": "bibliography_ref",
+ "value": "bac4e5e6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2647,
+ "end": 2651,
+ "name": "bibliography_ref",
+ "value": "bac4e61b-f290-11ee-a6ed-b88584b4e4a1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.6",
+ "text": "5.",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.6.0",
+ "text": "Compute a global cost metric (possibly with an application constraint). In case of security-bounded implementations, the previous security evaluation can be used to estimate how frequently one has to \"re-key\" within a leakageresilient construction. From this estimate, we derive the average number of AES encryptions to execute per 128-bit output. By multiplying this number with the cost function of our performance evaluations, we obtain a global metric for the implementation of an AES-based design ensuring a given security level. In case of security-unbounded implementations, re-keying is not sufficient to maintain the target security level independent of the number of measurements performed by the adversary. So the cost functions have to be combined with an application constraint, stating the maximum number of measurements that can be tolerated to maintain this security level.Quite naturally, such a methodology is limited in the same way as any performance and security evaluation. From the performance point-of-view, our investigations only apply to a representative subset of the (large) set of AES designs published in the literature. Because of place constraints, we first paid attention to state-of-the-art implementations and countermeasures, but applying our methodology to more examples is naturally feasible (and desirable). A very similar statement holds for security evaluations. Namely, we considered standard DPA attacks as a starting point, and because they typically correspond to the state-of-the-art in research and evaluation laboratories. Yet, cryptanalytic progresses can always appear2 . Besides, countermeasures such as masking may rely on physical assumptions that are difficult to compare rigorously (since highly technology-dependent), as will be detailed next with the case of \"glitches\".Note that these limitations are to a large extent inherent to the problem we tackle, and our results also correspond to the best we can hope in this respect. Hence, more than the practical conclusions that we draw in the following sections (that are of course important for current engineers willing to implement physically secure designs), it is the fact that we are able to compare the performance vs. security tradeoffs corresponding to the combination of leakage-resilient constructions with masking that is the most important contribution of this work. Indeed, these comparisons are dependent on the state-of-the-art implementations and attacks that are considered to be relevant for the selected algorithm.",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.7",
+ "text": "Performance evaluations",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.7.0",
+ "text": "In this section, we provide our performance evaluations for unprotected and masked AES designs. As previously mentioned, we will consider both software and hardware examples for this purpose. In this context, the main challenge is to find implementations that are (reasonably) comparable. This turned out to be relatively easy in the software case, for which we selected a couple of implementations in 8-bit microcontrollers, i.e. typical targets for side-channel analysis. By contrast, finding implementations in the same technology turns out to be more challenging in hardware: transistor sizes have evolved from (more than) 130µm to (less than) 65ηm over the last 15 years (i.e. the period over which most countermeasures against side-channel attacks have been proposed). Hence, published performance evaluations for side-channel protected designs are rarely comparable. Yet, we could find several designs in a recent FPGA technology, namely the Xilinx Virtex-5 devices (that are based on a 65ηm process).The performances of the implementations we will analyze are summarized in Table 1. As previously mentioned, our software cost function is the frequently considered \"code size × cycle count\" metric, while we use the \"area / throughput\" ratio in the hardware (FPGA) case. As for the countermeasures evaluated, we first focused on the higher-order masking scheme proposed by Rivain and Prouff at CHES 2010, which can be considered as the state-of-the-art in software [53]. We then added the CHES 2011 polynomial masking scheme of Prouff and Roche [45] (and its implementation in [20]), as a typical example of \"glitchresistant\" solution relying on secret sharing and multiparty computation (see the discussion in the next paragraph). A similar variety of countermeasures is proposed in hardware, where we also consider an efficient but glitch-sensitive implementation proposed in [48], and a threshold AES implementation that is one of the most promising solutions to deal with glitches in this case [36]. Note that this latter implementation is based on an 8-bit architecture (rather than a 128-bit one for the others). So although our cost function is aimed at making comparisons between different architectures more reflective of the algorithms' and countermeasures' performances, more serial implementations as this one generally pay a small overhead due to their more complex control logic.Physical assumptions and glitches. As explicit in Table 1, countermeasures against side-channel attacks always rely on a number of physical assumptions.In the case of masking, a central one is that the leakage of the shares manipulated by the target implementation should be independent of each other [22]. Glitches, that are transient signals appearing during the computations in certain (e.g. CMOS) implementations, are a typical physical default that can cause this assumption to fail, as first put forward by Mangard et al. in [32]. There are two possible solutions to deal with such physical defaults: either by making explicit to cryptographic engineers that they have to prevent glitches at the physical level, or by designing countermeasures that can cope with glitches.Interestingly, the first solution is one aspect where hardware and software implementations significantly differ. Namely, while it is usually possible to ensure independent leakages in masked software, by ensuring a sufficient time separation between the manipulation of the shares, it is extremely difficult to avoid glitches in hardware [33]. Yet, even in hardware it is generally expected that the \"glitch signal\" will be more difficult to exploit by adversaries, especially if designers pay attention to this issue [35]. In this context, the main question is to determine the amplitude of this signal: if sufficiently reduced in front of the measurement noise, it may turn out that a glitch-sensitive masked implementation leads to improved security levels (compared to an unprotected one). Since this amplitude is highly technology-dependent, we will use it as a parameter to analyze the security of our hardware implementations in the next sections. Yet, we recall that it is a safe practice to focus on glitch-resistant implementations when it comes to hardware. Besides, we note that glitches are not the only physical default that may cause the independent leakage assumption to be contradicted in practice [42,51].",
+ "annotations": [
+ {
+ "start": 1088,
+ "end": 1089,
+ "name": "table",
+ "value": "d2ce350a-25be-4d05-9061-6f1d4cf8bdd1"
+ },
+ {
+ "start": 2456,
+ "end": 2457,
+ "name": "table",
+ "value": "d2ce350a-25be-4d05-9061-6f1d4cf8bdd1"
+ },
+ {
+ "start": 1472,
+ "end": 1476,
+ "name": "bibliography_ref",
+ "value": "bac4e5cd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1552,
+ "end": 1556,
+ "name": "bibliography_ref",
+ "value": "bac4e58b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1584,
+ "end": 1588,
+ "name": "bibliography_ref",
+ "value": "bac4e4c5-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1885,
+ "end": 1889,
+ "name": "bibliography_ref",
+ "value": "bac4e5a0-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2005,
+ "end": 2009,
+ "name": "bibliography_ref",
+ "value": "bac4e549-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2701,
+ "end": 2705,
+ "name": "bibliography_ref",
+ "value": "bac4e4d6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2931,
+ "end": 2935,
+ "name": "bibliography_ref",
+ "value": "bac4e526-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3517,
+ "end": 3521,
+ "name": "bibliography_ref",
+ "value": "bac4e531-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3697,
+ "end": 3701,
+ "name": "bibliography_ref",
+ "value": "bac4e541-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 4394,
+ "end": 4398,
+ "name": "bibliography_ref",
+ "value": "bac4e575-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 4398,
+ "end": 4401,
+ "name": "bibliography_ref",
+ "value": "bac4e5bc-f290-11ee-a6ed-b88584b4e4a1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.8",
+ "text": "Security evaluations",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.8.0",
+ "text": "We now move to the core of our analysis, namely the security evaluation of different implementations. For this purpose, we first need to discuss the type of security evaluation we will conduct, which can be viewed as a tradeoff between generality and informativeness. That is, one ideally wants to reach general conclusions in the sense that they are independent of the underlying device technology. A typical solution for this purpose is to evaluate the \"security order\" of a countermeasure, as defined by Coron et al. [8]. Informally, the security order corresponds to the largest moment in the leakage probability distributions that is key-independent (hence from which no information can be extracted). For example, an unprotected implementation can be attacked by computing mean values (i.e. first-order moments) [28]. By contrast, the hope of masking is to ensure that adversaries will have to estimate higher-order moments, which is expected to increase the data complexity required to extract information, as first shown by Chari et al. [5]. Evaluating the order is interesting because under the independent leakage assumption mentioned in the last section, it can be done based on the mathematical description of a countermeasure only. Of course, the informativeness of such an abstract evaluation is limited since (1) it indeed does not allow testing whether the independent leakage assumption is fulfilled, and (2) even if this assumption is fulfilled, there is no strict correspondance between the security order and the security level of an implementation (e.g. measured with a probability of success corresponding to some bounded complexities). This is because already for masking (i.e. the countermeasure that aims at increasing the security order), and even if independent leakages are observed in practice, the actual complexity of a side-channel attack highly depends on the amount of noise in the measurements. And of course, there are also countermeasures that simply do not aim at increasing the security order, e.g. shuffling [21].One appealing way to mitigate the second issue is to perform so-called \"simulated attacks\". This essentially requires to model the leakage corresponding to different sensitive operations in an idealized implementation. For example, a usual approximation is to consider that all the intermediate values during a cryptographic computation (such as the S-boxes inputs and outputs for a block cipher) leak the sum of their Hamming weight and a Gaussian distributed noise [30]. It is then possible to accurately estimate the evaluation metrics proposed in [56] (i.e. mutual information, success rate, guessing entropy) from these mathematically generated leakages. Furthermore, one can use the noise variance as a security parameter and analyze its impact on the time and data complexity of successful attacks. Quite naturally, such an alternative still does not solve the first issue (i.e. the independent leakage assumption), for which the only possibility is to evaluate the real measurements of an actual implementation, in a given technology. This latter solution is admittedly the most informative, but also the least general, and is quite intensive for comparison purposes (since it requires to have access to source codes, target devices and measurement setups for all the designs to evaluate). Interestingly, it has been shown that simulated attacks can be quite close to real ones in the context of standard DPA and masking [59]. So since our goal is to show that there exist realistic scenarios where leakage-resilient PRGs/PRFs and masking are useful ingredients to reach a given security level at the lowest cost, we will use this type of evaluations in the following.Note finally that performing simulated attacks could not be replaced by computing explicit formulae for the success rate such as, e.g. [16,52]. Indeed, these formulae only predict subkey (typically key bytes) recoveries while we consider security graphs for full 128-bit master keys. Beside, they are only applicable to unprotected devices so far, and hardly capture masked implementations and the effect of key-dependent algorithmic noise as we will consider next.",
+ "annotations": [
+ {
+ "start": 520,
+ "end": 523,
+ "name": "bibliography_ref",
+ "value": "bac4e463-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 818,
+ "end": 822,
+ "name": "bibliography_ref",
+ "value": "bac4e505-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1045,
+ "end": 1048,
+ "name": "bibliography_ref",
+ "value": "bac4e44c-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2048,
+ "end": 2052,
+ "name": "bibliography_ref",
+ "value": "bac4e4cd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2520,
+ "end": 2524,
+ "name": "bibliography_ref",
+ "value": "bac4e516-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2604,
+ "end": 2608,
+ "name": "bibliography_ref",
+ "value": "bac4e5e6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3482,
+ "end": 3486,
+ "name": "bibliography_ref",
+ "value": "bac4e602-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3864,
+ "end": 3868,
+ "name": "bibliography_ref",
+ "value": "bac4e4a3-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3868,
+ "end": 3871,
+ "name": "bibliography_ref",
+ "value": "bac4e5c4-f290-11ee-a6ed-b88584b4e4a1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.9",
+ "text": "Evaluation setups",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.9.0",
+ "text": "We will consider two types of setups in our evaluations: one for software, one for hardware. As illustrated in Figure 3 in the case of a Boolean-masked S-box implementation with two shares, the main difference is that the software performs all the operations sequentially, while the hardware performs them in parallel. We will further assume that the leakage of parallel operations is summed [40]. As previously mentioned, we will illustrate our analyses with a Hamming weight leakage function. Additionally, we will consider a noise variance of 10, corresponding to a Signal-to-Noise Ratio of 0.2 (as defined in [29]) 3 . This is a typical value, both for software implementations [11] and FPGA measurement boards [25].Let us denote the AES S-box as S, a byte of plaintext and key as x i and k i (respectively), the random shares used in masking as r j i (before the S-box) and m j i (after the S-box), the Hamming weight function as HW, the bitwise XOR as ⊕, the field multiplication used in polynomial masking as ⊗, and Gaussiandistributed noise random variables N j i . From these notations, we can specify the list of all our target implementations as summarized in Table 2.A couple of observations are worth being underlined as we now discuss.First, and as already mentioned, the main difference between software and hardware implementations is the number of exploitable leakage samples: there is a single such sample per plaintext in hardware while there are 16×(N m +1) ones in software (with N m the number of masks). Next, we only considered glitches in hardware (since it is generally possible to ensure independent leakage in software, by ensuring a sufficient time separation between the manipulation of the shares). We assumed that \"first-order glitches\" can appear in our Boolean-masked FPGA implementation, and modeled the impact of the mask as an additive binomial noise in this case. We further assumed that the amplitude of this first-order signal was reduced according to a factor f . This factor corresponds to the parameter used to quantify the amplitude of the glitches mentioned in the previous section. Note that this modeling is sound because the complexity of a first-order DPA only depends on the value of its SNR (which is equivalent to correlation and information theoretic metrics in this case, as proven in [31]). So even leakage functions deviating from the Hamming weight abstraction would lead to similar trends. Since the threshold implementation in [36] guarantees the absence of firstorder glitches, we only analyzed the possibility of second-order glitches for this one, and modeled them in the same way as just described (i.e. by considering the second mask M 2 i as an additive binomial noise, and reducing the amplitude of the second-order signal by a factor f ). Third, the chosen-plaintext construction of [34] is only applicable in hardware. Furthermore, we only evaluated its impact for the unprotected implementation, and the 1-mask Boolean one with glitches. As will become clear in the next section, this is because the data complexity bound to 256 (that is the maximum tolerated by design in this case) is only relevant when successful side-channel attacks occur for such small complexities (which was only observed for implementations with first-order signal).For convenience, we denoted each implementation in our experiments with three letters. The first one corresponds to the type of scenario considered, i.e. with Known (K) or carefully Chosen (C) plaintexts. The second one indicates [20,45]2nd-order KP whether we are in a Software (S) or Hardware (H) case study. The third one corresponds to the type of countermeasure selected, i.e. Unprotected (U), 1-or 2-mask Boolean (B 1 , B 2 ), 1-mask Polynomial (P 1 ) and 2-mask threshold (T 2 ). The additional star signals finally reflect the presence of (first-order or secondorder) glitches. For example, KHB * 1 is an AES design protected with a 1-mask Boolean scheme, implemented in an imperfect hardware leading to first-order glitches, and analyzed in the context of known (uniform) plaintexts.",
+ "annotations": [
+ {
+ "start": 392,
+ "end": 396,
+ "name": "bibliography_ref",
+ "value": "bac4e568-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 613,
+ "end": 617,
+ "name": "bibliography_ref",
+ "value": "bac4e50e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 682,
+ "end": 686,
+ "name": "bibliography_ref",
+ "value": "bac4e476-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 715,
+ "end": 719,
+ "name": "bibliography_ref",
+ "value": "bac4e4ee-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2339,
+ "end": 2343,
+ "name": "bibliography_ref",
+ "value": "bac4e51d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2486,
+ "end": 2490,
+ "name": "bibliography_ref",
+ "value": "bac4e549-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2850,
+ "end": 2854,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3542,
+ "end": 3546,
+ "name": "bibliography_ref",
+ "value": "bac4e4c5-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 3546,
+ "end": 3548,
+ "name": "bibliography_ref",
+ "value": "bac4e58b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1177,
+ "end": 1178,
+ "name": "table",
+ "value": "6e093372-d147-4245-8aab-08ed5fe5c072"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.10",
+ "text": "Template attacks and security graphs",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.10.0",
+ "text": "Given the leakage functions defined in Table 2, a template attack first requires to build a leakage model. In the following, and for each byte of the AES master key, we will consider Gaussian templates for unprotected implementations, and Gaussian for masked implementations. Let us denote the probability density function of a Gaussian distribution taken on input z, with mean µ (resp. mean vector µ) and variance σ 2 (resp. covariance matrix Σ) as N (z|µ, σ 2 ) (resp. N (z|µ, Σ)). This notation directly leads to models of the form:Prfor (software and hardware) unprotected implementations and:Prfor (software and hardware) masked implementations with two shares. The formula naturally extends to more shares, by just adding more sums over the masks. Note that in these models, all the noise (including the algorithmic one in hardware implementations) is captured by the Gaussian distribution 4 . Given these models, the template adversary will accumulate information on the key bytes k i , by computing products of probabilities corresponding to multiple plaintexts. Doing so and for each key byte, he will produce lists of 256 probabilities corresponding each possible candidate ki , defined as follows:i ],with the leakage vector L (j) respectively corresponding to l (j) i (resp. l (j) ) in the context of Equ. 1 (resp. Equ. 2) and l 1,(j) i , l 2,(j) i (resp. l (j) ) in the context of Equ. 3 (resp. Equ. 4) The number of measurements is given by q in Equ. 5. Next and for each target implementation, we will repeat 100 experiments. And for each value of q in these experiments, use a rank estimation algorithm to evaluate the time complexity needed to recover the full AES master key [61]. Eventually, we will build \"security graphs\" where the attack probability of success is provided in function of a time complexity and a number of measurements.Iterative DPA against constructions with carefully chosen plaintexts. Note that while standard DPA attacks are adequate to analyze the security of unprotected and masked implementations in a known-plaintext scenario, their divide-and-conquer strategy hardly applies to the PRF in [34], with carefullychosen plaintexts leading to key-dependent algorithmic noise. This is because the (maximum 256) constants c j used in this proposal are such that all 16 bytes are always identical. Hence, a standard DPA will provide a single list of probabilities, containing information about the 16 AES key bytes at once. In this case, we additionally considered the iterative DPA described in this previous reference, which essentially works by successively removing the algorithmic noise generated by the best-rated key bytes. While such an attack can only work under the assumption that the adversary has an very precise leakage model in hand, we use it as a representative of worst-case attack against such a construction.",
+ "annotations": [
+ {
+ "start": 45,
+ "end": 46,
+ "name": "table",
+ "value": "6e093372-d147-4245-8aab-08ed5fe5c072"
+ },
+ {
+ "start": 1693,
+ "end": 1697,
+ "name": "bibliography_ref",
+ "value": "bac4e61b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2137,
+ "end": 2141,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.11",
+ "text": "Experimental results",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.11.0",
+ "text": "For illustration, the security graph of the AES implementation KHB 1 is given in Figure 4, where we additionally provide the maximum number of measurements tolerated to maintain security levels corresponding to 2 120 , 2 100 and 2 80 time complexity. All the implementations in Table 2 have been similarly evaluated and the result of these experiments are in Appendix A, Figures 8 to 13. Note that in the aforementioned case of iterative DPA (Appendix A, Figure 14), the adversary recovers the AES key bytes but still has to find their position within the AES state, which (roughly) corresponds to 16! ≈ 2 44 possibilities [2].",
+ "annotations": [
+ {
+ "start": 284,
+ "end": 285,
+ "name": "table",
+ "value": "6e093372-d147-4245-8aab-08ed5fe5c072"
+ },
+ {
+ "start": 623,
+ "end": 626,
+ "name": "bibliography_ref",
+ "value": "bac4e432-f290-11ee-a6ed-b88584b4e4a1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.12",
+ "text": "Security vs. performance tradeoffs",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.12.0",
+ "text": "We now combine the results in the previous sections to answer our main question. Namely, what is the best way to exploit masking and/or leakage-resilient primitives to resist standard DPA in hardware and software implementations?",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.13",
+ "text": "Leakage-resilient PRGs",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.13.0",
+ "text": "Let M be the maximum number of measurements tolerated to maintain a given security level for one of the implementations in section 4. The re-keying in leakage-resilient PRGs is such that it is exactly this number M that is limited by design (i.e. the value N in Figure 1 bounds M for the adversary), hence directly leading to security-bounded implementations. The global cost metric we use in this case can be written as M M -1 × cost f unction, where the first factor corresponds to the average number of AES encryptions that are used to produce each 128-bit output string, and the second one is the cost function of Table 1.A comparison of different leakage-resilient PRG implementations in software (i.e. based on different unprotected and protected AES implementations) is given in Figure 5 for 80-bit and 120-bit security levels (the results for 100-bit security are in Appendix A, Figure 15, left). The main observation in this context is that the straightforward implementation of the PRG with an unprotected AES design is the most efficient solution. This is mainly because moving from the smallest M value (i.e. M = 2, as imposed by the 120-bit security level in the unprotected case -see Figure 8-left) to large ones (e.g. M > 1000 for masked implementations) can only lead to a gain factor of 2 for the global cost metric, which is not justified in view of the performance overheads due to the masking. For a similar reason (i.e. the limited interest of increasing M ), the global cost metric is essentially independent of the target security level in the figure. In other words, there is little interest in decreasing this security level since it leads to poor performance improvements. The hardware implementations in Appendix A, Figures 15-right and 16 lead to essentially similar intuitions, as also witnessed by the limited impact of decreasing the amplitude of the glitch signal with the f factor (see the KHB * 1 and KHT * 2 implementations for which f = 10 in the latter figures).",
+ "annotations": [
+ {
+ "start": 624,
+ "end": 625,
+ "name": "table",
+ "value": "d2ce350a-25be-4d05-9061-6f1d4cf8bdd1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.14",
+ "text": "Leakage-resilient PRFs",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.14.0",
+ "text": "Security-unbounded implementations. Let us now consider (stateless) leakage-resilient PRFs. As already mentioned, those constructions only bound the adversary's data complexity. The main observation in this case is that if random plaintexts are considered, such implementations can only be security-unbounded (with the slight cautionary note that we give below). This fact can be easily explained when the PRF is instantiated with an unprotected software implementation of the AES. What happens then is that the adversary can repeat his measurements to get rid of the physical noise, and consequently move from the security graph of Appendix A, Figure 8-left to the one of Appendix A, Figure 13-right. Such a \"repeating\" attack is exactly the one already mentioned in [34] to argue that bounded data complexity is not enough to bound (computational) security. In fact, it similarly applies to masked implementations. The only difference is that the adversary will not average his measurements, but rather combine them as in Equation 5. This is because given a leakage function, e.g. the Hamming weight one that leads to 9 distinguishable events, the distribution of the measurements in a masked implementation will lead to the same number of distinguishable events: the only difference is that more sampling will be necessary to distinguish them (see the appendices in [60] for a plot of these distributions). So if the number of measurements is not bounded, attacks with low time complexities as in Appendix A, Figure 13 right will always exist.One important consequence is that using the PRF construction in this context is essentially useless for all the AES implementations we consider in this paper. The only way to maintain a target security level for such stateless primitives is to limit the number of measurements by putting a constraint on the lifetime of the system. And this lifetime will be selected according to the maximum number of measurements tolerated that can be extracted from our security graphs, which now highly depends on the countermeasure selected. In other words, we can only evaluate the cost function and the security level attained independently in this case, as illustrated in Figure 6 for our software instances (the 100-bit security level is again given in Appendix A, Figure 17-left). Here, we naturally come back to the standard result that Boolean (resp. polynomial) masking increases security at the cost of performance overheads that are roughly quadratic (resp. cubic) in the number of shares. Note that the security level of the 1-mask polynomial scheme is higher than the 2-mask Boolean one for the noise variance we consider, which is consistent with the previous work of Roche and Prouff [54]. Similar conclusions are obtained with hardware implementations (Appendix A, Figure 17-right and Appendix A, Figure 18), for which the impact of glitches is now clearly visible. For example, a factor f = 10 essentially multiplies the number of measurements by f for the Boolean masking with first-order glitches, and f 2 for the threshold implementation with second-order glitches. Cautionary note. The statement that stateless leakage-resilient PRFs can only be security unbounded if known plaintexts are considered essentially relates to the fact that repeated measurements allow removing the effect of the noise and the masks in a leaking implementation. Yet, this claim should be slightly mitigated in the case of algorithmic noise in hardware implementations. Indeed, this part of the noise can only be averaged up to the data complexity bound that is imposed by the PRF design. Taking the example of our hardware implementations where all 16 S-boxes are manipulated in parallel, the SNR corresponding to algorithmic noise can be computed as the ratio between the variance of a uniformly distributed 8-bit values's Hamming weight (i.e. 2) and the variance of 15 such values (i.e. 30). Averaging this noise over M plaintexts will lead to SNRs of 1 15/M , which is already larger than 17 if M = 256 (i.e. a noise level for which the security graph will be extremely close to the worst case one of Appendix A, Figure 13-right). So although there is a \"gray area\" where a leakage-resilient PRF implemented in hardware can be (weakly) security-bounded, these contexts are of quite limited interest because the will imply bounds on the data complexity that are below 256, i.e. they anyway lead to less efficient solutions than the tweaked construction that we investigate in the next subsection.Security-bounded implementations. As just discussed, stateless primitives hardly lead to security bounded implementations if physical and algorithmic noise can be averaged -which is straightforwardly feasible in a known plaintext scenario. The tweaked construction in [34] aims at avoiding such a weakness by preventing the averaging of the algorithmic noise, thanks to the combined effect of hardware parallelism and carefully chosen plaintexts leading to keydependencies in this noise. Since only the physical noise can be averaged in this case, the bounded data complexity that the leakage-resilient PRF guarantees consequently leads to security-bounded implementations again. This is illustrated both by the standard DPAs (such as in Appendix A, Figures 10-right and 12-left) and the iterative attacks (such as in Appendix A, Figure 13) that can be performed against this PRF 5 . As in Section 5.1, we extracted the maximum data complexity D from these graphs, and produced as global cost metric:where the first factor corresponds to the (rounded) average number of AES encryptions needed to produce a 128-bit output, and the second one is the cost function of Table 1. A comparison of our different leakage-resilient PRFs instantiated with a hardware implementation of the AES and chosen plaintexts is given in Figure 7. Here again, we observe that the most efficient solution is to consider an unprotected design. Interestingly, we also observe that for the unprotected AES, the iterative attack is the worst case for the 80-bit security level (where it forces the re-keying after 97 plaintexts vs. 256 for the standard DPA), while the standard DPA is the worst-case for the 120-bit security level (where it forces the re-keying after 10 plaintexts vs. 37 for the iterative attack). This nicely fits the intuition that iterative attacks become more powerful as the data complexity increases, i.e. when the additional time complexity corresponding to the enumeration of a permutation over 16 bytes becomes small compared to the time complexity required to recover the 16 AES key bytes (unordered). ",
+ "annotations": [
+ {
+ "start": 768,
+ "end": 772,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 4800,
+ "end": 4804,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1369,
+ "end": 1373,
+ "name": "bibliography_ref",
+ "value": "bac4e610-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 2732,
+ "end": 2736,
+ "name": "bibliography_ref",
+ "value": "bac4e5d7-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 5703,
+ "end": 5704,
+ "name": "table",
+ "value": "d2ce350a-25be-4d05-9061-6f1d4cf8bdd1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.15",
+ "text": "Conclusion",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.15.0",
+ "text": "The results in this work essentially show that masking and leakage-resilient constructions hardly combine constructively. For (stateful) PRGs, our experiments indicate that both for software and hardware implementations, a leakageresilient design instantiated with an unprotected AES is the most efficient solution to reach any given security level. For stateless PRFs, they rather show that a bounded data complexity guarantee is (mostly) ineffective in bounding the (computational) complexity of the best attacks. So implementing masking and limiting the lifetime of the cryptographic implementation is the best solution in this case. Nevertheless, the chosen-plaintext tweak proposed in [34] is an interesting exception to this conclusion, as it leads to security-bounded hardware implementations for stateless primitives that are particularly interesting from an application point-of-view, e.g. for re-synchronization, challenge-response protocols, . . . Beyond the further analysis of such constructions, their extension to software implementations is an interesting scope for further research. In this respect, the combination of a chosen-plaintext leakage-resilient PRF with the shuffling countermeasure in [62] seems promising, as it could \"emulate\" the keydependent algorithmic noise ensuring security bounds in hardware. ",
+ "annotations": [
+ {
+ "start": 690,
+ "end": 694,
+ "name": "bibliography_ref",
+ "value": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ {
+ "start": 1214,
+ "end": 1218,
+ "name": "bibliography_ref",
+ "value": "bac4e623-f290-11ee-a6ed-b88584b4e4a1"
+ }
+ ],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.16",
+ "text": "A Additional figures",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.17",
+ "text": "\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.17.0",
+ "text": "Acknowledgements. F.-X. Standaert is an associate researcher of the . Work funded in parts by the through the project (CRASH) and the grant B- project.",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.18",
+ "text": "Acknowledgements. F.-X. Standaert is an associate researcher of the Belgian Fund for Scientific Research (FNRS-F.R.S.). Work funded in parts by the European Commission through the ERC project 280141 (CRASH) and the European ISEC action grant HOME/2010/ISEC/AG/INT-011 B-CCENTRE project.
",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.18.0",
+ "text": "Acknowledgements. F.-X. Standaert is an associate researcher of the . Work funded in parts by the through the project (CRASH) and the grant B- project.",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "raw_text",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.19",
+ "text": "\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "section",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20",
+ "text": "bibliography",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.0",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e42a-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e42a-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.0.0",
+ "text": "Leakage-resilient symmetric encryption via re-keying",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.0.1",
+ "text": "Bertoni and Coron",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.0.2",
+ "text": "\nMichelAbdalla\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.0.3",
+ "text": "\nSoniaBelaïd\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.0.4",
+ "text": "\nPierre-AlainFouque\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.0.5",
+ "text": "4",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.0.6",
+ "text": "471-488",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.1",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e432-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e432-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.1.0",
+ "text": "Towards fresh re-keying with leakage-resilient PRFs: Cipher design principles and analysis",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.1",
+ "text": "Cryptology ePrint Archive",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_journal",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.2",
+ "text": "\nSoniaBelaïd\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.3",
+ "text": "\nFabrizioDe Santis\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.4",
+ "text": "\nJohannHeyszl\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.5",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.6",
+ "text": "\nMarcelMedwed\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.7",
+ "text": "\nJorn-MarcSchmidt\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.8",
+ "text": "\nFrancois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.9",
+ "text": "\nStefanTillich\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.1.10",
+ "text": "2013. 2013",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.2",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e43e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e43e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.2.0",
+ "text": "Implementing \"practical leakage-resilient cryptography",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.2.1",
+ "text": "CHES 2012 Rump Session Talk",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.2.2",
+ "text": "\nJDaniel\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.2.3",
+ "text": "\nBernstein\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.2.4",
+ "text": "September 2012",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.3",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e444-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e444-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.3.0",
+ "text": "Cryptographic Hardware and Embedded Systems -CHES 2013 -15th International Workshop",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.3.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.3.2",
+ "text": "\nGuidoBertoni\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.3.3",
+ "text": "\nJean-SébastienCoron\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.3.4",
+ "text": "8086",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.3.5",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.3.6",
+ "text": "August 20-23, 2013. 2013",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.4",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e44c-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e44c-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.4.0",
+ "text": "Towards sound approaches to counteract power-analysis attacks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.4.1",
+ "text": "Wiener",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.4.2",
+ "text": "\nSureshChari\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.4.3",
+ "text": "\nCharanjitSJutla\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.4.4",
+ "text": "\nRJosyula\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.4.5",
+ "text": "\nPankajRao\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.4.6",
+ "text": "\nRohatgi\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.4.7",
+ "text": "63",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.4.8",
+ "text": "398-412",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.5",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e456-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e456-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.5.0",
+ "text": "Template attacks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.1",
+ "text": "CHES",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.2",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.3",
+ "text": "\nSureshChari\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.4",
+ "text": "\nJosyulaRRao\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.5",
+ "text": "\nPankajRohatgi\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.6",
+ "text": "2523",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.7",
+ "text": "13-28",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.8",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.5.9",
+ "text": "2002",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.6",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e461-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e461-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.6.0",
+ "text": "Common Criteria Portal",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.7",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e463-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e463-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.7.0",
+ "text": "Side channel cryptanalysis of a higher order masking scheme",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.7.1",
+ "text": "Paillier and Verbauwhede",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.7.2",
+ "text": "\nJean-SébastienCoron\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.7.3",
+ "text": "\nEmmanuelProuff\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.7.4",
+ "text": "\nMatthieuRivain\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.7.5",
+ "text": "38",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.7.6",
+ "text": "28-44",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.8",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e46b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e46b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.8.0",
+ "text": "Cryptographic Key Length Recommendation",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.9",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e46d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e46d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.9.0",
+ "text": "Leakage-resilient pseudorandom functions and side-channel attacks on feistel networks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.9.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.9.2",
+ "text": "\nYevgeniyDodis\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.9.3",
+ "text": "\nKrzysztofPietrzak\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.9.4",
+ "text": "6223",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.9.5",
+ "text": "21-40",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.9.6",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.9.7",
+ "text": "2010",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.10",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e476-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e476-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.10.0",
+ "text": "Loïc van Oldeneel tot Oldenzeel, and Nicolas Veyrat-Charvillon. Efficient removal of random delays from embedded software implementations using hidden markov models",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.10.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.10.2",
+ "text": "\nFrançoisDurvaux\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.10.3",
+ "text": "\nMathieuRenauld\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.10.4",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.10.5",
+ "text": "7771",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.10.6",
+ "text": "123-140",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.10.7",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.10.8",
+ "text": "2012",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.11",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e480-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e480-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.11.0",
+ "text": "Leakage-resilient cryptography",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.11.1",
+ "text": "FOCS",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.11.2",
+ "text": "\nStefanDziembowski\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.11.3",
+ "text": "\nKrzysztofPietrzak\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.11.4",
+ "text": "293-302",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.11.5",
+ "text": "IEEE Computer Society",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.11.6",
+ "text": "2008",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.12",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e488-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e488-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.12.0",
+ "text": "François-Xavier Standaert, and Loïc van Oldeneel tot Oldenzeel. Compact implementation and performance evaluation of block ciphers in ATtiny devices",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.2",
+ "text": "\nThomasEisenbarth\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.3",
+ "text": "\nZhengGong\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.4",
+ "text": "\nTimGüneysu\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.5",
+ "text": "\nStefanHeyse\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.6",
+ "text": "\nSebastiaanIndesteege\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.7",
+ "text": "\nStéphanieKerckhof\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.8",
+ "text": "\nFrançoisKoeune\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.9",
+ "text": "\nTomislavNad\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.10",
+ "text": "\nThomasPlos\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.11",
+ "text": "\nFrancescoRegazzoni\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.12",
+ "text": "7374",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.13",
+ "text": "172-187",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.14",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.12.15",
+ "text": "2012",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.13",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e499-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e499-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.13.0",
+ "text": "Europay Mastercard Visa",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.14",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e49b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e49b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.14.0",
+ "text": "Practical leakageresilient symmetric cryptography",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.14.1",
+ "text": "Prouff and Schaumont",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.14.2",
+ "text": "\nSebastianFaust\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.14.3",
+ "text": "\nKrzysztofPietrzak\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.14.4",
+ "text": "\nJoachimSchipper\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.14.5",
+ "text": "46",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.14.6",
+ "text": "213-232",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.15",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4a3-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4a3-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.15.0",
+ "text": "A statistical model for dpa with novel algorithmic confusion analysis",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.15.1",
+ "text": "Prouff and Schaumont",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.15.2",
+ "text": "\nYunsiFei\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.15.3",
+ "text": "\nQiasiLuo\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.15.4",
+ "text": "\nAAdamDing\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.15.5",
+ "text": "46",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.15.6",
+ "text": "233-250",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.16",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4ab-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4ab-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.16.0",
+ "text": "Thwarting higherorder side channel analysis with additive and multiplicative maskings",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.16.1",
+ "text": "\nLaurieGenelle\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.16.2",
+ "text": "\nEmmanuelProuff\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.16.3",
+ "text": "\nMichaëlQuisquater\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.16.4",
+ "text": "43",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.16.5",
+ "text": "240-255",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.17",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4b2-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4b2-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.17.0",
+ "text": "How to construct random functions (extended abstract)",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.17.1",
+ "text": "FOCS",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.17.2",
+ "text": "\nOdedGoldreich\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.17.3",
+ "text": "\nShafiGoldwasser\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.17.4",
+ "text": "\nSilvioMicali\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.17.5",
+ "text": "464-479",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.17.6",
+ "text": "IEEE Computer Society",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.17.7",
+ "text": "1984",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.18",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4bb-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4bb-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.18.0",
+ "text": "Des and differential power analysis (the \"duplication\" method)",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.18.1",
+ "text": "CHES",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.18.2",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.18.3",
+ "text": "\nLouisGoubin\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.18.4",
+ "text": "\nJacquesPatarin\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.18.5",
+ "text": "1717",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.18.6",
+ "text": "158-172",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.18.7",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.18.8",
+ "text": "1999",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.19",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4c5-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4c5-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.19.0",
+ "text": "Masking vs. multiparty computation: How large is the gap for the AES?",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.19.1",
+ "text": "Bertoni and Coron",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.19.2",
+ "text": "\nVincentGrosso\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.19.3",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.19.4",
+ "text": "\nSebastianFaust\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.19.5",
+ "text": "4",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.19.6",
+ "text": "400-416",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.20",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4cd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4cd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.20.0",
+ "text": "An AES smart card implementation resistant to power analysis attacks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.20.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.20.2",
+ "text": "\nChristophHerbst\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.20.3",
+ "text": "\nElisabethOswald\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.20.4",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.20.5",
+ "text": "3989",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.20.6",
+ "text": "239-252",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.20.7",
+ "text": "2006",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.21",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4d6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4d6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.21.0",
+ "text": "Private circuits: Securing hardware against probing attacks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.21.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.21.2",
+ "text": "\nYuvalIshai\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.21.3",
+ "text": "\nAmitSahai\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.21.4",
+ "text": "\nDavidWagner\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.21.5",
+ "text": "2729",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.21.6",
+ "text": "463-481",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.21.7",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.21.8",
+ "text": "2003",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.22",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4e0-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4e0-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.22.0",
+ "text": "Advances in Cryptology -EU-ROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.22.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.22.2",
+ "text": "\nThomasJohansson\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.22.3",
+ "text": "\nPhongQNguyen\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.22.4",
+ "text": "7881",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.22.5",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.22.6",
+ "text": "May 26-30, 2013. 2013",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.23",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4e8-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4e8-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.23.0",
+ "text": "Advances in Cryptology -EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.23.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.23.2",
+ "text": "5479",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.23.3",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.23.4",
+ "text": "April 26-30, 2009. 2009",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.24",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4ee-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4ee-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.24.0",
+ "text": "Evaluation of DPA characteristics of sasebo for board level simulation",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.24.1",
+ "text": "proceedings of COSADE 2010, 4 pages",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.24.2",
+ "text": "\nToshihiroKatashita\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.24.3",
+ "text": "\nAkashiSatoh\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.24.4",
+ "text": "\nKatsuyaKikuchi\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.24.5",
+ "text": "\nHiroshiNakagawa\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.24.6",
+ "text": "\nMasahiroAoyagi\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.24.7",
+ "text": "February 2011",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.25",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e4f7-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e4f7-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.25.0",
+ "text": "Towards green cryptography: A comparison of lightweight ciphers from the energy viewpoint",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.25.1",
+ "text": "Prouff and Schaumont",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.25.2",
+ "text": "\nStéphanieKerckhof\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.25.3",
+ "text": "\nFrançoisDurvaux\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.25.4",
+ "text": "\nCédricHocquet\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.25.5",
+ "text": "\nDavidBol\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.25.6",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.25.7",
+ "text": "46",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.25.8",
+ "text": "390-407",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.26",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e501-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e501-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.26.0",
+ "text": "Leak resistant cryptographic indexed key update",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.26.1",
+ "text": "\nCPaul\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.26.2",
+ "text": "\nKocher\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.27",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e505-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e505-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.27.0",
+ "text": "Differential power analysis",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.27.1",
+ "text": "Wiener",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.27.2",
+ "text": "\nCPaul\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.27.3",
+ "text": "\nJoshuaKocher\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.27.4",
+ "text": "\nBenjaminJaffe\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.27.5",
+ "text": "\nJun\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.27.6",
+ "text": "63",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.27.7",
+ "text": "388-397",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.28",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e50e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e50e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.28.0",
+ "text": "Hardware countermeasures against DPA ? a statistical analysis of their effectiveness",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.28.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.28.2",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.28.3",
+ "text": "2964",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.28.4",
+ "text": "222-235",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.28.5",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.28.6",
+ "text": "2004",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.29",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e516-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e516-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.29.0",
+ "text": "Power analysis attacksrevealing the secrets of smart cards",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.29.1",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.29.2",
+ "text": "\nElisabethOswald\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.29.3",
+ "text": "\nThomasPopp\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.29.4",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.29.5",
+ "text": "2007",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.30",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e51d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e51d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.30.0",
+ "text": "One for allall for one: unifying standard differential power analysis attacks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.30.1",
+ "text": "IET Information Security",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_journal",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.30.2",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.30.3",
+ "text": "\nElisabethOswald\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.30.4",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.30.5",
+ "text": "5",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.30.6",
+ "text": "100-110",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.30.7",
+ "text": "2011",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.31",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e526-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e526-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.31.0",
+ "text": "Side-channel leakage of masked cmos gates",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.2",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.3",
+ "text": "\nThomasPopp\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.4",
+ "text": "\nMBerndt\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.5",
+ "text": "\nGammel\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.6",
+ "text": "3376",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.7",
+ "text": "351-365",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.8",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.31.9",
+ "text": "2005",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.32",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e531-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e531-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.32.0",
+ "text": "Successfully attacking masked AES hardware implementations",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.32.1",
+ "text": "Rao and Sunar",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.32.2",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.32.3",
+ "text": "\nNorbertPramstaller\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.32.4",
+ "text": "\nElisabethOswald\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.32.5",
+ "text": "47",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.32.6",
+ "text": "157-171",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.33",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e539-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.33.0",
+ "text": "Towards superexponential side-channel security with efficient leakage-resilient PRFs",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.33.1",
+ "text": "Prouff and Schaumont",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.33.2",
+ "text": "\nMarcelMedwed\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.33.3",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.33.4",
+ "text": "\nAntoineJoux\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.33.5",
+ "text": "46",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.33.6",
+ "text": "193-212",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.34",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e541-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e541-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.34.0",
+ "text": "Glitch-free implementation of masking in modern FPGAs",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.34.1",
+ "text": "HOST",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.34.2",
+ "text": "\nAmirMoradi\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.34.3",
+ "text": "\nOliverMischke\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.34.4",
+ "text": "89-95",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.34.5",
+ "text": "IEEE",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.34.6",
+ "text": "2012",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.35",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e549-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e549-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.35.0",
+ "text": "Pushing the limits: A very compact and a threshold implementation of AES",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.35.1",
+ "text": "\nAmirMoradi\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.35.2",
+ "text": "\nAxelPoschmann\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.35.3",
+ "text": "\nSanLing\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.35.4",
+ "text": "\nChristofPaar\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.35.5",
+ "text": "\nHuaxiongWang\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.35.6",
+ "text": "69-88",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.36",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e551-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e551-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.36.0",
+ "text": "A side-channel analysis resistant description of the AES S-Box",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.2",
+ "text": "\nElisabethOswald\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.3",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.4",
+ "text": "\nNorbertPramstaller\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.5",
+ "text": "\nVincentRijmen\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.6",
+ "text": "3557",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.7",
+ "text": "413-423",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.8",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.36.9",
+ "text": "2005",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.37",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e55c-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e55c-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.37.0",
+ "text": "Cryptographic Hardware and Embedded Systems -CHES 2007, 9th International Workshop",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.37.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.37.2",
+ "text": "4727",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.37.3",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.37.4",
+ "text": "September 10-13, 2007. 2007",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.38",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e562-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e562-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.38.0",
+ "text": "Advances in Cryptology -EUROCRYPT 2011 -30th Annual International Conference on the Theory and Applications of Cryptographic Techniques",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.38.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.38.2",
+ "text": "6632",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.38.3",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.38.4",
+ "text": "May 15-19, 2011. 2011",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.39",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e568-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e568-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.39.0",
+ "text": "Improved higher-order side-channel attacks with FPGA experiments",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.39.1",
+ "text": "Rao and Sunar",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.39.2",
+ "text": "\nEricPeeters\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.39.3",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.39.4",
+ "text": "\nNicolasDonckers\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.39.5",
+ "text": "\nJean-JacquesQuisquater\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.39.6",
+ "text": "47",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.39.7",
+ "text": "309-323",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.40",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e571-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e571-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.40.0",
+ "text": "A leakage-resilient mode of operation",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.40.1",
+ "text": "\nKrzysztofPietrzak\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.40.2",
+ "text": "462-482",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.41",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e575-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e575-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.41.0",
+ "text": "Evaluation of the masked logic style mdpl on a prototype chip",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.41.1",
+ "text": "Paillier and Verbauwhede",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.41.2",
+ "text": "\nThomasPopp\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.41.3",
+ "text": "\nMarioKirschbaum\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.41.4",
+ "text": "\nThomasZefferer\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.41.5",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.41.6",
+ "text": "38",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.41.7",
+ "text": "81-94",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.42",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e57e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e57e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.42.0",
+ "text": "Cryptographic Hardware and Embedded Systems -CHES 2011 -13th International Workshop",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.42.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.42.2",
+ "text": "6917",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.42.3",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.42.4",
+ "text": "September 28 -October 1, 2011. 2011",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.43",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e584-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e584-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.43.0",
+ "text": "Masking against side-channel attacks: A formal security proof",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.43.1",
+ "text": "Johansson and Nguyen",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.43.2",
+ "text": "\nEmmanuelProuff\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.43.3",
+ "text": "\nMatthieuRivain\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.43.4",
+ "text": "23",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.43.5",
+ "text": "142-159",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.44",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e58b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e58b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.44.0",
+ "text": "Higher-order glitches free implementation of the AES using secure multi-party computation protocols",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.44.1",
+ "text": "\nEmmanuelProuff\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.44.2",
+ "text": "\nThomasRoche\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.44.3",
+ "text": "43",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.44.4",
+ "text": "63-78",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.45",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e591-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e591-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.45.0",
+ "text": "Cryptographic Hardware and Embedded Systems -CHES 2012 -14th International Workshop",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.45.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.45.2",
+ "text": "7428",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.45.3",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.45.4",
+ "text": "September 9-12, 2012. 2012",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.46",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e597-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e597-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.46.0",
+ "text": "Cryptographic Hardware and Embedded Systems -CHES 2005, 7th International Workshop",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.46.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.46.2",
+ "text": "\nRJosyula\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.46.3",
+ "text": "\nBerkRao\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.46.4",
+ "text": "\nSunar\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.46.5",
+ "text": "3659",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.46.6",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.46.7",
+ "text": "August 29 -September 1, 2005. 2005",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.47",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5a0-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5a0-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.47.0",
+ "text": "FPGA implementations of the AES masked against power analysis attacks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.47.1",
+ "text": "proceedings of COSADE 2011",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.47.2",
+ "text": "\nFrancescoRegazzoni\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.47.3",
+ "text": "\nWangYi\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.47.4",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.47.5",
+ "text": "56-66",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.47.6",
+ "text": "February 2011",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.48",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5a8-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5a8-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.48.0",
+ "text": "Algebraic side-channel attacks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.48.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.48.2",
+ "text": "\nMathieuRenauld\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.48.3",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.48.4",
+ "text": "6151",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.48.5",
+ "text": "393-410",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.48.6",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.48.7",
+ "text": "2009",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.49",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5b1-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5b1-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.49.0",
+ "text": "Algebraic side-channel attacks on the AES: Why time also matters in DPA",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.1",
+ "text": "CHES",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.2",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.3",
+ "text": "\nFrançois-XavierMathieu Renauld\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.4",
+ "text": "\nNicolasStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.5",
+ "text": "\nVeyrat-Charvillon\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.6",
+ "text": "5747",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.7",
+ "text": "97-111",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.8",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.49.9",
+ "text": "2009",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.50",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5bc-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5bc-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.50.0",
+ "text": "A formal study of power variability issues and sidechannel attacks for nanoscale devices",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.50.1",
+ "text": "\nFrançois-XavierMathieu Renauld\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.50.2",
+ "text": "\nNicolasStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.50.3",
+ "text": "\nDinaVeyrat-Charvillon\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.50.4",
+ "text": "\nDenisKamel\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.50.5",
+ "text": "\nFlandre\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.50.6",
+ "text": "109-128",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.51",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5c4-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5c4-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.51.0",
+ "text": "On the exact success rate of side channel analysis in the gaussian model",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.51.1",
+ "text": "Selected Areas in Cryptography",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.51.2",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.51.3",
+ "text": "\nMatthieuRivain\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.51.4",
+ "text": "5381",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.51.5",
+ "text": "165-183",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.51.6",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.51.7",
+ "text": "2008",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.52",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5cd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5cd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.52.0",
+ "text": "Provably secure higher-order masking of AES",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.52.1",
+ "text": "CHES",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.52.2",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.52.3",
+ "text": "\nMatthieuRivain\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.52.4",
+ "text": "\nEmmanuelProuff\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.52.5",
+ "text": "6225",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.52.6",
+ "text": "413-427",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.52.7",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.52.8",
+ "text": "2010",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.53",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5d7-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5d7-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.53.0",
+ "text": "Higher-order glitches free implementation of the AES using secure multi-party computation protocols extended version",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.53.1",
+ "text": "Cryptology ePrint Archive",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_journal",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.53.2",
+ "text": "\nThomasRoche\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.53.3",
+ "text": "\nEmmanuelProuff\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.53.4",
+ "text": "2011/413, 2011",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.54",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5dd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5dd-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.54.0",
+ "text": "Higher order masking of the AES",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.54.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.54.2",
+ "text": "\nKaiSchramm\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.54.3",
+ "text": "\nChristofPaar\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.54.4",
+ "text": "3860",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.54.5",
+ "text": "208-225",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.54.6",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.54.7",
+ "text": "2006",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.55",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5e6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5e6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.55.0",
+ "text": "A unified framework for the analysis of side-channel key recovery attacks",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.55.1",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.55.2",
+ "text": "\nTalMalkin\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.55.3",
+ "text": "\nMotiYung\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.55.4",
+ "text": "443-461",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.56",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5ec-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5ec-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.56.0",
+ "text": "Leakage-resilient symmetric cryptography under empirically verifiable assumptions",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.56.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.56.2",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.56.3",
+ "text": "\nOlivierPereira\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.56.4",
+ "text": "\nYuYu\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.56.5",
+ "text": "8042",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.56.6",
+ "text": "335-352",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.56.7",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.56.8",
+ "text": "2013",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.57",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e5f6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e5f6-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.57.0",
+ "text": "Leakage resilient cryptography in practice",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.1",
+ "text": "Towards Hardware-Intrinsic Security, Information Security and Cryptography",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.2",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.3",
+ "text": "\nOlivierPereira\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.4",
+ "text": "\nYuYu\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.5",
+ "text": "\nJean-JacquesQuisquater\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.6",
+ "text": "\nMotiYung\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.7",
+ "text": "\nElisabethOswald\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.8",
+ "text": "99-134",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.9",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.57.10",
+ "text": "2010",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.58",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e602-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e602-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.58.0",
+ "text": "The world is not enough: Another look on second-order DPA",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.2",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.3",
+ "text": "\nNicolasVeyrat-Charvillon\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.4",
+ "text": "\nElisabethOswald\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.5",
+ "text": "\nBenediktGierlichs\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.6",
+ "text": "\nMarcelMedwed\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.7",
+ "text": "\nMarkusKasper\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.8",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.9",
+ "text": "6477",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.10",
+ "text": "112-129",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.11",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.58.12",
+ "text": "2010",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.59",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e610-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e610-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.59.0",
+ "text": "The world is not enough: Another look on second-order DPA",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.1",
+ "text": "Cryptology ePrint Archive",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_journal",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.2",
+ "text": "\nFrancois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.3",
+ "text": "\nNicolasVeyrat-Charvillon\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.4",
+ "text": "\nElisabethOswald\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.5",
+ "text": "\nBenediktGierlichs\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.6",
+ "text": "\nMarcelMedwed\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.7",
+ "text": "\nMarkusKasper\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.8",
+ "text": "\nStefanMangard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.59.9",
+ "text": "2010/180. 2010",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.60",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e61b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e61b-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.60.0",
+ "text": "Security evaluations beyond computing power",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.60.1",
+ "text": "Johansson and Nguyen",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.60.2",
+ "text": "\nNicolasVeyrat-Charvillon\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.60.3",
+ "text": "\nBenoîtGérard\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.60.4",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.60.5",
+ "text": "23",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.60.6",
+ "text": "126-141",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.61",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e623-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e623-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.61.0",
+ "text": "Shuffling against side-channel attacks: A comprehensive study with cautionary note",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.2",
+ "text": "\nNicolasVeyrat-Charvillon\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.3",
+ "text": "\nMarcelMedwed\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.4",
+ "text": "\nStéphanieKerckhof\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.5",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.6",
+ "text": "7658",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.7",
+ "text": "740-757",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.8",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.61.9",
+ "text": "2012",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.62",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e62e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e62e-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.62.0",
+ "text": "Advances in Cryptology -CRYPTO '99, 19th Annual International Cryptology Conference",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.62.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.62.2",
+ "text": "1666",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.62.3",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.62.4",
+ "text": "August 15-19, 1999. 1999",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.63",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e634-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e634-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.63.0",
+ "text": "Practical leakage-resilient pseudorandom objects with minimum public randomness",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.63.1",
+ "text": "Lecture Notes in Computer Science",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_series",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.63.2",
+ "text": "\nYuYu\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.63.3",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.63.4",
+ "text": "7779",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_volume",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.63.5",
+ "text": "223-238",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.63.6",
+ "text": "Springer",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.63.7",
+ "text": "2013",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ },
+ {
+ "node_id": "0.20.64",
+ "text": "",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "bibliography_item",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {
+ "uid": "bac4e63d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "uid": "bac4e63d-f290-11ee-a6ed-b88584b4e4a1"
+ },
+ "subparagraphs": [
+ {
+ "node_id": "0.20.64.0",
+ "text": "Practical leakage-resilient pseudorandom generators",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.64.1",
+ "text": "ACM Conference on Computer and Communications Security",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "title_conference_proceedings",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.64.2",
+ "text": "\nYuYu\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.64.3",
+ "text": "\nFrançois-XavierStandaert\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.64.4",
+ "text": "\nOlivierPereira\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.64.5",
+ "text": "\nMotiYung\n",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "author",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.64.6",
+ "text": "141-151",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "biblScope_page",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.64.7",
+ "text": "ACM",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "publisher",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ },
+ {
+ "node_id": "0.20.64.8",
+ "text": "2010",
+ "annotations": [],
+ "metadata": {
+ "paragraph_type": "date",
+ "page_id": 0,
+ "line_id": 0,
+ "other_fields": {}
+ },
+ "subparagraphs": []
+ }
+ ]
+ }
+ ]
+ }
+ ]
+ },
+ "tables": [
+ {
+ "cells": [
+ [
+ {
+ "lines": [
+ {
+ "text": "Software (8-bit)",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "code size",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "cycle",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "cost",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "physical",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "Implementations",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "(bytes)",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "count",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "function",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "assumptions",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "Unprotected [13]",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "1659",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "4557",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "7.560",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "-",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "1-mask Boolean [53]",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "3153",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "129 • 10 3",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "406.7",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "glitch-sensitive",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "1-mask polynomial [20, 45]",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "20 682",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "1064 • 10 3",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "22 000",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "glitch-resistant",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "2-mask Boolean [53]",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "3845",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "271 • 10 3",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "1042",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "glitch-sensitive",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "FPGA (Virtex-5)",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "area",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "throughput",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "cost",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "physical",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "Implementations",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "(slices)",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "(enc/sec)",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "function",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "assumptions",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "Unprotected (128-bit) [48] 1-mask Boolean (128-bit) [48] Threshold (8-bit) [36]",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "478 1462 958",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "245•10 6 11 100•10 6 11 170•10 6 266",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "21.46 160.8 1499",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "-glitch-sensitive glitch-resistant",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ]
+ ],
+ "metadata": {
+ "page_id": 0,
+ "uid": "d2ce350a-25be-4d05-9061-6f1d4cf8bdd1",
+ "rotated_angle": 0,
+ "title": "Table 1 .Performance of some illustrative AES implementations."
+ }
+ },
+ {
+ "cells": [
+ [
+ {
+ "lines": [
+ {
+ "text": "construction",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "glitches",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "leakage function (∀ i ∈ [1; 16])",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "8-bit software",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "Unprotected [13]",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ],
+ [
+ {
+ "lines": [
+ {
+ "text": "Ref.",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ },
+ {
+ "lines": [
+ {
+ "text": "KSU",
+ "annotations": []
+ }
+ ],
+ "rowspan": 1,
+ "colspan": 1,
+ "invisible": false
+ }
+ ]
+ ],
+ "metadata": {
+ "page_id": 0,
+ "uid": "6e093372-d147-4245-8aab-08ed5fe5c072",
+ "rotated_angle": 0,
+ "title": "Table 2 .List of our target implementations."
+ }
+ }
+ ]
+ },
+ "metadata": {
+ "uid": "doc_uid_auto_bac4e6c0-f290-11ee-a6ed-b88584b4e4a1",
+ "file_name": "article.pdf",
+ "temporary_file_name": "1712241389_9.pdf",
+ "size": 2919334,
+ "modified_time": 1712241389,
+ "created_time": 1712241389,
+ "access_time": 1712241389,
+ "file_type": "application/pdf",
+ "other_fields": {
+ "producer": "MiKTeX pdfTeX-1.40.11",
+ "creator": "TeX",
+ "creation_date": 1392998486,
+ "modification_date": 1392998486
+ },
+ "producer": "MiKTeX pdfTeX-1.40.11",
+ "creator": "TeX",
+ "creation_date": 1392998486,
+ "modification_date": 1392998486
+ },
+ "version": "",
+ "warnings": [],
+ "attachments": []
+}
\ No newline at end of file
diff --git a/docs/source/_static/structure_examples/article.pdf b/docs/source/_static/structure_examples/article.pdf
new file mode 100644
index 00000000..6c74f192
Binary files /dev/null and b/docs/source/_static/structure_examples/article.pdf differ
diff --git a/docs/source/dedoc_api_usage/api.rst b/docs/source/dedoc_api_usage/api.rst
index 0a7ee82b..b06b345d 100644
--- a/docs/source/dedoc_api_usage/api.rst
+++ b/docs/source/dedoc_api_usage/api.rst
@@ -79,9 +79,10 @@ Api parameters description
* **other** -- structure for document of any domain (:ref:`other_structure`);
* **law** -- Russian laws (:ref:`law_structure`);
* **tz** -- Russian technical specifications (:ref:`tz_structure`);
- * **diploma** -- Russian thesis (:ref:`diploma_structure`).
+ * **diploma** -- Russian thesis (:ref:`diploma_structure`);
+ * **article** -- scientific article (:ref:`article_structure`).
- This type is used for choosing a specific structure extractor after document reading.
+ This type is used for choosing a specific structure extractor (and, in some cases, a specific reader).
* - structure_type
- tree, linear
diff --git a/docs/source/dedoc_api_usage/api_schema.rst b/docs/source/dedoc_api_usage/api_schema.rst
index be327ba9..e6c1c228 100644
--- a/docs/source/dedoc_api_usage/api_schema.rst
+++ b/docs/source/dedoc_api_usage/api_schema.rst
@@ -61,6 +61,7 @@ Json schema of the output is also available during dedoc application running on
.. autoattribute:: page_id
.. autoattribute:: uid
.. autoattribute:: rotated_angle
+ .. autoattribute:: title
.. autoclass:: dedoc.api.schema.CellWithMeta
diff --git a/docs/source/index.rst b/docs/source/index.rst
index a69d157c..92582bec 100644
--- a/docs/source/index.rst
+++ b/docs/source/index.rst
@@ -208,6 +208,7 @@ Currently the following domains can be handled:
* Russian laws (:ref:`structure description `).
* Russian technical specifications (:ref:`structure description `).
* Russian thesis for bachelor or master degree (:ref:`structure description `).
+ * English scientific articles (:ref:`structure description `).
For a document of unknown or unsupported domain there is an option to use default structure extractor
(``document_type=other`` at :ref:`api_parameters`), the default document structure described :ref:`here `.
@@ -255,6 +256,7 @@ For a document of unknown or unsupported domain there is an option to use defaul
structure_types/law
structure_types/tz
structure_types/diploma
+ structure_types/article
.. toctree::
diff --git a/docs/source/modules/data_structures.rst b/docs/source/modules/data_structures.rst
index 0f166da8..35efcbc8 100644
--- a/docs/source/modules/data_structures.rst
+++ b/docs/source/modules/data_structures.rst
@@ -116,6 +116,12 @@ Concrete annotations
.. autoattribute:: name
+.. autoclass:: dedoc.data_structures.ReferenceAnnotation
+ :show-inheritance:
+ :special-members: __init__
+
+ .. autoattribute:: name
+
.. autoclass:: dedoc.data_structures.BBoxAnnotation
:show-inheritance:
:special-members: __init__
diff --git a/docs/source/modules/readers.rst b/docs/source/modules/readers.rst
index 7666f8bf..7d160735 100644
--- a/docs/source/modules/readers.rst
+++ b/docs/source/modules/readers.rst
@@ -73,3 +73,7 @@ dedoc.readers
.. autoclass:: dedoc.readers.RawTextReader
:show-inheritance:
:members:
+
+.. autoclass:: dedoc.readers.ArticleReader
+ :show-inheritance:
+ :members:
diff --git a/docs/source/modules/structure_extractors.rst b/docs/source/modules/structure_extractors.rst
index 79d80f0f..08655f06 100644
--- a/docs/source/modules/structure_extractors.rst
+++ b/docs/source/modules/structure_extractors.rst
@@ -52,3 +52,9 @@ dedoc.structure_extractors
:members:
.. autoattribute:: document_type
+
+.. autoclass:: dedoc.structure_extractors.ArticleStructureExtractor
+ :show-inheritance:
+ :members:
+
+ .. autoattribute:: document_type
diff --git a/docs/source/parameters/structure_type.rst b/docs/source/parameters/structure_type.rst
index 546ddbfc..842f6afc 100644
--- a/docs/source/parameters/structure_type.rst
+++ b/docs/source/parameters/structure_type.rst
@@ -30,6 +30,8 @@ Structure type configuring
In this case, :class:`~dedoc.structure_extractors.TzStructureExtractor` is used.
* **diploma** -- Russian thesis (:ref:`diploma_structure`)
In this case, :class:`~dedoc.structure_extractors.DiplomaStructureExtractor` is used.
+ * **article** -- scientific article (:ref:`article_structure`)
+ In this case, :class:`~dedoc.readers.ArticleReader` and :class:`~dedoc.structure_extractors.ArticleStructureExtractor` are used.
If you use your custom configuration, look to the documentation of :class:`~dedoc.structure_extractors.StructureExtractorComposition`
diff --git a/docs/source/structure_types/article.rst b/docs/source/structure_types/article.rst
new file mode 100644
index 00000000..8de477e9
--- /dev/null
+++ b/docs/source/structure_types/article.rst
@@ -0,0 +1,213 @@
+.. _article_structure:
+
+Article structure type (GROBID)
+===============================
+
+This structure type is used for scientific article analysis using `GROBID `_ system.
+
+ .. note::
+
+ In case you use dedoc as a library or a separate Docker image (without docker-compose).
+ If you want to use this structure extractor, you should run GROBID service via Docker (or see `grobid running instruction `_).
+
+ .. code-block:: shell
+
+ docker run --rm --init --ulimit core=0 -p 8070:8070 lfoppiano/grobid:0.8.0
+
+We analyze the recognition results from GROBID. The following types of objects are included in the resulting tree:
+
+ * article's title;
+ * authors with their affiliations to organizations and emails;
+ * article's sections headers (for example `Abstract`, `Introduction`, .., `Conclusion` etc);
+ * tables and their content;
+ * bibliography;
+ * references on tables and bibliography items.
+
+There are the following line types in the article structure type:
+
+ * ``root``;
+ * ``author`` (includes ``author_first_name``, ``author_surname``, ``email``);
+ * ``author_affiliation`` (includes ``org_name``, ``address``);
+ * ``abstract``;
+ * ``section``;
+ * ``bibliography``;
+ * ``bibliography_item`` (includes [``title`` | ``title_journal`` | ``title_series`` | ``title_conference_proceedings``], ``author``, ``biblScope_volume``, ``biblScope_pages``, ``DOI``, ``publisher``, ``date``);
+ * ``raw_text``.
+
+
+You can see the :download:`example <../_static/structure_examples/article.pdf>` of the document of this structure type.
+This page provides examples of this article analysis.
+
+Below is a description of nodes in the output tree:
+
+ * **root**: node containing the text of the article title.
+
+ There is only one root node in any document.
+ It is obligatory for any document of article type.
+ All other document lines are children of the root node.
+ We take the title's text from GROBID's TEI-XML path tag :
+
+ .. code-block:: XML
+
+ <fileDesc>
+ <titleStmt>
+ <title> Title's text // -> node.paragraph_type="root"
+
+
+
+ * **author**: information about an author of the article.
+
+ ``author`` nodes are children of the node ``root``. This type of node has subnodes.
+
+ * ``author_first_name`` - tag in GROBID's output. The node doesn't have children nodes.
+ * ``author_surname`` - tag in GROBID's output. The node doesn't have children nodes.
+ * ``email`` - author's email, tag in GROBID's output. The node doesn't have children nodes.
+ * ``author_affiliation`` - author affiliation description.
+
+
+ GROBID's TEI-XML 's name information
+
+ .. code-block:: XML
+
+ // -> node.paragraph_type="author"
+
+ Sonia // -> node.paragraph_type="author_first_name"
+ Belaïd // -> node.paragraph_type="author_surname"
+ // -> node.paragraph_type="email"
+
+ ...
+
+
+ * **author_affiliation**: Author's affiliation description.
+
+ ``author_affiliation`` nodes are children of the node ``author``.
+ This type of node has subnodes.
+
+ * ``org_name`` - organization description, tag in GROBID's output. The node doesn't have children nodes.
+ * ``address`` - organization address, tag in GROBID's output. The node doesn't have children nodes.
+
+ GROBID's TEI-XML tag information according the affiliation `description `_ :
+
+ .. code-block:: XML
+
+ // -> node.paragraph_type="author"
+ ...
+ // -> node.paragraph_type="author_affiliation"
+ ICTEAM/ELEN/Crypto Group // -> node.paragraph_type="org_name"
+ Université catholique de Louvain
+
+ Belgium
+
+
+
+ The result of parsing of the second author of the article:
+
+ .. example of "node_id": "0.1"
+
+ .. literalinclude:: ../_static/json_format_examples/article_example.json
+ :language: json
+ :lines: 125-198
+
+ * **abstract** is the article's abstract section ( tag in GROBID's output).
+
+ * **section**: nodes of article sections (for example "Introduction", "Conclusion", "V Experiments ..." etc.). This type of node has a subnode ``raw_text``. ``section`` nodes are children of a node ``root``.
+
+ * **bibliography** is the article's bibliography list which contains only ``bibliography_item`` nodes.
+
+ * **bibliography_item** is the article's bibliography item description.
+
+ ``bibliography_item`` nodes are children of the node ``bibliography``.
+ This type of node has subnodes.
+
+ * ``title`` or ``title_journal`` or ``title_series`` or ``title_conference_proceedings``- name of the bibliography item. The node doesn't have children nodes.
+ * ``author`` - bibliography author name, tag in GROBID's output. The node doesn't have children nodes.
+ * ``biblScope_volume`` - volume name, 4 tag in GROBID's output. The node doesn't have children nodes.
+ * ``biblScope_pages`` - volume name, tag in GROBID's output. The node doesn't have children nodes.
+ * ``DOI`` - bibliography DOI name, tag in GROBID's output. The node doesn't have children nodes.
+ * ``publisher`` - bibliography DOI name, tag in GROBID's output. The node doesn't have children nodes.
+ * ``date`` - publication date, tag in GROBID's output. The node doesn't have children nodes.
+
+
+
+ There is GROBID's TEI-XML 's item information description `here `_ .
+ We parse GROBID's biblStruct and create a ``bibliography_item`` node. Example of GROBID's biblStruct:
+
+ .. code-block:: XML
+
+
+
+
+ Leakage-resilient symmetric encryption via re-keying
+
+ MichelAbdalla
+
+
+ SoniaBelaïd
+
+
+ Pierre-AlainFouque
+
+
+
+ Bertoni and Coron
+
+ 4
+
+
+
+
+
+
+ We set paragraph_type of the title according the tag level in GROBID (see `title level's description `_):
+
+ * For ``<level="a">`` set the ``paragraph_type="title"`` for article title or chapter title (but not thesis, see below). Here "a" stands for analytics (a part of a monograph).
+ * For ``<title><level="j">`` set the ``paragraph_type="title_journal"`` for journal title.
+ * For ``<title><level="s">`` set the ``paragraph_type="title_series"`` for series title (e.g. "Lecture Notes in Computer Science").
+ * For ``<title><level="m">`` set the ``paragraph_type="title_conference_proceedings"`` for non journal bibliographical item holding the cited article, e.g. conference proceedings title. Note if a book is cited, the title of the book is annotated with ``<title level="m">``.
+
+ We present a bibliography item as the node with fields ``paragraph_type="bibliography_item"`` and unique id ``uid="uuid"``.
+ All ``bibliography_item`` nodes are children of the ``bibliography`` node.
+ The example of the bibliography item parsing of the article in dedoc:
+
+ .. example of "node_id": "0.20.5"
+
+ .. literalinclude:: ../_static/json_format_examples/article_example.json
+ :language: json
+ :lines: 1745-1880
+
+
+ * **bibliography references**: bibliography references in annotations of the article's text.
+
+ Text can contain references on ``bibliography_item`` nodes.
+ For example, "Authors in [5] describe an approach ...". Here "[5]" is the reference.
+ We present the bibliography reference as the annotation with ``name="bibliography_ref"`` and value of bibliography item's uuid.
+ See documentation of the class :class:`~dedoc.data_structures.ReferenceAnnotation` for more details.
+
+ Example of a bibliography reference in dedoc is given below.
+ There is a textual node with two bibliography references (with two annotations):
+
+ .. example of "node_id": "0.15.0"
+
+ .. literalinclude:: ../_static/json_format_examples/article_example.json
+ :language: json
+ :lines: 1085-1109
+
+ In the example, the annotations reference two ``bibliography_item`` nodes:
+
+ .. example of "node_id": "0.20.33"
+
+ .. literalinclude:: ../_static/json_format_examples/article_example.json
+ :language: json
+ :lines: 4581-4593
+
+ .. example of "node_id": "0.20.61"
+
+ .. literalinclude:: ../_static/json_format_examples/article_example.json
+ :language: json
+ :lines: 7501-7513
+
+ * **raw_text**: node referring to a simple document line.
+
+ It has the least importance in the document tree hierarchy,
+ so it is situated in the leaves of the tree.
+ It is nested to the node corresponding the previous line with a more important type.
diff --git a/labeling/tests/run_tests_in_docker.sh b/labeling/tests/run_tests_in_docker.sh
index 40ef206c..0db255fb 100755
--- a/labeling/tests/run_tests_in_docker.sh
+++ b/labeling/tests/run_tests_in_docker.sh
@@ -2,7 +2,7 @@ if [ "$is_test" = "true" ]
then
apt install -y cowsay
echo "run tests"
- sleep 5
+ sleep 25
python3 -m unittest -v -f /labeling_root/labeling/tests/test*
test_exit_code=$?
if [ $test_exit_code -eq 0 ]
diff --git a/tests/api_tests/test_api_doctype_article.py b/tests/api_tests/test_api_doctype_article.py
new file mode 100644
index 00000000..508e2574
--- /dev/null
+++ b/tests/api_tests/test_api_doctype_article.py
@@ -0,0 +1,72 @@
+from tests.api_tests.abstract_api_test import AbstractTestApiDocReader
+
+
+class TestApiArticle(AbstractTestApiDocReader):
+
+ def test_article(self) -> None:
+ file_name = "pdf_with_text_layer/article.pdf"
+ result = self._send_request(file_name, dict(document_type="article"))
+ self.assertEqual(result["warnings"], ["use GROBID (version: 0.8.0)"])
+
+ tree = result["content"]["structure"]
+ self._check_tree_sanity(tree)
+
+ # author 1 info
+ self.assertEqual("author", self._get_by_tree_path(tree, "0.0")["metadata"]["paragraph_type"])
+ self.assertEqual("author_first_name", self._get_by_tree_path(tree, "0.0.0")["metadata"]["paragraph_type"]) # author 1 first name
+ self.assertEqual("Sonia", self._get_by_tree_path(tree, "0.0.0")["text"])
+ self.assertEqual("author_surname", self._get_by_tree_path(tree, "0.0.1")["metadata"]["paragraph_type"]) # author 1 second name
+ self.assertEqual("Belaïd", self._get_by_tree_path(tree, "0.0.1")["text"])
+ self.assertEqual("author_affiliation", self._get_by_tree_path(tree, "0.0.2")["metadata"]["paragraph_type"]) # the first affiliation of author 1
+ self.assertEqual("org_name", self._get_by_tree_path(tree, "0.0.2.0")["metadata"]["paragraph_type"])
+ self.assertEqual("École Normale Supérieure", self._get_by_tree_path(tree, "0.0.2.0")["text"])
+ self.assertEqual("author_affiliation", self._get_by_tree_path(tree, "0.0.3")["metadata"]["paragraph_type"]) # the second affiliation of author 1
+ self.assertEqual("org_name", self._get_by_tree_path(tree, "0.0.3.0")["metadata"]["paragraph_type"])
+ self.assertEqual("Thales Communications & Security", self._get_by_tree_path(tree, "0.0.3.0")["text"])
+
+ # author 3 info
+ self.assertEqual("author", self._get_by_tree_path(tree, "0.2")["metadata"]["paragraph_type"])
+ self.assertEqual("author_first_name", self._get_by_tree_path(tree, "0.2.0")["metadata"]["paragraph_type"]) # author 3 first name
+ self.assertEqual("François", self._get_by_tree_path(tree, "0.2.0")["text"])
+ self.assertEqual("author_surname", self._get_by_tree_path(tree, "0.2.1")["metadata"]["paragraph_type"]) # author 3 second name
+ self.assertEqual("Xavier-Standaert", self._get_by_tree_path(tree, "0.2.1")["text"])
+ self.assertEqual("author_affiliation", self._get_by_tree_path(tree, "0.2.2")["metadata"]["paragraph_type"]) # the first affiliation of author 3
+ self.assertEqual("org_name", self._get_by_tree_path(tree, "0.2.2.0")["metadata"]["paragraph_type"])
+ self.assertEqual("ICTEAM/ELEN/Crypto Group", self._get_by_tree_path(tree, "0.2.2.0")["text"])
+
+ # check bibliography list
+ self.assertEqual("bibliography", self._get_by_tree_path(tree, "0.20")["metadata"]["paragraph_type"])
+ self.assertEqual(65, len(self._get_by_tree_path(tree, "0.20")["subparagraphs"]))
+
+ # check bib_item 1 recognizing
+ self.assertEqual("title", self._get_by_tree_path(tree, "0.20.0.0")["metadata"]["paragraph_type"])
+ self.assertEqual("Leakage-resilient symmetric encryption via re-keying", self._get_by_tree_path(tree, "0.20.0.0")["text"])
+ self.assertEqual("title_conference_proceedings", self._get_by_tree_path(tree, "0.20.0.1")["metadata"]["paragraph_type"])
+ self.assertEqual("Bertoni and Coron", self._get_by_tree_path(tree, "0.20.0.1")["text"])
+ self.assertEqual("author", self._get_by_tree_path(tree, "0.20.0.2")["metadata"]["paragraph_type"]) # author 1
+ self.assertEqual("\nMichelAbdalla\n", self._get_by_tree_path(tree, "0.20.0.2")["text"])
+ self.assertEqual("biblScope_volume", self._get_by_tree_path(tree, "0.20.0.5")["metadata"]["paragraph_type"]) # author 1
+ self.assertEqual("4", self._get_by_tree_path(tree, "0.20.0.5")["text"])
+ self.assertEqual("biblScope_page", self._get_by_tree_path(tree, "0.20.0.6")["metadata"]["paragraph_type"]) # author 1
+ self.assertEqual("471-488", self._get_by_tree_path(tree, "0.20.0.6")["text"])
+
+ # check cite on bib_item
+ bibliography_item_uuid = self._get_by_tree_path(tree, "0.20.57")["metadata"]["uid"] # checking on [58] references
+ section = self._get_by_tree_path(tree, "0.4.0")
+ bibliography_refs_in_text = [ann for ann in section["annotations"] if ann["name"] == "reference" and ann["value"] == bibliography_item_uuid]
+ # We must found two refs [58] in Introduction section
+ self.assertEqual(len(bibliography_refs_in_text), 2)
+ self.assertEqual(["58,", "58,"], [section["text"][bibliography_refs_in_text[n]["start"]:bibliography_refs_in_text[n]["end"]] for n in range(2)])
+
+ # check tables
+ self.assertEqual(len(result["content"]["tables"]), 2)
+ table = result["content"]["tables"][0]
+ self.assertEqual(table["metadata"]["title"], "Table 1 .Performance of some illustrative AES implementations.")
+ self.assertEqual(self._get_text_of_row(table["cells"][0]), ["Software (8-bit)", "code size", "cycle", "cost", "physical"])
+ section_with_table_refs = self._get_by_tree_path(tree, "0.7.0")
+ table_refs_in_text = [ann for ann in section_with_table_refs["annotations"] if ann["name"] == "table" and ann["value"] == table["metadata"]["uid"]]
+ self.assertEqual(len(table_refs_in_text), 2)
+ self.assertEqual(["1", "1"], [section_with_table_refs["text"][table_refs_in_text[n]["start"]:table_refs_in_text[n]["end"]] for n in range(2)])
+
+ table = result["content"]["tables"][1] # Grobid can't recognize vertical orientation tables
+ self.assertEqual(table["metadata"]["title"], "Table 2 .List of our target implementations.")
diff --git a/tests/data/pdf_with_text_layer/article.pdf b/tests/data/pdf_with_text_layer/article.pdf
new file mode 100644
index 00000000..6c74f192
Binary files /dev/null and b/tests/data/pdf_with_text_layer/article.pdf differ