Martin E. Hellman

50 papers A* 6Journal 36Unranked 4

Year	Rank	Type	Title / Venue / Authors
2022	—	`ch.`	An Improved Algorithm for Computing Logarithms over Democratizing Cryptography Stephen C. Pohlig, Martin E. Hellman
2022	—	`ch.`	Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Democratizing Cryptography Whitfield Diffie, Martin E. Hellman
2022	—	`ch.`	New Directions in Cryptography. Democratizing Cryptography Whitfield Diffie, Martin E. Hellman
2022	—	`ch.`	Privacy and Authentication: An Introduction to Cryptography. Democratizing Cryptography Whitfield Diffie, Martin E. Hellman
2017	J	`jnl`	Cybersecurity, nuclear security, alan turing, and illogical logic. Commun. ACM Martin E. Hellman
2016	A*	`conf`	Cybersecurity, Nuclear Security, Alan Turing, and Illogical Logic. CCS Martin E. Hellman
2002	J	`jnl`	An overview of public key cryptography. IEEE Commun. Mag. Martin E. Hellman
1994	A*	`conf`	Differential-Linear Cryptanalysis. CRYPTO Susan K. Langford, Martin E. Hellman
1992	J	`jnl`	Responses to NIST's Proposal. Commun. ACM Ronald L. Rivest, Martin E. Hellman, John C. Anderson, John W. Lyons
1988	J	`jnl`	Time-memory-processor trade-offs. IEEE Trans. Inf. Theory Hamid R. Amirazizi, Martin E. Hellman
1987	J	`jnl`	Chosen-Key Attacks on a Block Cipher. Cryptologia Robert S. Winternitz, Martin E. Hellman
1987	J	`jnl`	Commercial encryption. IEEE Netw. Martin E. Hellman
1983	J	`jnl`	On secret sharing systems. IEEE Trans. Inf. Theory Ehud D. Karnin, J. W. Greene, Martin E. Hellman
1983	J	`jnl`	On the necessity of cryptanalytic exhaustive search. SIGACT News Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri
1983	J	`jnl`	The largest super-increasing subset of a random set. IEEE Trans. Inf. Theory Ehud D. Karnin, Martin E. Hellman
1983	J	`jnl`	Time-memory-processor tradeoffs. SIGACT News Hamid R. Amirazizi, Martin E. Hellman
1982	—	`conf`	Cryptographic Key Size Issues. COMPCON Martin E. Hellman
1982	A*	`conf`	Drainage and the DES. CRYPTO Martin E. Hellman, Justin M. Reyneri
1982	A*	`conf`	Fast Computation of Discrete Logarithms in GF(q). CRYPTO Martin E. Hellman, Justin M. Reyneri
1981	J	`jnl`	Another Cryptanalytic Attack on 'A Cryptosystem for Multiple Communication'. Inf. Process. Lett. Martin E. Hellman
1981	A*	`conf`	On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. CRYPTO Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri
1981	J	`jnl`	On the Security of Multiple Encryption. Commun. ACM Ralph C. Merkle, Martin E. Hellman
1981	A*	`conf`	Time-Memory-Processor Tradeoffs. CRYPTO Hamid R. Amirazizi, Martin E. Hellman
1980	J	`jnl`	A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory Martin E. Hellman
1980	—	`conf`	On the Difficulty of Computing Logarithms Over GF(q S&P Martin E. Hellman
1979	J	`jnl`	Convolutional encoding for Wyner's wiretap channel (Corresp.). IEEE Trans. Inf. Theory Erik I. Verriest, Martin E. Hellman
1978	J	`jnl`	An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.). IEEE Trans. Inf. Theory Stephen C. Pohlig, Martin E. Hellman
1978	J	`jnl`	Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inf. Theory Ralph C. Merkle, Martin E. Hellman
1978	—	`conf`	Security in communication networks. AFIPS National Computer Conference Martin E. Hellman
1978	J	`jnl`	The Gaussian wire-tap channel. IEEE Trans. Inf. Theory Sik K. Leung-Yan-Cheong, Martin E. Hellman
1977	J	`jnl`	A note on Wyner's wiretap channel (Corresp.). IEEE Trans. Inf. Theory Aydano B. Carleial, Martin E. Hellman
1977	J	`jnl`	An extension of the Shannon theory approach to cryptography. IEEE Trans. Inf. Theory Martin E. Hellman
1977	J	`jnl`	Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Computer Whitfield Diffie, Martin E. Hellman
1976	J	`jnl`	Concerning a bound on undetected error probability (Corresp.). IEEE Trans. Inf. Theory Sik K. Leung-Yan-Cheong, Martin E. Hellman
1976	—	`conf`	Multiuser cryptographic techniques. AFIPS National Computer Conference Whitfield Diffie, Martin E. Hellman
1976	J	`jnl`	New directions in cryptography. IEEE Trans. Inf. Theory Whitfield Diffie, Martin E. Hellman
1976	J	`jnl`	Optimal Finite Memory Learning Algorithms for the Finite Sample Problem Inf. Control. Thomas M. Cover, Michael A. Freedman, Martin E. Hellman
1975	J	`jnl`	Bistable Behavior of ALOHA-Type Systems. IEEE Trans. Commun. Aydano B. Carleial, Martin E. Hellman
1975	J	`jnl`	Convolutional source encoding. IEEE Trans. Inf. Theory Martin E. Hellman
1975	J	`jnl`	Error Detection in the Presence of Synchronization Loss. IEEE Trans. Commun. Martin E. Hellman
1975	J	`jnl`	On tree coding with a fidelity criterion. IEEE Trans. Inf. Theory Charles R. Davis, Martin E. Hellman
1974	J	`jnl`	Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.). IEEE Trans. Inf. Theory Martin E. Hellman
1974	J	`jnl`	On Using Natural Redundancy for Error Detection. IEEE Trans. Commun. Martin E. Hellman
1972	J	`jnl`	A confidence model for finite-memory learning systems (Corresp.). IEEE Trans. Inf. Theory John A. Horos, Martin E. Hellman
1972	J	`jnl`	Hypothesis testing with finite memory in finite time (Corresp.). IEEE Trans. Inf. Theory Richard A. Flower, Martin E. Hellman
1972	J	`jnl`	The effects of randomization on finite-memory decision schemes. IEEE Trans. Inf. Theory Martin E. Hellman
1970	J	`jnl`	Finite-memory hypothesis testing-Comments on a critique (Corresp.). IEEE Trans. Inf. Theory Thomas M. Cover, Martin E. Hellman
1970	J	`jnl`	Probability of error, equivocation, and the Chernoff bound. IEEE Trans. Inf. Theory Martin E. Hellman, Josef Raviv
1970	J	`jnl`	The Nearest Neighbor Classification Rule with a Reject Option. IEEE Trans. Syst. Sci. Cybern. Martin E. Hellman
1970	J	`jnl`	The two-armed-bandit problem with time-invariant finite memory. IEEE Trans. Inf. Theory Thomas M. Cover, Martin E. Hellman