1. A method for controlling functions of a motor vehicle (1) comprising a drive motor (2), a driving clutch (3), a service brake (13, 14) that acts upon wheels (11, 12), a working device (21) and a hydraulic pump (15) that supplies actuators on the driving clutch (3), the service brake (13, 14) and the working device (21) with pressure medium via hydraulic pressure conduits,
the method comprising the step of automatically opening the driving clutch (3) and automatically closing the service brake (13, 14) when a load acting upon the working device (21) of the motor vehicle exceeds a predetermined load threshold or is activated so as to exceed.
2. The method according to claim 1 further comprising the step of opening the driving clutch (3) and closing the service brake (13, 14) when one or more of a pressure, a force and a filling state height sensor (35) on the working device (21) signals a control device (22) that hydraulic pressure available for a propulsion operation of the working device (21) is no longer sufficient to master a load at hand.
3. The method according to claim 1 further comprising the step of activating the opening of the driving clutch (3) and closing of the service brake (13, 14) when a speed of travel is one of zero or approximately zero.
4. The method according to claim 3 further comprising the step of signaling the speed of travel of the motor vehicle to a control device (22) via sensors (33, 34) on one or more of drive or output shafts (6, 7) of the wheels (8, 9) and on a transmission input shaft.
5. The method according to claim 1, further comprising the step of activating a parking brake of the motor vehicle instead of or in addition to the service brake (13, 14).
6. The method according to claim 1, further comprising the step of, one of during or after opening the driving clutch (3), transmitting via a control device (22) a signal for changing power to one of a motor control device (23) or directly to an output regulating device of the drive motor (2).
7. The method according to claim 6, further comprising the step of using the signal to the motor control device (23) to trigger a reduction in power output of the motor (2).
8. The method according to claim 1, further comprising the step of closing the driving clutch and opening one or more of the service brake (13, 14) and a parking brake upon ending a working operation of the working device (21).
9. The method according to claim 8, further comprising the step of, one of during closing or after closing the driving clutch (3) and opening one or more of the service brake (13,14) and the parking brake, issuing via the control device (22) a signal to change a power output of the drive motor (2).
10. A device for controlling functions of a work motor vehicle (1) with a drive motor (2), a driving clutch (3), a service brake (13, 14) that acts on motor vehicle wheels (11, 12), a working device (21) and with a hydraulic pump (15), which supplies actuators on the driving clutch (3), on the service brake (13, 14) and on the working device (21) with pressure medium through hydraulic pressure conduits,
wherein the driving clutch (3) is automatically opened and the service brake (13, 14) is automatically closed when a load acting upon the working device (21) of the motor vehicle exceeds a preset load threshold or is activated so as to exceed.
11. The device according to claim 10, wherein a control device (22) is connected by a control conduit (24) via one of a motor control device (23) or directly to a power regulation device of the drive motor (2).
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1-6. (canceled)
7. An apparatus, comprising:
a processor;
a computer-readable storage medium, coupled to the processor; and
logic, stored on the computer-readable storage medium and executed on the processor; for:
selecting a multiplier (R) in accordance with a formula R=PI wherein P is a prime number and I a number is selected such that PI is less than the number of hits in every packet of a plurality of packets, the plurality of packets corresponding to a message:
generating a modulus (M) wherein M is generated in accordance a formula M=(PN*QT)\u22121, where N, Q and T are numbers selected such that M is greater than the number of bits in every packet of the plurality of packets and N>1;
employing M and R, in accordance with a cryptography system, to encrypt each packet of plurality of packets to generate a plurality of encrypted packets;
aggregating the plurality of encrypted packets to generate an encrypted message; and
transmitting the encrypted message.
8. The apparatus of claim 7, wherein the cryptography system is a public key system.
9. The apparatus of claim 7, wherein the cryptography system is a private key system.
10. The apparatus of claim 9, wherein the private key system is a knapsack encryption system.
11. The apparatus of claim 7, wherein the cryptography system is of the form (a message * an encryption key) modulo (a number), where the number>length of a packet to be encrypted.
12. The apparatus of claim 7, the logic further comprising logic for:
generating an inverse key in accordance with the formula R\u22121=(PN\u2212I* QT) such that R\xb7R\u22121 mod M=1; and
decrypting the message by employing the inverse key.
13. A computer programming product, comprising:
a computer-readable storage medium; and
logic, stored on the computer-readable storage medium for execution on a processor; for:
selecting a multiplier (R) in accordance with a formula R=PI wherein P is a prime, number and I a number is selected such that PI is less than the number of bits in every packet of a plurality of packets, the plurality of packets corresponding to a message;
generating a modulus (M) wherein Ni is generated in accordance a formula M=(PN*QT)\u22121, where N, Q and T are numbers selected such that M is greater than the number of bits in every packet of the plurality of packets and N>1;
employing M and R, in accordance with a cryptography system, to encrypt each packet of plurality of packets to generate a plurality of encrypted packets;
aggregating the plurality of encrypted packets to generate an encrypted message; and
transmitting the encrypted message.
14. The computer programming product of claim 13, wherein the cryptography system. is a public key system.
15. The computer programming product of claim 13, wherein the cryptography system. is a private key system.
16. The computer programming product of claim 15, wherein the private key system is a knapsack encryption system.
17. The computer programming, product of claim 13, wherein the cryptography system is of the form (a message * an encryption key) modulo (a number), where the number>length of a packet to be encrypted.
18. The computer programming product of claim 13, the logic further comprising logic for:
generating an inverse key in accordance with the formula R\u22121=(PN\u2212I* QT) such that R\xb7R\u22121 mod M=1; and
decrypting the message by employing the inverse key.
19. A cryptography system, comprising:
a processor;
a computer-readable storage medium, coupled to the processor; and
logic, stored on the computer-readable storage medium and executed on the processor; tor:
selecting a multiplier (R) in accordance with a formula R=PI wherein P is a prime number and I a number is selected such that PI is less than the number of bits in every packet of a plurality of packets, the plurality of packets corresponding to a message;
generating a modulus (M) wherein M is generated in accordance a formula M=(PN*QT)\u22121, where N, Q and T are numbers selected such that M is greater than the number of bits in every packet of the plurality of packets and N>1;
employing M and R to encrypt each packet of plurality of packets to generate a plurality of encrypted packets;
aggregating, the plurality of encrypted packets to generate an encrypted message; and
transmitting the encrypted message.
20. The cryptography system of claim 19, wherein the cryptography system is a public key system.
21. The cryptography system of claim 19, wherein the cryptography system is a private key system.
22. The cryptography system of claim 21, wherein the private key system is a knapsack encryption system.
23. The cryptography system of claim 19, wherein the cryptography system is of the form (a message * an encryption key) modulo (a number), where the number>length of a packet to be encrypted.
24. The cryptography system of claim 19, the logic further comprising logic for:
generating an inverse key in accordance with the formula R\u22121=(PN\u2212I* QT) such that R\xb7R\u22121 mod M=1; and
decrypting the message by employing the inverse key.