The following pages link to Martin Edward Hellman (Q3661463):
Displaying 37 items.
- Fast Computation of Discrete Logarithms in GF (q) (Q3661465) (← links)
- Time-memory-processor trade-offs (Q3796743) (← links)
- CHOSEN-KEY ATTACKS ON A BLOCK CIPHER (Q3801468) (← links)
- New directions in cryptography (Q3875826) (← links)
- A cryptanalytic time-memory trade-off (Q3877553) (← links)
- The largest super-increasing subset of a random set (Q3966045) (← links)
- (Q3967472) (← links)
- (Q4043996) (← links)
- Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.) (Q4054512) (← links)
- On tree coding with a fidelity criterion (Q4065429) (← links)
- Convolutional source encoding (Q4073263) (← links)
- (Q4074803) (← links)
- Concerning a bound on undetected error probability (Corresp.) (Q4081131) (← links)
- Optimal finite memory learning algorithms for the finite sample problem (Q4098493) (← links)
- Bistable Behavior of ALOHA-Type Systems (Q4117719) (← links)
- Error Detection in the Presence of Synchronization Loss (Q4119088) (← links)
- A note on Wyner's wiretap channel (Corresp.) (Q4124743) (← links)
- (Q4128696) (← links)
- An extension of the Shannon theory approach to cryptography (Q4137085) (← links)
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.) (Q4154061) (← links)
- The Gaussian wire-tap channel (Q4165281) (← links)
- On secret sharing systems (Q4739795) (← links)
- (Q4766067) (← links)
- (Q4770893) (← links)
- (Q4940676) (← links)
- (Q5075306) (← links)
- The two-armed-bandit problem with time-invariant finite memory (Q5588999) (← links)
- Learning with Finite Memory (Q5595657) (← links)
- Finite-memory hypothesis testing--Comments on a critique (Corresp.) (Q5604285) (← links)
- The Nearest Neighbor Classification Rule with a Reject Option (Q5604289) (← links)
- Probability of error, equivocation, and the Chernoff bound (Q5623071) (← links)
- On Memory Saved by Randomization (Q5623095) (← links)
- The effects of randomization on finite-memory decision schemes (Q5646235) (← links)
- Hypothesis testing with finite memory in finite time (Corresp.) (Q5649834) (← links)
- A confidence model for finite-memory learning systems (Corresp.) (Q5661023) (← links)
- (Q5677086) (← links)
- Hiding information and signatures in trapdoor knapsacks (Q5864294) (← links)
