2. Principle of cryptography based on Euclidean lattices
The aim of this second part is to give the mathematical prerequisites needed to read the article, and then to define the difficult problems on which the security of cryptographic constructions will then be based.
2.1 Security in cryptography
Construction security is of course at the heart of cryptography, the first difficulty being to define it properly. There are many ways to define the security of a public-key cryptographic scheme. You need to define an attacker model (its capabilities in terms of computing time, computing power, memory, etc.), an attack context (what the attacker has access to), and an objective (the attacker's ultimate goal). This constitutes a security model, which should model real attacks as closely as possible. In general, we consider...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference
This article is included in
Security of information systems
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Principle of cryptography based on Euclidean lattices
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference