Abstract: In one exemplary embodiment of the invention, a method for computing a resultant and a free term of a scaled inverse of a first polynomial v(x) modulo a second polynomial fn(x), including: receiving the first polynomial v(x) modulo the second polynomial fn(x), where the second polynomial is of a form fn(x)=xn±1, where n=2k and k is an integer greater than 0; computing lowest two coefficients of a third polynomial g(z) that is a function of the first polynomial and the second polynomial, where g(z)?i=0n?1(v(?i)?z), where ?0, ?1, . . . , ?n?1 are roots of the second polynomial fn(x) over a field; outputting the lowest coefficient of g(z) as the resultant; and outputting the second lowest coefficient of g(z) divided by n as the free term of the scaled inverse of the first polynomial v(x) modulo the second polynomial fn(x).

Abstract: Aspects of the disclosure relate to combining on-chip structure with external current measurements for threat detection in an integrated circuit. This method considers Trojans' impact on neighboring cells and on the entire IC's power consumption, and effectively localizes the measurement of dynamic power. An on-chip structure can permit threat detections. In one aspect, the on-chip structure can comprise a plurality of sensors distributed across the entirety of the IC, with each sensor of the plurality of sensors being placed in different rows of a standard-cell design. In another aspect, data analysis can permit separating effect of process variations on transient power usage of the IC from effects of a hardware threat such power usage. The on-chip structure also can be employed for implementation of a PE-PUF.

Abstract: Side channel attacks against a computing device are prevented by combinations of scrambling data to be stored in memory and scrambling the memory addresses of the data using software routines to execute scrambling and descrambling functions. Encrypted versions of variables, data and lookup tables, commonly employed in cryptographic algorithms, are thus dispersed into pseudorandom locations. Data and cryptographic primitives that require data-dependent memory accesses are thus shielded from attacks that could reveal memory access patterns and compromise cryptographic keys.

Abstract: In one exemplary embodiment of the invention, a method for computing a resultant and a free term of a scaled inverse of a first polynomial v(x) modulo a second polynomial fn(x), including: receiving the first polynomial v(x) modulo the second polynomial fn(x), where the second polynomial is of a form fn(x)=xn±1, where n=2k and k is an integer greater than 0; computing lowest two coefficients of a third polynomial g(z) that is a function of the first polynomial and the second polynomial, where g ? ( z ) ? = def ? ? i = 0 n - 1 ? ? ( v ? ( ? i ) - z ) , where ?0, ?1, . . . , ?n?1 are roots of the second polynomial fn(x) over a field; outputting the lowest coefficient of g(z) as the resultant; and outputting the second lowest coefficient of g(z) divided by n as the free term of the scaled inverse of the first polynomial v(x) modulo the second polynomial fn(x).

Abstract: A secure system for user authentication comprised of an authentication interface having a character dial and alignment markers is provided. A passcode input module receives user commands to move the character dial with respect to the alignment markers and to record a configuration of the characters with respect to the alignment markers, thereby creating alignment configuration data. A passcode generation module receives at least one of said alignment configuration data from passcode input module and generates a plurality of passcode hypotheses. An authentication module receives the passcode hypotheses and compares the passcode hypotheses with the passcodes of registered users stored in a data store. The passcode hypotheses are updated after each new alignment configuration data entered by the user. The authentication module authenticates a user upon finding a passcode hypothesis matching a stored passcode.

Abstract: A watch able to be used as a cryptographic system to encrypt plaintext to ciphertext or decrypt ciphertext to plaintext includes a watch face and a plurality of concentric rings. Each of the plurality of concentric rings is rotatable with respect to the watch face and includes a number of symbols, the number of symbols corresponding to the number of hours represented on the watch face, at least some of the symbols corresponding to letters of an alphabet, characters in a writing system and/or numbers. At least one of the plurality of concentric rings is rotatable in a direction opposite to a direction of at least one other of the plurality of concentric rings.

Abstract: Side channel attacks against a computing device are prevented by combinations of scrambling data to be stored in memory and scrambling the memory addresses of the data using software routines to execute scrambling and descrambling functions. Encrypted versions of variables, data and lookup tables, commonly employed in cryptographic algorithms, are thus dispersed into pseudorandom locations. Data and cryptographic primitives that require data-dependent memory accesses are thus shielded from attacks that could reveal memory access patterns and compromise cryptographic keys.

Abstract: A method for determining, for use in ciphers, all of the prime numbers within the large numeric series: 5, 6, 7, 8, 9, 10, 11, 12, . . . , n, the method including steps of setting n?=?n/6?; establishing the small numeric series, 6(1)?1, 6(1)+1, 6(2)?1, 6(2)+1, 6(3)?1, 6(3)+1, . . .

Abstract: The present invention is directed to a system and method for adding data encryption services to a document processing device. Encryption enablement software, which includes two alternate encryption mechanisms, is received by an associated document processing device. The device then awaits an associated user's selection of an electronic document file to be encrypted and subsequently encrypts the file using one of the available encryption mechanisms. The electronic document file is divided into blocks having a preselected length. An encryption key block containing first and second key portions, is then generated. The electronic data file is then encrypted using the first encryption key portion to form first level encryption data. The first level encryption data is then decrypted using the second encryption key portion to form second level encryption data. The second level encryption data is then encrypted using the first key portion to form a final encrypted electronic document file.

Abstract: The machine involves code wheels in cascade or in a maze with random or mixed circuits which operate a printing device to print the cipher conjugate of the letter on an operated key when the keyboard is connected to one end of the code wheel maze, and to print the plain conjugate of the letter in cipher when a key bearing such letter is operated with the keyboard connected to the other end of the code wheel maze. The printer is connected to the end of the code wheel maze opposite the end to which the keyboard is connected in both cases.

Abstract: The cryptographic system automatically and continuously changes the cipher equivalents representing plaintext characters so as to prevent any periodicity in the relationship. The system has a series of juxtaposed, rotatable, connection changing mechanisms to provide a large number of alternative paths for the passage of an electric current corresponding to a message character. Further, the system has parts for the irregular and permutative displacements of the members of a set of circuit changing mechanisms to thwart cryptanalysis. The juxtaposed cipher commutators are controlled by cam wheels of different diameters.

Abstract: The crytographic system automatically and continuously changes the cipher equivalents representing plaintext characters so as to prevent any periodicity in the relationship. The system has a series of juxtaposed, rotatable, connection changing mechanisms to provide a large number of alternative paths for the passage of an electric current corresponding to a message character. Further, the system has parts for the irregular and permutative displacements of the members of a set of circuit changing mechanisms to thwart cryptanalysis.

Abstract: A document reader having a scanner. The layout of the image data read by the scanner from a document is analyzed. In accordance with the analysis of the lay out, the image data is divided into blocks, and the sequence in which to read characters from these blocks is determined. A keyboard or a mouse is operated, whenever necessary, thereby deleting any block and changing the sequence of reading characters from the blocks. Characters are read from the document in the sequence changed.

Abstract: A method of encrypting a sequence of characters such as a code number on an information slide or disc is provided. The method allows the encryption of a plurality of sequences on a single user-markable disc or slide which may be deciphered by a reference to a single code word.

Abstract: A simple and inexpensive apparatus for encoding and decoding messages is disclosed. The apparatus comprises a first surface having a first series of indicia and a second surface having a series of letters. Each of the letters correspond to a unique one of the indicia. The device further includes a cover for rotating one of the surfaces through a plurality of positions and sequentially revealing one of the indicia and its corresponding letter.

Abstract: An inexpensive encryption device, system and method includes coded alphanumeric characters preprinted according to different key codes on mail-out forms that can be manipulated by a prospective user to yield encrypted data that can be returned over unsecure transmission channels for secure decryption by the operator of a computer-secured operating system. Error-correcting encoding is included to obviate the effects upon telephone keypad entry of secured data that includes error-prone alpha and numeric characters.

Abstract: An inexpensive encryption device, system and method includes coded alphanumeric characters preprinted according to different key codes or mail-out forms that can be manipulated by a prospective user to yield encrypted data that can be returned over unsecure transmission channels for secure decryption by the operator of a computer-secured operating system.

Abstract: A system for the metering of encrypted postage and similar indicia includes a device for printing such indicia and a device for reading such indicia. The printing is accomplished with a dot matrix printer driven by signals obtained by altering character generation signals with encryption signals. The interleaving is accomplished on a row-by-row basis by inserting delays from an encryption circuit into signals from a character generator circuit. The reading is accomplished by correlating received characters against a stored array of a symbols to determine the presence of a symbol, the extraction of coded data from character data of the received and identified character, and the comparison of the separated coded data with a reference code to determine the accuracy of the printed material. Thereby, forgery and alteration is inhibited.