Sökning: "Elena Dubrova"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Elena Dubrova.

1. 1. Integrated Logic Synthesis Using Simulated Annealing

   Författare :Petra Färm; Elena Dubrova; Michael Miller; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electrical engineering; electronics and photonics; Elektroteknik; elektronik och fotonik;

   Sammanfattning : A conventional logic synthesis flow is composed of three separate phases: technologyindependent optimization, technology mapping, and technology dependentoptimization. A fundamental problem with such a three-phased approach is thatthe global logic structure is decided during the first phase without any knowledge ofthe actual technology parameters considered during later phases. LÄS MER

3. 2. Improvements in High-Coverage and Low-Power LBIST

   Författare :Nan Li; Elena Dubrova; Krishnendu Chakrabarty; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : Testing cost is one of the major contributors to the manufacturing cost of integrated circuits. Logic Built-In Self Test (LBIST) offers test cost reduction in terms of using smaller and cheaper ATE, test data volume reduction due to on-chip test pattern generation, test time reduction due to at-speed test pattern application. LÄS MER

4. 3. Analysis and Synthesis of Boolean Networks

   Författare :Ming Liu; Elena Dubrova; Radomir Stankovic; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

   Sammanfattning : In this thesis, we present techniques and algorithms for analysis and synthesis of synchronous Boolean and multiple-valued networks.Synchronous Boolean and multiple-valued networks are a discrete-space discrete-time model of gene regulatory networks. LÄS MER

5. 4. Advances in Functional Decomposition: Theory and Applications

   Författare :Andrés Martinelli; Elena Dubrova; Jon Muzio; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; computer science; electronic system design; Boolean decomposition; binary decision diagram; logic synthesis; graph algorithm; Computer science; Datavetenskap;

   Sammanfattning : Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. LÄS MER

7. 5. Side-Channel Analysis of Post-Quantum Cryptographic Algorithms

   Författare :Kalle Ngo; Johnny Öberg; Ingo Sander; Elena Dubrova; Lejla Batina; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Side-channel attack; Post-quantum cryptography; Deep learning; LWE LWR-based KEM; Hardware security; Sidokanalsattack; Postkvantkryptering; Djupinlärning; LWE LWR-baserad KEM; Hårdvarusäkerhet; Informations- och kommunikationsteknik; Information and Communication Technology;

   Sammanfattning : Public key cryptographic schemes used today rely on the intractability of certain mathematical problems that are known to be efficiently solvable with a large-scale quantum computer. To address the need for long-term security, in 2016 NIST started a project for standardizing post-quantum cryptography (PQC) primitives that rely on problems not known to be targets for a quantum computer, such as lattice problems. LÄS MER