The Experts below are selected from a list of 45 Experts worldwide ranked by ideXlab platform

Richard B. Wells - One of the best experts on this subject based on the ideXlab platform.

  • IDAACS (2) - Breaking block and product ciphers applied across byte boundaries
    Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2011
    Co-Authors: Albert H. Carlson, Robert E. Hiromoto, Richard B. Wells
    Abstract:

    The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (Metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.

  • Breaking block and product ciphers applied across byte boundaries
    Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2011
    Co-Authors: Albert H. Carlson, Robert E. Hiromoto, Richard B. Wells
    Abstract:

    The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (Metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.

Albert H. Carlson - One of the best experts on this subject based on the ideXlab platform.

  • IDAACS (2) - Breaking block and product ciphers applied across byte boundaries
    Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2011
    Co-Authors: Albert H. Carlson, Robert E. Hiromoto, Richard B. Wells
    Abstract:

    The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (Metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.

  • Breaking block and product ciphers applied across byte boundaries
    Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2011
    Co-Authors: Albert H. Carlson, Robert E. Hiromoto, Richard B. Wells
    Abstract:

    The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (Metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.

Robert E. Hiromoto - One of the best experts on this subject based on the ideXlab platform.

  • IDAACS (2) - Breaking block and product ciphers applied across byte boundaries
    Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2011
    Co-Authors: Albert H. Carlson, Robert E. Hiromoto, Richard B. Wells
    Abstract:

    The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (Metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.

  • Breaking block and product ciphers applied across byte boundaries
    Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2011
    Co-Authors: Albert H. Carlson, Robert E. Hiromoto, Richard B. Wells
    Abstract:

    The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (Metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.

Tony Stubblebine - One of the best experts on this subject based on the ideXlab platform.

  • Regular expression pocket reference, 2nd edition
    2007
    Co-Authors: Tony Stubblebine
    Abstract:

    This handy little book offers programmers a complete overview of the syntax and semantics of regular expressions that are at the heart of every text-processing application. Ideal as a quick reference, Regular Expression Pocket Reference covers the regular expression APIs for Perl 5.8, Ruby (including some upcoming 1.9 features), Java, PHP, .NET and C#, Python, vi, JavaScript, and the PCRE regular expression libraries. This concise and easy-to-use reference puts a very powerful tool for manipulating text and data right at your fingertips. Composed of a mixture of symbols and text, regular expressions can be an outlet for creativity, for brilliant programming, and for the elegant solution. Regular Expression Pocket Reference offers an introduction to regular expressions, pattern matching, Metacharacters, modes and constructs, and then provides separate sections for each of the language APIs, with complete regex listings including: Supported Metacharacters for each language APIRegular expression classes and interfaces for Ruby, Java, .NET, and C#Regular expression operators for Perl 5.8Regular expression module objects and functions for PythonPattern-matching functions for PHP and the vi editorPattern-matching methods and objects for JavaScriptUnicode Support for each of the languages With plenty of examples and other resources, Regular Expression Pocket Reference summarizes the complex rules for performing this critical text-processing function, and presents this often-confusing topic in a friendly and well-organized format. This guide makes an ideal on-the-job companion.

Paul Genovesi - One of the best experts on this subject based on the ideXlab platform.

  • Learning SAS's Perl Regular Expression Matching the Easy Way: By Doing
    2015
    Co-Authors: Paul Genovesi
    Abstract:

    Abstract : Perl Regular Expression (PRX) functions were added in SAS9. The key to learning how to use them is learning PRX metacharacter behavior within a PRX match. The more you practice PRX matching, the more proficient you become. Ideally, practice would involve a method for repeating the matching process so as to see cause and effect between the input, in the form of modifications to the perl regular expression and/or the source string, and the output in the form of the match results. But just as important as the practice itself would be a method for logging your practice trail in a file for future reference and expansion as well as avoidance of wheel-reinventing. But how do you do this without this file becoming bloated, cluttered, and unmanageable? The answer is to let it become bloated and cluttered. Enter the regex_learning_tool consisting of a SAS Enterprise Guide project and an Excel file containing your practice trail in the form of match records each with a different perl regular expression and/or source string. The regex_learning_tool allows both beginner and expert to efficiently practice PRX matching by selecting and processing only the match records that the user is interested in based on a search of either PRX Metacharacters contained in the perl regular expression or character string(s) contained in a match description field. The current Excel file contains over 400 match records demonstrating the use of most all PRX Metacharacters. This paper will explain how to use the regex_learning_tool so that you can practice PRX matching, retain what you learn, and not have to worry about how bloated, cluttered, and unmanageable your practice trail becomes. The regex_learning_tool project was written using SAS Enterprise Guide 5.1 and SAS 9.3 on a Windows 7 Enterprise operating system. A copy of the SAS Enterprise Guide project, Excel file, as well as other tool-related material can be found at sascommunity.org under Papers and Presentations.