Concept
Degré d'une application
Publications associées (8)
New SIDH Countermeasures for a More Efficient Key Exchange
Tako Boris Fouotsa, Andrea Basso
The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a polynomial-time key-recovery attack. While some countermeasures have been proposed, th ...
Springer2023Global bifurcation at isolated singular points of the Hadamard derivative
Consider F is an element of C(RxX,Y) such that F(lambda, 0) = 0 for all lambda is an element of R, where X and Y are Banach spaces. Bifurcation from the line Rx{0} of trivial solutions is investigated in cases where F(lambda, center dot ) need not be Frech ...
2021Cryogenic CMOS Circuits and Systems: Challenges and Opportunities in Designing the Electronic Interface for Quantum Processors
Edoardo Charbon, Fabio Sebastiano
Quantum computing could potentially offer faster solutions for some of today's classically intractable problems using quantum processors as computational support for quantum algorithms [1]. Quantum processors, in the most frequent embodiment, comprise an a ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021Moment Semantics for Reversible Rule-Based Systems
We develop a notion of stochastic rewriting over marked graphs – i.e. directed multigraphs with degree constraints. The approach is based on double-pushout (DPO) graph rewriting. Marked graphs are expressive enough to internalize the ‘no-dangling-edge’ con ...
Springer International Publishing2015Polynomial-Time Computation Of Homotopy Groups And Postnikov Systems In Fixed Dimension
For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k >= 2, there is a polynomial-time algorithm that, for a 1-connected topological space X given as a f ...
Siam Publications2014Scenario-free stochastic programming with polynomial decision rules
Multi-stage stochastic programming provides a versatile framework for optimal decision making under uncertainty, but it gives rise to hard functional optimization problems since the adaptive recourse decisions must be modeled as functions of some or all un ...
IEEE2011Feedback topology and XOR-dynamics in Boolean networks with varying input structure
We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This ...
2009Prediction of resistive and hysteretic losses in a multi-layer high-Tc superconducting cable
Francesco Grilli, Marten Sjöström
In this work, a model of a multi-layer high-Tc superconducting (HTS) cable that computes the current distribution across layers as well as the AC loss is presented. Analyzed is the case of a four-layer cable, but the developed method can be applied to a ca ...
2004