Gaglione, Anthony M.
Overview
Works:  7 works in 8 publications in 1 language and 8 library holdings 

Roles:  Compiler, Author 
Publication Timeline
.
Most widely held works by
Anthony M Gaglione
Some complexity theory for cryptography by Anthony M Gaglione(
Book
)
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
This report concerns some of the elementary concepts in complexity theory. In particular, a mathematical model is developed for a finitestate machine and the Turing machine. This model has applications to public key cryptosystems, in determining which problems are P, NP, or NPC. The report was written to be as accessible to the nonspecialist as possible
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
This report concerns some of the elementary concepts in complexity theory. In particular, a mathematical model is developed for a finitestate machine and the Turing machine. This model has applications to public key cryptosystems, in determining which problems are P, NP, or NPC. The report was written to be as accessible to the nonspecialist as possible
Aspects of Infinite Groups: A Festschrift in Honor of Anthony Gaglione (Algebra and Discrete Mathematics) by
Gerhard Rosenberger(
Book
)
1 edition published in 2008 in English and held by 1 WorldCat member library worldwide
1 edition published in 2008 in English and held by 1 WorldCat member library worldwide
The contest problem book 4: annual high school mathematics examinations(
Book
)
1 edition published in 1982 in English and held by 1 WorldCat member library worldwide
1 edition published in 1982 in English and held by 1 WorldCat member library worldwide
Information Theory and Public Key Cryptosystems(
Book
)
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
Shannon has defined the unicity distance of a random cipher as the point where there is no uncertainty over which key was used for enciphering. The unicity distance is given as a value N where N = cryptogram length in characters. The usual issue for classical cryptography is: given ciphertext (and possibly corresponding plaintext) under the assumption of a random cipher, is this information sufficient on the average to determine the key. Here, if we let M denote the random variable (defined as the number of keys that will decipher a given intercepted cryptogram into a meaningful message), it turns out that M has a binomial distribution. Meyer and Matyas have expanded Shannon's approach to unicity distance by using information theory. They make no assumption about the distribution of M so their approach applies to cryptosystems in general. This paper applies this method to public key cryptography. In particular, we consider the RSA (RivestShamirAdelman) cryptosystem which is probably the most widely known public key system. The motivation for this work was to investigate the complexity of RSA. No new research has been conducted into the information theoretic approach to cryptosystem security since Shannon's work. This report shows that the present state of this theory is inadequate to handle public key cryptosystems like the RSA system. It is hoped that with further research on this topic (e.g., with making proper assumptions), the information theoretic approach can be made to at least give some kind of theoretical bound for the security of public key systems
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
Shannon has defined the unicity distance of a random cipher as the point where there is no uncertainty over which key was used for enciphering. The unicity distance is given as a value N where N = cryptogram length in characters. The usual issue for classical cryptography is: given ciphertext (and possibly corresponding plaintext) under the assumption of a random cipher, is this information sufficient on the average to determine the key. Here, if we let M denote the random variable (defined as the number of keys that will decipher a given intercepted cryptogram into a meaningful message), it turns out that M has a binomial distribution. Meyer and Matyas have expanded Shannon's approach to unicity distance by using information theory. They make no assumption about the distribution of M so their approach applies to cryptosystems in general. This paper applies this method to public key cryptography. In particular, we consider the RSA (RivestShamirAdelman) cryptosystem which is probably the most widely known public key system. The motivation for this work was to investigate the complexity of RSA. No new research has been conducted into the information theoretic approach to cryptosystem security since Shannon's work. This report shows that the present state of this theory is inadequate to handle public key cryptosystems like the RSA system. It is hoped that with further research on this topic (e.g., with making proper assumptions), the information theoretic approach can be made to at least give some kind of theoretical bound for the security of public key systems
The contest problem book(
Book
)
1 edition published in 1961 in English and held by 1 WorldCat member library worldwide
1 edition published in 1961 in English and held by 1 WorldCat member library worldwide
The contest problem IV : annual high school examinations, 19731982 by
Ralph A Artino(
Book
)
1 edition published in 1982 in English and held by 1 WorldCat member library worldwide
1 edition published in 1982 in English and held by 1 WorldCat member library worldwide
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Artino, Ralph A. Compiler Author
 Shell, Niel Compiler
 NAVAL RESEARCH LAB WASHINGTON DC
 Spellman, Dennis
 Rosenberger, Gerhard Author
 Naval Research Laboratory (U.S.)
 Fine, Benjamin
Associated Subjects