Physical Sciences and Mathematics Commons^™

Optimal Cryptographic Hardness Of Learning Monotone Functions, Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee

Publications and Research

Over the years a range of positive algorithmic results have been obtained for learning various classes of monotone Boolean functions from uniformly distributed random examples. Prior to our work, however, the only negative result for learning monotone functions in this model has been an information-theoretic lower bound showing that certain super-polynomial-size monotone circuits cannot be learned to accuracy 1/2+w(log n/ p n) (Blum, Burch, and Langford, FOCS’98). This is in contrast with the situation for nonmonotone functions, where a wide range of cryptographic hardness results establish that various “simple” classes of polynomial-size circuits are not learnable by polynomial-time algorithms.

In …

Networks - Ii: Development Of Symmetric Cryptosystem Using Matrices With Less Overhead On Communication Channel, Jalal F. Al-Muhtadi, Abdul Basit, Maqsood Mahmud

International Conference on Information and Communication Technologies

Many systems have been developed by mathematicians using symmetric and Asymmetric Cryptography e.g. Ceaser Cipher, Stream Ciphers, RSA, DES, IDEA, RC-4, ElGamal signatures, LFSR, Ext. Euclidean Algorithm, Lamport Signatures, Merkle Hellman Knapsack. Etc [1]. Some of them are very strong to be broken by cryptanalysts. Some are very easy and even can be broken by the measuring the frequency of alphabets in a specific cipher text. All these system carries some overhead of key with which a plain text is encrypted, for the communication channel. I thought of an idea in which product component which will be 5*1 matrix will …

Networks - Ii: Overhead Analysis Of Security Implementation Using Ipsec, Muhammad Awais Azam, Zaka -Ul- Mustafa, Usman Tahir, S. M. Ahsan, Muhammad Adnan Naseem, Imran Rashid, Muhammad Adeel

International Conference on Information and Communication Technologies

Authentication, access control, encryption and auditing make up the essential elements of network security. Researchers have dedicated a large amount of efforts to implement security features that fully incorporate the use of all these elements. Currently, data networks mainly provide authentication and confidentiality services. Confidentiality alone is not able to protect the system, thus, suitable security measures must be taken. However, this security is itself an overhead which must be accounted for. A trade-off must exist between performance and security. This trade-off must be carefully managed so as not to deteriorate the systems being secured. This calls for the true …

Solvability Characterizations Of Pell Like Equations, Jason Smith

Boise State University Theses and Dissertations

Pell's equation has intrigued mathematicians for centuries. First stated as Archimedes' Cattle Problem, Pell's equation, in its most general form, X² – P • Y² = 1, where P is any square free positive integer and solutions are pairs of integers, has seen many approaches but few general solutions. The eleventh century Indian mathematician Bhaskara solved X² – 61 • Y² = 1 and, in response to Fermat's challenge, Wallis and Brouncker gave solutions to X² – 151 • Y² = 1 and X² –313 • Y² = 1. Fermat claimed to …

Statistical Investigation Of Structure In The Discrete Logarithm, Andrew Hoffman

Mathematical Sciences Technical Reports (MSTR)

The absence of an efficient algorithm to solve the Discrete Logarithm Problem is often exploited in cryptography. While exponentiation with a modulus is extremely fast with a modern computer, the inverse is decidedly not. At the present time, the best algorithms assume that the inverse mapping is completely random. Yet there is at least some structure, and to uncover additional structure that may be useful in constructing or refining algorithms, statistical methods are employed to compare modular exponential mappings to random mappings. More concretely, structure will be defined by representing the mappings as functional graphs and using parameters from graph …

Design And Performance Analysis Of A Secure Proces-Sor Scan-Sp With Crypto-Biometric Capabilities, Raghudeep Kannavara

Browse all Theses and Dissertations

Secure computing is gaining importance in recent times as computing capability is increasingly becoming distributed and information is everywhere. Prevention of piracy and digital rights management has become very important. Information security is mandatory rather than an additional feature. Numerous software techniques have been proposed to provide certain level of copyright and intellectual property protection. Techniques like obfuscation attempt to transform the code into a form that is harder to reverse engineer. Tamper-proofing causes a program to malfunction when it detects that it has been modified. Software watermarking embeds copyright notice in the software code to allow the owners of …

A Cryptanalysis Methodology For The Reverse Engineering Of Encrypted Information In Images, Allan Anthony Rwabutaza

Browse all Theses and Dissertations

Security is an important issue related to the storage and communication of data and information. In data and information security, cryptography and steganography are two of the most common security techniques. On one hand, there is cryptography, which is the secret communication between two parties by message scrambling on the sender's side and message unscrambling on the receiver's side so that only the intended receiver gets the secret message. On the other hand, there is steganography, which is the hiding of information in a medium in such a way that no one other than the sender or the intended receiver …