Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarBurton S. Kaliski Jr.
Burton Stephen Kaliski Jr. – Burt Kaliski
Person information
- affiliation: Verisign, Reston, Virginia, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[i16]Burton S. Kaliski Jr.:
A Quantum "Magic Box" for the Discrete Logarithm Problem. IACR Cryptology ePrint Archive 2017: 745 (2017)- [i15]Kathleen M. Moriarty, Burt Kaliski, Andreas Rusch:
PKCS #5: Password-Based Cryptography Specification Version 2.1. RFC 8018: 1-40 (2017) - 2016
- [i14]Kathleen M. Moriarty, Burt Kaliski, Jakob Jonsson, Andreas Rusch:
PKCS #1: RSA Cryptography Specifications Version 2.2. RFC 8017: 1-78 (2016) - 2012
- [j9]Noa Agmon, Vikas Agrawal, David W. Aha, Yiannis Aloimonos, Donagh Buckley, Prashant Doshi, Christopher W. Geib, Floriana Grasso, Nancy Green, Benjamin Johnston, Burt Kaliski, Christopher Kiekintveld, Edith Law, Henry Lieberman, Ole J. Mengshoel, Ted Metzler, Joseph Modayil, Douglas W. Oard, Nilufer Onder, Barry O'Sullivan, Katerina Pastra, Doina Precup, Sowmya Ramachandran, Chris Reed, Sanem Sariel Talay, Ted Selker, Lokendra Shastri, Stephen F. Smith, Satinder P. Singh, Siddharth Srivastava, Gita Sukthankar, David C. Uthus, Mary-Anne Williams:
Reports of the AAAI 2011 Conference Workshops. AI Magazine 33(1) (2012) - [c25]Burton Stephen Kaliski Jr.:
Revisiting DNS and WHOIS in the cloud era. CCSW 2012: 95-96 - 2011
- [r79]Burt Kaliski:
Asymmetric Cryptosystem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 49-50 - [r78]Burt Kaliski:
Berlekamp Q-matrix. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 79 - [r77]Burt Kaliski:
Binomial Distribution. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 86 - [r76]Burt Kaliski:
Blum Integer. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 159-160 - [r75]Burt Kaliski:
Claw-Free. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 209-210 - [r74]Burt Kaliski:
Decryption Exponent. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 322 - [r73]Burt Kaliski:
Encryption Exponent. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 417 - [r72]Burt Kaliski:
Euler's Totient Function. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 430 - [r71]Burt Kaliski:
Exponential Time. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 434 - [r70]Burt Kaliski:
Extension Field. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 436 - [r69]Burt Kaliski:
Factor Base. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 444 - [r68]Burt Kaliski:
Field. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 458 - [r67]Burt Kaliski:
Finite Field. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 468 - [r66]Burt Kaliski:
Generator. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 510 - [r65]Burt Kaliski:
Group. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 519-520 - [r64]Burt Kaliski:
Hard-Core Bit. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 534-535 - [r63]Burt Kaliski:
Homomorphism. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 562 - [r62]Burt Kaliski:
Irreducible Polynomial. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 646 - [r61]Burt Kaliski:
Jacobi Symbol. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 655 - [r60]Burt Kaliski:
Legendre Symbol. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 716 - [r59]Burt Kaliski:
MIPS-Year. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 785-786 - [r58]Burt Kaliski:
Moore's Law. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 803 - [r57]Burt Kaliski:
Number Field. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 861 - [r56]Burt Kaliski:
O-Notation. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 881-882 - [r55]Burt Kaliski:
Order. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 890-891 - [r54]Burt Kaliski:
Polynomial Time. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 948-949 - [r53]Burt Kaliski:
Primitive Element. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 965 - [r52]Burt Kaliski:
Pseudorandom Function. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 995 - [r51]Burt Kaliski:
Quadratic Residue. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1003 - [r50]Burt Kaliski:
Quadratic Residuosity Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1003 - [r49]Burt Kaliski:
Relatively Prime. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1041 - [r48]Burt Kaliski:
Ring. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1049-1050 - [r47]Burt Kaliski:
RSA Digital Signature Scheme. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1061-1064 - [r46]Burt Kaliski:
RSA Factoring Challenge. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1064-1065 - [r45]Ronald L. Rivest, Burt Kaliski:
RSA Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1065-1069 - [r44]Burt Kaliski:
Sieving. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1205 - [r43]Burt Kaliski:
Subexponential Time. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1267 - [r42]Burt Kaliski:
Subgroup. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1267 - [r41]Burt Kaliski:
Symmetric Cryptosystem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1271 - 2010
- [c24]Burton S. Kaliski Jr., Wayne Pauley:
Toward Risk Assessment as a Service in Cloud Environments. HotCloud 2010 - [p1]Jeffrey M. Nick, David Cohen, Burton S. Kaliski Jr.:
Key Enabling Technologies for Virtual Private Clouds. Handbook of Cloud Computing 2010: 47-63 - [i13]Randall J. Atkinson, Burt Kaliski, John G. Brainard, Sean Turner:
Use of the RSA-KEM Key Transport Algorithm in the Cryptographic Message Syntax (CMS). RFC 5990: 1-27 (2010)
2000 – 2009
- 2008
- [i12]Burt Kaliski:
Public-Key Cryptography Standards (PKCS) #8: Private-Key Information Syntax Specification Version 1.2. RFC 5208: 1-8 (2008) - 2007
- [c23]Ari Juels, Burton S. Kaliski Jr.:
Pors: proofs of retrievability for large files. ACM Conference on Computer and Communications Security 2007: 584-597 - 2005
- [c22]Michael Szydlo, Burton S. Kaliski Jr.:
Proofs for Two-Server Password Authentication. CT-RSA 2005: 227-244 - [r40]Burton S. Kaliski Jr.:
Asymmetric Cryptosystem. Encyclopedia of Cryptography and Security 2005 - [r39]Burton S. Kaliski Jr.:
Berlekamp Q-matrix. Encyclopedia of Cryptography and Security 2005 - [r38]Burton S. Kaliski Jr.:
Binomial Distribution. Encyclopedia of Cryptography and Security 2005 - [r37]Burton S. Kaliski Jr.:
Blum Integer. Encyclopedia of Cryptography and Security 2005 - [r36]Burton S. Kaliski Jr.:
Claw-Free. Encyclopedia of Cryptography and Security 2005 - [r35]Burton S. Kaliski Jr.:
Decryption Exponent. Encyclopedia of Cryptography and Security 2005 - [r34]Burton S. Kaliski Jr.:
Encryption Exponent. Encyclopedia of Cryptography and Security 2005 - [r33]Burton S. Kaliski Jr.:
Euler's Totient Function. Encyclopedia of Cryptography and Security 2005 - [r32]Burton S. Kaliski Jr.:
Exponential Time. Encyclopedia of Cryptography and Security 2005 - [r31]Burton S. Kaliski Jr.:
Extension Field. Encyclopedia of Cryptography and Security 2005 - [r30]Burton S. Kaliski Jr.:
Factor Base. Encyclopedia of Cryptography and Security 2005 - [r29]Burton S. Kaliski Jr.:
Field. Encyclopedia of Cryptography and Security 2005 - [r28]Burton S. Kaliski Jr.:
Field Polynomial. Encyclopedia of Cryptography and Security 2005 - [r27]Burton S. Kaliski Jr.:
Finite Field. Encyclopedia of Cryptography and Security 2005 - [r26]Burton S. Kaliski Jr.:
Generator. Encyclopedia of Cryptography and Security 2005 - [r25]Burton S. Kaliski Jr.:
Group. Encyclopedia of Cryptography and Security 2005 - [r24]Burton S. Kaliski Jr.:
Hard-Core Bit. Encyclopedia of Cryptography and Security 2005 - [r23]Burton S. Kaliski Jr.:
Homomorphism. Encyclopedia of Cryptography and Security 2005 - [r22]Burton S. Kaliski Jr.:
Irreducible Polynomial. Encyclopedia of Cryptography and Security 2005 - [r21]Burton S. Kaliski Jr.:
Jacobi Symbol. Encyclopedia of Cryptography and Security 2005 - [r20]Burton S. Kaliski Jr.:
Legendre Symbol. Encyclopedia of Cryptography and Security 2005 - [r19]Burton S. Kaliski Jr.:
MIPS-Year. Encyclopedia of Cryptography and Security 2005 - [r18]Burton S. Kaliski Jr.:
Moore's Law. Encyclopedia of Cryptography and Security 2005 - [r17]Burton S. Kaliski Jr.:
Number Field. Encyclopedia of Cryptography and Security 2005 - [r16]Burton S. Kaliski Jr.:
O-Notation. Encyclopedia of Cryptography and Security 2005 - [r15]Burton S. Kaliski Jr.:
Primitive Element. Encyclopedia of Cryptography and Security 2005 - [r14]Burton S. Kaliski Jr.:
Pseudorandom Function. Encyclopedia of Cryptography and Security 2005 - [r13]Burton S. Kaliski Jr.:
Quadratic Residue. Encyclopedia of Cryptography and Security 2005 - [r12]Burton S. Kaliski Jr.:
Quadratic Residuosity Problem. Encyclopedia of Cryptography and Security 2005 - [r11]Burton S. Kaliski Jr.:
Relatively Prime. Encyclopedia of Cryptography and Security 2005 - [r10]Burton S. Kaliski Jr.:
Ring. Encyclopedia of Cryptography and Security 2005 - [r9]Burton S. Kaliski Jr.:
RSA Digital Signature Scheme. Encyclopedia of Cryptography and Security 2005 - [r8]Burton S. Kaliski Jr.:
RSA factoring challenge. Encyclopedia of Cryptography and Security 2005 - [r7]Burton S. Kaliski Jr.:
Sieving. Encyclopedia of Cryptography and Security 2005 - [r6]Burton S. Kaliski Jr.:
Subexponential Time. Encyclopedia of Cryptography and Security 2005 - [r5]Burton S. Kaliski Jr.:
Subgroup. Encyclopedia of Cryptography and Security 2005 - [r4]Burton S. Kaliski Jr.:
Symmetric Cryptosystem. Encyclopedia of Cryptography and Security 2005 - [r3]Burton S. Kaliski Jr.:
Order. Encyclopedia of Cryptography and Security 2005 - [r2]Burton S. Kaliski Jr.:
Polynomial Time. Encyclopedia of Cryptography and Security 2005 - [r1]Ronald L. Rivest, Burton S. Kaliski Jr.:
RSA Problem. Encyclopedia of Cryptography and Security 2005 - [i11]Jim Schaad, Burt Kaliski, Russ Housley:
Additional Algorithms and Identifiers for RSA Cryptography for use in the Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC 4055: 1-25 (2005) - 2004
- [c21]Burt Kaliski:
RFID Privacy: Challenges and Progress. ISSE 2004: 108-116 - 2003
- [c20]John G. Brainard, Ari Juels, Burt Kaliski, Michael Szydlo:
A New Two-Server Approach for Authentication with Short Secrets. USENIX Security Symposium 2003 - [e2]Burton S. Kaliski Jr., Çetin Kaya Koç, Christof Paar:
Cryptographic Hardware and Embedded Systems - CHES 2002, 4th International Workshop, Redwood Shores, CA, USA, August 13-15, 2002, Revised Papers. Lecture Notes in Computer Science 2523, Springer 2003, ISBN 3-540-00409-2 [contents] - [i10]Jakob Jonsson, Burt Kaliski:
Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1. RFC 3447: 1-72 (2003) - 2002
- [c19]Jakob Jonsson, Burton S. Kaliski Jr.:
On the Security of RSA Encryption in TLS. CRYPTO 2002: 127-142 - [c18]Burton S. Kaliski Jr.:
On Hash Function Firewalls in Signature Schemes. CT-RSA 2002: 1-16 - 2001
- [j8]Burton S. Kaliski Jr.:
An unknown key-share attack on the MQV key agreement protocol. ACM Trans. Inf. Syst. Secur. 4(3): 275-288 (2001) - 2000
- [c17]Warwick Ford, Burton S. Kaliski Jr.:
Server-Assisted Generation of a Strong Secret from a Password. WETICE 2000: 176-180 - [i9]Burt Kaliski:
PKCS #5: Password-Based Cryptography Specification Version 2.0. RFC 2898: 1-34 (2000) - [i8]Magnus Nyström, Burt Kaliski:
PKCS #9: Selected Object Classes and Attribute Types Version 2.0. RFC 2985: 1-42 (2000) - [i7]Magnus Nyström, Burt Kaliski:
PKCS #10: Certification Request Syntax Specification Version 1.7. RFC 2986: 1-14 (2000)
1990 – 1999
- 1999
- [c16]Burton S. Kaliski Jr., Moses D. Liskov:
Efficient Finite Field Basis Conversion Involving Dual Bases. CHES 1999: 135-143 - 1998
- [c15]Burton S. Kaliski Jr.:
Emerging Standards for Public-Key Cryptography. Lectures on Data Security 1998: 87-104 - [c14]Burton S. Kaliski Jr.:
ECC/DLP and Fractoring-Based Cryptography: A Tale of Two Families (Abstract). ASIACRYPT 1998: 50 - [c13]Burton S. Kaliski Jr., Yiqun Lisa Yin:
Storage-Efficient Finite Field Basis Conversion. Selected Areas in Cryptography 1998: 81-93 - [i6]Burt Kaliski:
PKCS #1: RSA Encryption Version 1.5. RFC 2313: 1-19 (1998) - [i5]Burt Kaliski:
PKCS #10: Certification Request Syntax Version 1.5. RFC 2314: 1-8 (1998) - [i4]Burt Kaliski:
PKCS #7: Cryptographic Message Syntax Version 1.5. RFC 2315: 1-32 (1998) - [i3]Burt Kaliski, Jessica Staddon:
PKCS #1: RSA Cryptography Specifications Version 2.0. RFC 2437: 1-39 (1998) - 1997
- [j7]Burton S. Kaliski Jr.:
A Chosen Message Attack on Demytko's Elliptic Curve Cryptosystem. J. Cryptology 10(1): 71-72 (1997) - [e1]Burton S. Kaliski Jr.:
Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings. Lecture Notes in Computer Science 1294, Springer 1997, ISBN 3-540-63384-7 [contents] - 1996
- [j6]Mahdi Abdelguerfi, Burton S. Kaliski Jr., Wayne Patterson:
Guest Editors' Introduction: Public-Key Security Systems. IEEE Micro 16(3): 10-13 (1996) - [j5]Çetin Kaya Koç, Tolga Acar, Burton S. Kaliski Jr.:
Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3): 26-33 (1996) - [c12]Burton S. Kaliski Jr.:
IEEE P1363: A Standard for RSA, Diffie-Hellman, and Elliptic-Curve Cryptography (Abstract). Security Protocols Workshop 1996: 117-118 - 1995
- [j4]Burton S. Kaliski Jr.:
The Montgomery Inverse and Its Applications. IEEE Trans. Computers 44(8): 1064-1065 (1995) - [c11]Burton S. Kaliski Jr., Yiqun Lisa Yin:
On Differential and Linear Crytoanalysis of the RC5 Encryption Algorithm. CRYPTO 1995: 171-184 - 1994
- [c10]Burton S. Kaliski Jr., Matthew J. B. Robshaw:
Linear Cryptanalysis Using Multiple Approximations. CRYPTO 1994: 26-39 - [c9]Burton S. Kaliski Jr., Matthew J. B. Robshaw:
Linear Cryptanalysis Using Multiple Approximations and FEAL. FSE 1994: 249-264 - 1993
- [j3]Burt Kaliski:
A survey of encryption standards. IEEE Micro 13(6): 74-81 (1993) - [c8]Burton S. Kaliski Jr., Matthew J. B. Robshaw:
Fast Block Cipher Proposal. FSE 1993: 33-40 - [i2]Burton S. Kaliski Jr.:
Privacy Enhancement for Internet Electronic Mail: Part IV: Key Certification and Related Services. RFC 1424: 1-9 (1993) - 1992
- [i1]Burton S. Kaliski Jr.:
The MD2 Message-Digest Algorithm. RFC 1319: 1-17 (1992) - 1991
- [j2]Burton S. Kaliski Jr.:
One-Way Permutations on Elliptic Curves. J. Cryptology 3(3): 187-199 (1991) - 1990
- [c7]Stephen R. Dussé, Burton S. Kaliski Jr.:
A Cryptographic Library for the Motorola DSP56000. EUROCRYPT 1990: 230-244 - [c6]Burton S. Kaliski Jr.:
The MD4 Message Digest Algorithm (Abstract). EUROCRYPT 1990: 492
1980 – 1989
- 1988
- [b1]Burton Stephen Kaliski Jr.:
Elliptic curves and cryptography: a pseudorandom bit generator and other tools. Massachusetts Institute of Technology, Cambridge, MA, USA, 1988 - [j1]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman:
Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES). J. Cryptology 1(1): 3-36 (1988) - 1986
- [c5]Burton S. Kaliski Jr.:
A Pseudo-Random Bit Generator Based on Elliptic Logarithms. CRYPTO 1986: 84-103 - 1985
- [c4]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman:
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES). CRYPTO 1985: 212-226 - [c3]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman:
Is the Data Encryption Standard a Group? (Preliminary Abstract). EUROCRYPT 1985: 81-95 - 1984
- [c2]Burton S. Kaliski Jr.:
Wyner's Analog Encryption Scheme: Results of a Simulation. CRYPTO 1984: 83-94 - 1983
- [c1]Joseph R. Fisher, Martin E. Kaliski, Burton S. Kaliski Jr.:
A new level of signal processing software: Automatic buffer address generation. ICASSP 1983: 1180-1183
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.