Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Time constant”

Time Constant

Robert F. Schmidt, William D. Willis · 2006

Cited by 0

Constant‐Time Implementations

Thomas Pornin · 2025

Timing attacks are a class of side-channel attacks that rely on time measurements. A particular implementation of an algorithm is said to be constant-time if it is inherently immune to timing attacks in that extended meaning. A constant-time implementation does not necessarily execute in a constant amount of time. It provides immunity to the whole class of timing attacks. Any constant-time implementation will rely on elementary constructs that implement some primitive operations in a constant-time way. This chapter shows how some commonly used primitives can be implemented. It presents some constant-time implementations of a few elementary operations that occur in cryptographic algorithms. The chapter also explores explore some classic algorithms that use constant-time implementation techniques to provide constant-time functionalities.

Cited by 0Open access

Time Constant (τ)

William G. Cioffi, Michael D. Connolly, Charles A. Adams et al. · 2012

Cited by 0

Time constant estimation.

Lakshitha P. Wijesinghe (10777036), Melville J. Wohlgemuth (3109992), Richard H. Y. So (10777039) et al. · Figshare · 2021

<p>The figure shows the target elevation in the head-centric coordinates (blue dot), with the least squares fitting (blue line) of the step response s(<i>t</i>) = A<i>e</i><sup>−<i>t</i>/<i>τ</i></sup> + B. For the illustrated example, A = -89.90 deg, B = 0.74 deg and <i>τ</i> = 2.46 iteration.</p> <p>(EPS)</p>

Cited by 0Open access

Constant-Time Approximation . . .

Huy N. Nguyen, et al. · 2009

We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applicable to a certain subclass of algorithms that compute a solution in a constant number of phases. The technique is based on greedily considering local improvements in random order. The problems amenable to our technique include

Cited by 0

Effective Time Constant

Laurent Simon · 2013

This chapter contains sections titled: Linear Second-Order ODEs Sturm–Liouville (SL) Eigenvalue Problems Relaxation Time Constant Implementation in Mathematica® Controlled-Release Devices Summary Problems References

Cited by 0

Real-Time, Constant-Space, Constant-Randomness Verifiers

Dolu, Özdeniz, Ersoy, Nevzat, Gezer, M. Utkan et al. · arXiv (Cornell University) · 2022

We study the class of languages that have membership proofs which can be verified by real-time finite-state machines using only a constant number of random bits, regardless of the size of their inputs. Since any further restriction on the verifiers would preclude the verification of nonregular languages, this is the tightest computational budget which allows the checking of externally provided proofs to have meaningful use. We show that all languages that can be recognized by two-head one-way deterministic finite automata have such membership proofs. For any $k>0$, there exist languages that cannot be recognized by any $k$-head one-way nondeterministic finite automaton, but that are nonetheless real-time verifiable in this sense. The set of nonpalindromes, which cannot be recognized by any one-way multihead deterministic finite automaton, is also demonstrated to be verifiable within these restrictions.

Cited by 0Open access

Robust Constant-Time Cryptography

Matthew Kolosick, Basavesh Ammanaghatta Shivakumar, Sunjay Cauligi et al. · Proceedings of the ACM on Programming Languages · 2025

Cryptographic library developers take care to ensure their library does not leak secrets even when there are (inevitably) exploitable vulnerabilities in the applications the library is linked against. To do so, they choose some class of application vulnerabilities to defend against and hardcode protections against those vulnerabilities in the library code. A single set of choices is a poor fit for all contexts: a chosen protection could impose unnecessary overheads in contexts where those attacks are impossible, and an ignored protection could render the library insecure in contexts where the attack is feasible. We introduce RoboCop, a new methodology and toolchain for building secure and efficient applications from cryptographic libraries, via four contributions. First, we present an operational semantics that describes the behavior of a (cryptographic) library executing in the context of a potentially vulnerable application so that we can precisely specify what different attackers can observe. Second, we use our semantics to define a novel security property, Robust Constant Time (RCT), that defines when a cryptographic library is secure in the context of a vulnerable application. Crucially, our definition is parameterized by an attacker model, allowing us to factor out the classes of attackers that a library may wish to secure against. This refactoring yields our third contribution: a compiler that can synthesize bespoke cryptographic libraries with security tailored to the specific application context against which the library will be linked, guaranteeing that the library is RCT in that context. Finally, we present an empirical evaluation that shows the RoboCop compiler can automatically generate code to efficiently protect a wide range (over 500) of cryptographic library primitives against three classes of attacks: read gadgets (due to application memory safety vulnerabilities), speculative read gadgets (due to application speculative execution vulnerabilities), and concurrent observations (due to application threads), with performance overhead generally under 2% for protections from read gadgets and under 4% for protections from speculative read gadgets, thus freeing library developers from making one-size-fits-all choices between security and performance.

Cited by 0Open access

Constant time access trajectories

Brandón, Adrián · Figshare · 2020

Datasets and software from the publication Constant time access trajectories

Cited by 0Open access

Constant time bilateral filtering

Facciolo, Gabriele · Figshare · 2013

A presentation for the GTTI group of Porikli's CVPR'08 paper about efficient approximations of bilateral filtering: "Constant time O(1) bilateral filtering".

Cited by 0Open access